Title :
A randomized algorithm for distributed consensus
Author_Institution :
Colorado Univ., Boulder, CO, USA
Abstract :
We describe a randomized, fully distributed algorithm for distributed consensus and evaluate its performance assuming probabilistically bounded message delay. Each node randomly contacts a few other nodes and incorporates their values into its own value. All the nodes are able to reach consensus in this manner after a few rounds. The results show that the randomized algorithm is flexible, efficient and robust, and offers several advantages over a deterministic algorithm
Keywords :
deterministic algorithms; distributed algorithms; randomised algorithms; software performance evaluation; deterministic algorithm; distributed algorithm; distributed consensus; message delay; performance evaluation; randomized algorithm; Aggregates; Costs; Delay; Identity-based encryption; Protocols;
Conference_Titel :
Reliable Distributed Systems, 1998. Proceedings. Seventeenth IEEE Symposium on
Conference_Location :
West Lafayette, IN
Print_ISBN :
0-8186-9218-9
DOI :
10.1109/RELDIS.1998.740511
