arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.1868cs.DScs.SI
收藏

渐近最优随机谣言传播

Asymptotically Optimal Randomized Rumor Spreading

Benjamin Doerr, Mahmoud Fouz

摘要:

我们提出了一个新的协议,解决了一个基本的问题,传播一条信息的所有成员的一组n个球员。它建立在经典的随机谣言传播协议和几个扩展。主要成果如下:我们的协议在(1 + o(1))\log_2 n的渐近最优时间内将谣言传播到所有其他节点。整个过程可以以一种方式实现,使得只进行O(n f(n))调用,其中f(n)= ω(1)可以是任意的。与文献中建议的其他协议相比,我们的算法仅使用推操作,即,只有被通知的节点才在网络中采取主动行动。据我们所知,这是第一个实现渐进最优运行时间的随机推送算法。

英文摘要:

We propose a new protocol solving the fundamental problem of disseminating a piece of information to all members of a group of n players. It builds upon the classical randomized rumor spreading protocol and several extensions. The main achievements are the following: Our protocol spreads the rumor to all other nodes in the asymptotically optimal time of (1 + o(1)) \log_2 n. The whole process can be implemented in a way such that only O(n f(n)) calls are made, where f(n)= ω(1) can be arbitrary. In contrast to other protocols suggested in the literature, our algorithm only uses push operations, i.e., only informed nodes take active actions in the network. To the best of our knowledge, this is the first randomized push algorithm that achieves an asymptotically optimal running time.

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

↑