Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-343110

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.