arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2503.04511cs.DScs.DM
收藏

源无关广播

Source-Oblivious Broadcast

Pierre Fraigniaud, Hovhannes A. Harutyunyan

AI总结:

本文在紧凑分布式数据结构框架下重新研究最小广播图,证明列表编码的协议不限制广播能力,并构造出能在最优轮数内完成广播且边数渐近最优的图。

摘要:

本文重新研究了(最小)广播图,即能够实现从每个源节点到所有其他节点的快速信息传播(且具备此属性所需的边数最少)的图。本研究在紧凑分布式数据结构的框架下进行,即当广播协议被限制在每个节点上编码为一个有序邻居列表,指定在接收到消息后,该消息必须以何种顺序传递给这些邻居。我们表明,就(最小)广播图的设计而言,这种约束并不限制广播协议的能力。具体而言,我们证明,对于每个$n$,存在$n$节点图,可以为它们设计由列表编码的协议,从而实现从每个源节点在$\lceil\log_2n\rceil$轮内完成广播,这对于一般的(即非空间受限的)广播协议而言也是最优的。此外,我们证明,对于每个$n$,存在此类图,它们具有渐近地与存在$\lceil\log_2n\rceil$轮广播协议的最稀疏图一样稀疏的额外属性,差异仅在一个常数乘法因子内。具体地,这些图具有$O(n\cdot L(n))$条边,其中$L(n)$是$n-1$的二进制表示中前导1的数量,而已知一般最小广播图具有$Ω(n\cdot L(n))$条边。

英文摘要:

This paper revisits the study of (minimum) broadcast graphs, i.e., graphs enabling fast information dissemination from every source node to all the other nodes (and having minimum number of edges for this property). This study is performed in the framework of compact distributed data structures, that is, when the broadcast protocols are bounded to be encoded at each node as an ordered list of neighbors specifying, upon reception of a message, in which order this message must be passed to these neighbors. We show that this constraint does not limit the power of broadcast protocols, as far as the design of (minimum) broadcast graphs is concerned. Specifically, we show that, for every~$n$, there are $n$-node graphs for which it is possible to design protocols encoded by lists yet enabling broadcast in $\lceil\log_2n\rceil$ rounds from every source, which is optimal even for general (i.e., non space-constrained) broadcast protocols. Moreover, we show that, for every~$n$, there exist such graphs with the additional property that they are asymptotically as sparse as the sparsest graphs for which $\lceil\log_2n\rceil$-round broadcast protocols exist, up to a constant multiplicative factor. Concretely, these graphs have $O(n\cdot L(n))$ edges, where $L(n)$ is the number of leading~1s in the binary representation of $n-1$, and general minimum broadcast graphs are known to have $Ω(n\cdot L(n))$ edges.

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

↑