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

Guanfeng Liang, Nitin H Vaidya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012
DOIs
StatePublished - Mar 15 2012
Event2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012 - Bangalore, India
Duration: Jan 3 2012Jan 7 2012

Publication series

Name2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012

Other

Other2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012
CountryIndia
CityBangalore
Period1/3/121/7/12

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Capacity of Byzantine consensus in capacity limited point-to-point networks'. Together they form a unique fingerprint.

  • Cite this

    Liang, G., & Vaidya, N. H. (2012). Capacity of Byzantine consensus in capacity limited point-to-point networks. In 2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012 [6151308] (2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012). https://doi.org/10.1109/COMSNETS.2012.6151308