DocumentCode :
3316703
Title :
Capacity of Byzantine consensus in capacity limited point-to-point networks
Author :
Liang, Guanfeng ; Vaidya, Nitin
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
fYear :
2012
fDate :
3-7 Jan. 2012
Firstpage :
1
Lastpage :
10
Abstract :
In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a capacity constraint. We derive an upper bound of the capacity of consensus in general point-to-point networks, and prove its tightness in 4-node complete networks by construction. We also provide a probabilistically correct algorithm that achieves the upper bound in general networks.
Keywords :
probability; radio links; 4-node complete networks; Byzantine consensus; capacity limited point-to-point networks; link capacity constraint; probabilistic correct algorithm; upper bound consensus capacity; Algorithm design and analysis; Impedance matching; Peer to peer computing; Reliability; Switches; Throughput; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Systems and Networks (COMSNETS), 2012 Fourth International Conference on
Conference_Location :
Bangalore
Print_ISBN :
978-1-4673-0296-8
Electronic_ISBN :
978-1-4673-0297-5
Type :
conf
DOI :
10.1109/COMSNETS.2012.6151308
Filename :
6151308
Link To Document :
بازگشت