在接近混合时间的广播
Broadcast in Almost Mixing Time
AI总结:
在接近混合时间的广播问题中,提出了一种基于分支随机游走的随机算法,用于高效广播多个消息,同时证明了该问题在集中设置下的NP难性。
摘要:
我们研究了在CONGEST模型中广播多个消息的问题。在该问题中,一个专用的源节点s拥有一组消息M,每个消息的大小为O(log n),其中n是总节点数。目标是确保网络中的每个节点都学习到所有消息M。算法的执行以轮次为单位进行,我们专注于优化广播多个消息的轮次复杂度。我们的主要贡献是一个针对具有扩张拓扑结构的网络的随机算法,这种拓扑结构在实践中广泛用于构建可扩展和健壮的分布式系统。该算法以高概率成功,并实现了轮次复杂度,该复杂度在混合时间及多项式对数项的范围内是最佳的。它利用了多C OBRA原语,该原语使用多个分支随机游走并行运行。据我们所知,这种方法之前未在分布式算法中应用。我们方法的一个关键方面是利用这些分支随机游走来构建一个随机图的最优(在多项式对数因子范围内)树打包,然后用于高效的广播。这一结果具有独立兴趣。我们还证明了在集中设置下该问题是NP难的,并提供了为什么一般图的简单下界,即图直径和|M|/minCut,不能紧贴的原因。
英文摘要:
We study the problem of broadcasting multiple messages in the CONGEST model. In this problem, a dedicated source node $s$ possesses a set $M$ of messages with every message of size $O(\log n)$ where $n$ is the total number of nodes. The objective is to ensure that every node in the network learns all messages in $M$. The execution of an algorithm progresses in rounds, and we focus on optimizing the round complexity of broadcasting multiple messages. Our primary contribution is a randomized algorithm for networks with expander topology, which are widely used in practice for building scalable and robust distributed systems. The algorithm succeeds with high probability and achieves a round complexity that is optimal up to a factor of the network's mixing time and polylogarithmic terms. It leverages a multi-COBRA primitive, which uses multiple branching random walks running in parallel. To the best of our knowledge, this approach has not been applied in distributed algorithms before. A crucial aspect of our method is the use of these branching random walks to construct an optimal (up to a polylogarithmic factor) tree packing of a random graph, which is then used for efficient broadcasting. This result is of independent interest. We also prove the problem to be NP-hard in a centralized setting and provide insights into why straightforward lower bounds for general graphs, namely graph diameter and $\frac{|M|}{\textit{minCut}}$, cannot be tight.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。