A randomized algorithm for distributed consensus
A Kumar - … IEEE Symposium on Reliable Distributed Systems …, 1998 - ieeexplore.ieee.org
Proceedings Seventeenth IEEE Symposium on Reliable Distributed …, 1998•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results