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

覆盖网络的时间优化构造

Time-Optimal Construction of Overlay Networks

Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann

摘要:

我们展示了如何从一个任意的弱连通图出发,构造一个在时间上具有常数度和直径的覆盖网络$O(\log n)$ $O(\log n)$。我们假设一个同步通信网络,其中节点可以发送消息到节点,他们知道的标识符,新的连接可以通过发送节点标识符建立。如果初始网络的图是弱连通的并且具有常数度,那么我们的算法构造期望的拓扑,其中每个节点在时间$O(\log n)$的每一轮中仅发送和接收$O(\log n)$消息,其击败了[Götte等人,SIROCCO'19]。由于该问题不能比使用指针跳转$O(\log n)$轮(这甚至需要每个节点通信$Ω(n)$位)更快地解决,我们的算法是渐近最优的。我们通过使用短随机游走来重复建立节点之间的随机连接来实现这种加速,这些节点使用[Kwok和Lau,APPROX'14]的观察来快速降低图的电导。此外,我们还展示了我们的算法如何用于有效地解决\emph{hybrid networks}中的图形问题[Augustine et al.,SODA'20]。出于这样的想法,节点拥有两种不同的通信模式,我们假设的\emph{initial}边缘的通信是不受限制的,而只有多通道的许多消息可以在边缘已建立在整个算法的执行进行通信。对于任意度的无向图$G$,我们展示了如何计算时间$O(\log n)$,w.h.p.中的连通分量,生成树和双连通分量。此外,我们展示了如何计算时间$O(\log d + \log \log n)$,w.h.p.中的MIS,其中,$d$是$G$的初始度数。

英文摘要:

We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of, and new connections can be established by sending node identifiers. If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\log n)$ messages in each round in time $O(\log n)$, w.h.p., which beats the currently best $O(\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19]. Since the problem cannot be solved faster than by using pointer jumping for $O(\log n)$ rounds (which would even require each node to communicate $Ω(n)$ bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20]. Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \emph{initial} edges is unrestricted, whereas only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution. For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\log n)$, w.h.p. Furthermore, we show how to compute an MIS in time $O(\log d + \log \log n)$, w.h.p., where $d$ is the initial degree of $G$.

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

↑