PODC10

323 views

Published on

Presented on PODC 2010 on the capacity of Byzantine agreement

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
323
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

PODC10

  1. 1. Capacity of Byzantine Agreement with Finite Link Capacity Guanfeng Liang Nitin VaidyaUniversity of Illinois at Urbana-Champaign
  2. 2. Byzantine Agreement : “broadcast”• n nodes, one source• < n/3 faults• Nodes must agree on source’s value if it is fault-free Erasure coding strategy to detect failure
  3. 3. Erasure Code (example) Data = a, b S a a+b b 1 3 2a, b non-binary
  4. 4. Erasure CodeData = a, b S a a+b b 1 3 2 b a+b
  5. 5. Byzantine Agreement• Agreement on a sequence of L bits• Erasure code for failure detection – Additional rounds in case of detection
  6. 6. Result 1: Communication Complexity• Deterministic algorithm• Communication complexity for agreement on L bits when L  ∞ O (n L)Linear in number of nodes
  7. 7. Result 2: Four Node Networks• n=4 , 1 fault• Each point-to-point link has (arbitrary) finite capacity• Algorithm that maximizes throughput of agreement• First algorithm that accounts for link capacity constraints
  8. 8. Result 3: Symmetric Networks• n nodes , < n/3 faults• Each link with identical capacity• Algorithm that maximizes throughput of agreement

×