A Hypergraph Approach to Distributed Broadcast
arxiv(2024)
摘要
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. A key contribution of our work is the
establishment of a general lower bound for the problem using the min-cut
capacity of hypergraphs. Additionally, we present the 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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要