A. Itai, "On the computational power needed to elect a leader", Lecture Notes in Computer Science, vol. 486, 1991, pp. 29-40.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can be characterized by probabilities. The spirit of our approach is close to that of [1] and [24] Our protocol s probabilistic guarantees are similar to those of leader election algorithms for the perfect information model [14, 25] while our guarantee on the number of messages resembles that of [11], which presents an election protocol for anonymous rings. To the best of our knowledge, ours is the first protocol that trades correctness of the leader election problem for better scalability. The analysis and simulation of our protocol will assume a network model where process failures, and ....

A. Itai, "On the computational power needed to elect a leader", Lecture Notes in Computer Science, vol. 486, 1991, pp. 29-40.

....be characterized by probabilities. The spirit of our approach is close to that of [3] and [30] Our protocol s probabilistic guarantees are similar to those of leader election algorithms for the perfect information model [18, 32] while our guarantee on the number of messages resembles that of [14], which presents an election protocol for anonymous rings. To the best of our knowledge, ours is the first protocol that trades correctness of the leader election problem for better scalability. The rest of the paper is organized as follows. Section 2 describes the assumed model and statement of ....

A. Itai, "On the computational power needed to elect a leader", Lecture Notes in Computer Science, vol. 486, 1991, pp. 29-40.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC