arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.16376cs.ITcs.MAcs.SYeess.SYmath.IT
收藏

一种面向分布式广播的超图方法

A Hypergraph Approach to Distributed Broadcast

Qi Cao, Yulin Shao, Fan Yang, Octavia A. Dobre

AI总结:

针对网络通信中的分布式广播难题,提出基于超图的新方法,建立问题通用下界并设计最优的准树分布式广播DBQT算法,推动相关理论与应用发展。

摘要:

本文探讨网络通信场景下的分布式广播问题,这是去中心化信息传播中的一项关键挑战。我们提出了一种新颖的基于超图的方法来解决该问题,核心目标是最小化广播次数,以确保所有网络用户间实现全面的数据共享。本研究的核心贡献包括:利用超图的最小割容量建立了该问题的通用下界,以及针对准树的独特结构设计了准树分布式广播(DBQT)算法,且已证明该算法具备最优性。本文推动了网络通信策略与超图理论的发展,对车联网、传感器网络以及分布式存储系统等广泛的实际应用具有指导意义。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑