Capacity of byzantine agreement: summary of recent results

Authors:
Guanfeng Liang;Nitin Vaidya
Affiliations:
University of Illinois at Urbana-Champaign, Urbana, IL, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA
Venue:
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
Year:
2010

Citing 2
Cited 0

The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
When watchdog meets coding

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, for two cases: i. communication link's capacity is fixed; and ii. the sum capacity of all links in the system is fixed. Byzantine is a classical problem in distributed computing, with initial solutions presented in the seminal work of Pease, Shostak and Lamport. The notion of throughput here is similar to that used in the networking/communications literature on unicast or multicast traffic. In case i, we characterize the maximum achievable agreement throughput in four-node networks. In case ii, we identify sufficient condition for achieving agreement throughput R.