Citations
Altmetric:
Alternative Title
Abstract
Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.
Keywords
Source Title
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Publisher
Series/Report No.
Collections
Rights
Date
2004
DOI
Type
Conference Paper