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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 287-292 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Symposium on Reliable Distributed Systems |
| State | Published - Dec 1 1998 |
| Event | Proceedings of the 1998 IEEE 17th Symposium on Reliable Distributed Systems, SRDS - West Lafayette, IN, USA Duration: Oct 20 1998 → Oct 23 1998 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications