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

直接寻址的最优流言

Optimal Gossip with Direct Addressing

Bernhard Haeupler, Dahlia Malkhi

摘要:

流言算法通过让节点重复地向一些随机联系人转发信息来传播信息。就其本质而言,gossip算法倾向于分布式和容错。如果做得好,它们也可以是快速和有效的消息。八卦通信的常见模型是随机电话呼叫模型,其中在每个同步轮中,每个节点可以将信息推送到随机的其他节点或从随机的其他节点推送信息。例如,Karp等人[FOCS 2000]给出了该模型中的算法,该算法将消息传播到$Θ(\log n)$轮中的所有节点,同时平均每个节点仅发送$O(\log \log n)$消息。最近,Avin和Elsässer [DISC 2013],研究了随机电话呼叫模型与自然和常用的直接寻址假设。直接寻址允许节点直接联系其ID(例如,IP地址)之前已了解。他们表明,在这种设置下,可以“打破$\log n$障碍”,实现在$O(\sqrt{\log n})$轮中运行的gossip算法,尽管每个节点使用$O(\sqrt{\log n})$消息。我们研究了相同的模型,并给出了一个简单的八卦算法,传播一个消息在只有$O(\log \log n)$轮。我们还证明了一个匹配的$Ω(\log \log n)$下界,这表明,这个运行时间是最好的可能。特别是,我们表明,任何八卦算法以高概率至少$0.99 \log \log n$轮终止。最后,我们的算法可以调整为平均每个节点只发送$O(1)$消息,每个消息只有$O(\log n)$位。因此,我们的算法同时实现了最佳的轮,消息,和比特复杂度为这个设置。和所有的gossip算法一样,我们的算法对失败也是鲁棒的。特别是,如果在一开始一个不经意的对手失败的任何$F$节点,我们的算法仍然,以高概率,通知所有,但$o(F)$幸存的节点。

英文摘要:

Gossip algorithms spread information by having nodes repeatedly forward information to a few random contacts. By their very nature, gossip algorithms tend to be distributed and fault tolerant. If done right, they can also be fast and message-efficient. A common model for gossip communication is the random phone call model, in which in each synchronous round each node can PUSH or PULL information to or from a random other node. For example, Karp et al. [FOCS 2000] gave algorithms in this model that spread a message to all nodes in $Θ(\log n)$ rounds while sending only $O(\log \log n)$ messages per node on average. Recently, Avin and Elsässer [DISC 2013], studied the random phone call model with the natural and commonly used assumption of direct addressing. Direct addressing allows nodes to directly contact nodes whose ID (e.g., IP address) was learned before. They show that in this setting, one can "break the $\log n$ barrier" and achieve a gossip algorithm running in $O(\sqrt{\log n})$ rounds, albeit while using $O(\sqrt{\log n})$ messages per node. We study the same model and give a simple gossip algorithm which spreads a message in only $O(\log \log n)$ rounds. We also prove a matching $Ω(\log \log n)$ lower bound which shows that this running time is best possible. In particular we show that any gossip algorithm takes with high probability at least $0.99 \log \log n$ rounds to terminate. Lastly, our algorithm can be tweaked to send only $O(1)$ messages per node on average with only $O(\log n)$ bits per message. Our algorithm therefore simultaneously achieves the optimal round-, message-, and bit-complexity for this setting. As all prior gossip algorithms, our algorithm is also robust against failures. In particular, if in the beginning an oblivious adversary fails any $F$ nodes our algorithm still, with high probability, informs all but $o(F)$ surviving nodes.

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

↑