Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ISPAN.2004.1300496 | ISPAN |
Keywords | Field | DocType |
protocols,message complexity reduction,communication complexity,message efficiency,message sending,t-resilient consensus protocol,lower bound concentration,message efficient early-stopping uniform consensus protocol,synchronous distributed systems,distributed processing,distributed system,distributed computing,internet,detectors,computer science,lower bound,mobile computing | Mobile computing,Early stopping,Computer science,Upper and lower bounds,Computer network,Communication complexity,Distributed algorithm,Uniform consensus,Message passing,Distributed computing,The Internet | Conference |
ISSN | ISBN | Citations |
1087-4089 | 0-7695-2135-5 | 1 |
PageRank | References | Authors |
0.37 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianbing Wang | 1 | 90 | 9.98 |
| Jiannong Cao | 2 | 5226 | 425.12 |
| Yong Meng Teo | 3 | 564 | 54.77 |