DocumentCode :
2302444
Title :
On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
Author :
Milosevic, Zarko ; Hutle, Martin ; Schiper, André
Author_Institution :
Ecole Polytech. Fed. de Lausanne (EPFL), Lausanne, Switzerland
fYear :
2011
fDate :
4-7 Oct. 2011
Firstpage :
235
Lastpage :
244
Abstract :
We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we give the first deterministic atomic broadcast reduction with a constant time complexity with respect to consensus.
Keywords :
computational complexity; fault tolerant computing; message passing; protocols; Byzantine consensus; Byzantine fault; atomic broadcast reduction; deterministic atomic broadcast reduction; time complexity; Complexity theory; Context; Delay; Indexes; Reliability; Semantics; Vectors; Atomic broadcast; Byzantine faults; Reduction; consensus;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reliable Distributed Systems (SRDS), 2011 30th IEEE Symposium on
Conference_Location :
Madrid
ISSN :
1060-9857
Print_ISBN :
978-1-4577-1349-1
Type :
conf
DOI :
10.1109/SRDS.2011.36
Filename :
6076782
Link To Document :
بازگشت