Capacity of Byzantine consensus in capacity limited point-to-point networks

—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.

• Type: Journal
• Year: 2012
• Where: COMSNETS
• Authors: Guanfeng Liang, Nitin H. Vaidya
• Keywords: Capacity Constraint, Complete Networks, COMSNETS 2012, Correct Algorithm