I. Gupta, R. van Renesse, and K. P. Birman. A probabilistically correct leader election protocol for large groups. In 14th International Symposium on DIStributed Computing (DISC), pages 89--103, Oct. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Probabilistic Atomic Broadcast - Felber, Pedone (2001) (4 citations) (Correct)
....and Related Work Epidemic protocols, also known as gossip protocols, were introduced in [3] in the context of replicated database consistency management. More recently, the idea has been used to build failure detection mechanisms [7, 15] garbage collection [6] leader election algorithms [10], and group communication protocols, as we review next. In [2] a gossip based mechanism is proposed to implement reliable broadcast in large networks. The protocol proceeds in two phases: in the first k=10 k=5 Number of processes with probability P=0.99 Gossip step for reaching all ....
K. P. B. I. Gupta, R. van Renesse. A probabilistically correct leader election protocol for large groups. In Proceedings of the 14th International Symposium on Distributed Computing, pages 89-- 103, Toledo, Spain, Oct. 2000.
A Probabilistically Correct Leader Election Protocol for .. - Gupta, van Renesse.. (2000) (3 citations) Self-citation (Gupta Van renesse Birman) (Correct)
....round or phase. 4 Analysis Properties of the Protocol In this section, we summarize the analysis of the probability of success, detection on incorrect termination and message and time complexity of a round of our protocol. Detailed discussions and proofs of the results are available in [10]. Let N be the number of group members at the start of the election round we will assume that this value is approximately known to all group members so that the filter value calculation is consistent across members. Let view prob be the probability of any member M i having any other member M k ....
I. Gupta, R. van Renesse, K.P. Birman, "A probabilistically correct leader election protocol for large groups", Computer Science Technical Report ncstrl.cornell/TR
On Scalable and Efficient Distributed Failure Detectors - Gupta, Chandra, Goldszmidt (2001) (16 citations) Self-citation (Gupta) (Correct)
.... members (faulty or otherwise) Our protocol specification and analysis assumes that this maximal group membership is always the same at all members, but our results can be extended to a model with dynamically changing membership and members with incomplete views, using methodologies similar to [10]. Members may su#er crash (non Byzantine) failures, and recover subsequently. Unlike other papers on failure detectors (e.g. 14] that consider a member as faulty if they are perturbed and sleep for a time greater than some pre specified duration, our notion of failure considers that a member is ....
I. Gupta, R. van Renesse, and K. P. Birman. A probabilistically correct leader election protocol for large groups. In Proceedings of 14th International Symposium on Distributed Computing (DISC 2000.
On Scalable and Efficient Distributed Failure Detectors - Gupta, Chandra (2001) (16 citations) Self-citation (Gupta) (Correct)
.... members (faulty or otherwise) Our protocol specification and analysis assumes that this maximal group membership is always the same at all members, but our results can be extended to a model with dynamically changing membership and members with incomplete views, using methodologies similar to [10]. Members may su#er crash (non Byzantine) failures, and recover subsequently. Unlike other papers on failure detectors (e.g. 14] that consider a member as faulty if they are perturbed and sleep for a time greater than some pre specified duration, our notion of failure considers that a member is ....
I. Gupta, R. van Renesse, and K. P. Birman. A probabilistically correct leader election protocol for large groups. In Proceedings of 14th International Symposium on Distributed Computing (DISC
Understanding and Mitigating the Effects of Denial-of-Service.. - Sasson (Correct)
No context found.
I. Gupta, R. van Renesse, and K. P. Birman. A probabilistically correct leader election protocol for large groups. In 14th International Symposium on DIStributed Computing (DISC), pages 89--103, Oct. 2000.
Probabilistic Atomic Broadcast - Pascal Felber Fernando (2002) (4 citations) (Correct)
No context found.
K. P. Birman I. Gupta, R. van Renesse. A probabilistically correct leader election protocol for large groups. In Proceedings of the 14th International Symposium on Distributed Computing, pages 89--103, Toledo, Spain, October 2000.
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