Shallow Overlay Trees Suffice for High-Throughput Consensus

2019/03/07 by Hao Tan, Tan, Hao, Wojciech Golab +1
Computer Science · #Caching and Content Delivery #Distributed #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks #Parallel #Peer-to-Peer Network Technologies #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1903.03164

openalex publication_date 2019/03/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

All-to-all data transmission is a typical data transmission pattern in blockchain systems. Developing an optimization scheme that provides high throughput and low latency data transmission can significantly benefit the performance of those systems. In this work, we consider the problem of optimizing all-to-all data transmission in a wide area network(WAN) using overlay multicast. We prove that in a congestion-free core network model, using shallow broadcast trees with heights up to two is sufficient for all-to-all data transmission to achieve the optimal throughput allowed by the available network resources.

Related

• Fast and Efficient Bulk Multicasting over Dedicated Inter-Datacenter Networks
• Multipath Approach for Reliability in Query Network based Overlaid\n Multicasting
• Broadcasting Algorithm with Per-neighbor Queues
• Minimum-Energy All-to-All Multicasting in Multi-hop Wireless Networks
• Approaches to Maintain Bi-connectivity for Resilience in Overlaid Multicasting