An approach to achieve message efficient early-stopping uniform consensus protocols

Author

Wang, Xianbing ; Cao, Jiannong ; Teo, Yong Meng

fYear

2004

fDate

10-12 May 2004

Firstpage

300

Lastpage

305

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

communication complexity; distributed processing; protocols; lower bound concentration; message complexity reduction; message efficiency; message efficient early-stopping uniform consensus protocol; message sending; synchronous distributed systems; t-resilient consensus protocol; Computer crashes; Computer science; Delay systems; Detectors; Distributed computing; Educational institutions; Internet; Mobile computing; Protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

ISSN

1087-4089

Print_ISBN

0-7695-2135-5

Type

conf

DOI

10.1109/ISPAN.2004.1300496

Filename

1300496

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3013542