Your SlideShare is downloading. ×
0
PODC10
PODC10
PODC10
PODC10
PODC10
PODC10
PODC10
PODC10
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

PODC10

162

Published on

Presented on PODC 2010 on the capacity of Byzantine agreement

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
162
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Capacity of Byzantine Agreement with Finite Link Capacity Guanfeng Liang Nitin VaidyaUniversity of Illinois at Urbana-Champaign
  • 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. Erasure Code (example) Data = a, b S a a+b b 1 3 2a, b non-binary
  • 4. Erasure CodeData = a, b S a a+b b 1 3 2 b a+b
  • 5. Byzantine Agreement• Agreement on a sequence of L bits• Erasure code for failure detection – Additional rounds in case of detection
  • 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. 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. Result 3: Symmetric Networks• n nodes , < n/3 faults• Each link with identical capacity• Algorithm that maximizes throughput of agreement

×