Randomized leader election

13 years 4 months ago

Download www.cs.purdue.edu

d bins abstraction and works in two phases. The main novelty of the work is in the ﬁrst phase where the number of contending processes is reduced in a controlled manner. Probabilistic quorums are used to determine a winner in the second phase. We discuss, in detail, the synchronous version of the algorithm, provide extensions to an asynchronous version and examine the impact of failures.

Murali Krishna Ramanathan, Ronaldo A. Ferreira, Su

Real-time Traffic

Controlled Manner | DC 2001 | DC 2007 | Probabilistic Quorums | ﬁrst Phase |

claim paper

» Randomized selfstabilizing and space optimal leader election under arbitrary scheduler on ...

» MDVM System Concept Paging Latency and Round2 Randomized Leader Election Algorithm in SG

» Model Checking Probabilistic Distributed Systems

» Adversary Immune Leader Election in ad hoc Radio Networks

» Memory Space Requirements for SelfStabilizing Leader Election Protocols

» Average Execution Time Analysis of a Selfstabilizing Leader Election Algorithm

» A gametheoretic intrusion detection model for mobile ad hoc networks

» Randomized Initialization Protocols for Packet Radio Networks

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DC
Authors	Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski

Comments (0)

Sciweavers

Randomized leader election

Controlled Manner | DC 2001 | DC 2007 | Probabilistic Quorums | ﬁrst Phase |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers