.png){kind=icon}
.png){kind=icon}
Return
A Hypergraph Approach to Distributed Broadcast
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2025.3618864.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper explores the distributed broadcast problem within the context of network communications, a critical challenge in decentralized information dissemination. We put forth a novel hypergraph-based approach to address this issue, focusing on minimizing the number of broadcasts to ensure comprehensive data sharing among all network users. The key contributions of this work include the establishment of a general lower bound for the problem using the min-cut capacity of hypergraphs, and a distributed broadcast for quasi-trees (DBQT) algorithm tailored for the unique structure of quasi-trees, which is proven to be optimal. This paper advances both network communication strategies and hypergraph theory, with implications for a wide range of real-world applications, from vehicular and sensor networks to distributed storage systems.
Keywords:
Distributed broadcast
hypergraph
index coding
distributed storage
coded caching
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
View more organizations