Asynchronous Byzantine Agreement in Incomplete Networks
This discussion delves into the concept of Asynchronous Byzantine Agreement in the context of incomplete networks, analyzing the challenges and solutions proposed by Ye Wang and Roger Wattenhofer from ETH Zurich's Distributed Computing department. The images and scenarios presented shed light on the complexities of achieving agreement in such network configurations.
Download Presentation

Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Asynchronous Byzantine Agreement in Incomplete Networks Ye Wang and Roger Wattenhofer ETH Zurich ETH Zurich Distributed Computing www.disco.ethz.ch
Send Message from Zurich to New York Ye@Zurich AFT@New York
Send Message from Zurich to New York Basel Paris Ye@Zurich London AFT@New York
Asynchronous Byzantine Agreement in Incomplete Networks An undirected network ? with ? nodes, where ? nodes are Byzantine.
Asynchronous Byzantine Agreement in Incomplete Networks Necessary & Sufficient Conditions for Asynchronous Byzantine Agreement ? is 2? + 1 connected
Hierarchy of the Algorithms Byzantine Agreement Algorithm Byzantine Reliable Broadcast Message Delivery in Incomplete Networks
Hierarchy of the Algorithms Byzantine Agreement Algorithm Byzantine Reliable Broadcast Message Delivery in Incomplete Networks
Sufficient Condition sender ? intermediate ? receiver ?
Sufficient Condition 2? + 1 Disjoint paths
Sufficient Condition sender ? intermediate ? receiver ?
Asynchronous Byzantine Agreement in Incomplete Networks An undirected network ? with ? nodes, where ? nodes are Byzantine. Necessary & Sufficient Conditions for Asynchronous Byzantine Agreement ? is 2? + 1 connected
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ? ? ? ? ? ? ? ?
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ? ? ? ?
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ?0 ?1 ? ?1 ?0 ?1 ?0 ? ? ?0 ?1 ?
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ?0 ?1 ?0 ?1 ?0 ?1 ?0 ?1 ?0 ?0 ?0 ?1 ?0
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ?0 ?1 ?1 ?0 ?1 ?1 ?0 ?1 ?0 ?1 ?0 ?1 ?1
Necessary Condition If the connectivity of ? is smaller than 2? + 1 ?0 ?1 ?0 ?0 ?1 ?1 ?0 ?1 ?1 ?0 ?0 ?1 ?1
Thanks! Questions & Comments? ETH Zurich Distributed Computing www.disco.ethz.ch