Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-03-31
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We consider the problem of maximizing the throughput of Byzantine consensus, when communication links have finite capacity. Byzantine consensus is a classical problem in distributed computing. In existing literature, the communication links are implicitly assumed to have infinite capacity. The problem changes significantly when the capacity of links is finite. We define the throughput and capacity of consensus, and identify upper bound of achievable consensus throughput. We propose an algorithm that achieves consensus capacity in complete four-node networks with at most 1 failure with arbitrary distribution of link capacities.
Liang Guanfeng
Vaidya Nitin
No associations
LandOfFree
Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-343110