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

图密度对随机流言传播的影响

On the Influence of Graph Density on Randomized Gossiping

Robert Elsässer, Dominik Kaaser

摘要:

信息分发是并行和分布式计算中的一个基本问题。在其最简单的变体中,即广播问题,消息必须在图的所有节点之间传播。针对该问题的突出通信协议基于随机电话呼叫模型(Karp等人,FOCS 2000)。在每个步骤中,每个节点打开一个通信信道到一个随机选择的邻居进行双向通信。受复制数据库和对等网络的启发,Berenbrink等人,ICALP 2010,考虑了随机电话模型中的闲聊问题。在那里,每个节点都从自己的消息开始,所有消息都必须传播到网络中的所有节点。他们表明,完全图中的任何$O(\log n)$ -时间算法都需要每个节点的$Ω(\log n)$消息传输来完成八卦,w.h.p,而对于广播,每个节点的平均传输次数为$O(\log\log n)$。众所周知,$O(n\log\log n)$约束的随机广播在完全图中所需的传输数量不能实现稀疏图,即使他们有最好的扩展和连接属性。在本文中,我们分析是否有类似的影响,图密度也持有w.r.t.说闲话的表现。我们研究分析和经验的随机图中的随机八卦所产生的通信开销,并考虑在这些图中的随机电话呼叫模型的简单修改。我们的研究结果表明,不像在广播中,有没有完全图和稀疏随机图的随机八卦的性能之间的显着差异。此外,我们的模拟表明,通过调整我们的算法的参数,我们可以显着减少通信开销相比,传统的推挽式的方法,我们考虑的图。

英文摘要:

Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, the broadcasting problem, a message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the random phone call model (Karp et al., FOCS 2000). In each step, every node opens a communication channel to a randomly chosen neighbor for bi-directional communication. Motivated by replicated databases and peer-to-peer networks, Berenbrink et al., ICALP 2010, considered the gossiping problem in the random phone call model. There, each node starts with its own message and all messages have to be disseminated to all nodes in the network. They showed that any $O(\log n)$-time algorithm in complete graphs requires $Ω(\log n)$ message transmissions per node to complete gossiping, w.h.p, while for broadcasting the average number of transmissions per node is $O(\log\log n)$. It is known that the $O(n\log\log n)$ bound on the number of transmissions required for randomized broadcasting in complete graphs cannot be achieved in sparse graphs even if they have best expansion and connectivity properties. In this paper, we analyze whether a similar influence of the graph density also holds w.r.t. the performance of gossiping. We study analytically and empirically the communication overhead generated by randomized gossiping in random graphs and consider simple modifications of the random phone call model in these graphs. Our results indicate that, unlike in broadcasting, there is no significant difference between the performance of randomized gossiping in complete graphs and sparse random graphs. Furthermore, our simulations indicate that by tuning the parameters of our algorithms, we can significantly reduce the communication overhead compared to the traditional push-pull approach in the graphs we consider.

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

↑