|Title:||Electing a Leader in the Presence of Faults: A Ring as a Special Case
|Authors:||L. Shrira and O. Goldreich
|Abstract:||We consider the problem of electing a leader in a network consisting of links which may fail. In particular, we study the special case in which the network is a ring of n-processors (and one of its links may fail). We present an O(n logn) algorithm for electing a leader in such a "faulty" ring.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0354), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1985
To the main CS technical reports page
Computer science department, Technion