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

Forwarding Without Repeating:有界度图上的有效谣言传播

Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs

Vincent Gripon, Vitaly Skachek, Michael Rabbat

摘要:

我们研究了一种称为无重复转发(FWR)的gossip协议。目标是尽可能有效地在图上传播多个谣言。FWR通过让节点记录它们向每个邻居转发了哪些消息来实现这一点,以便每个消息最多向每个邻居转发一次。我们证明了FWR传播谣言的强连接有向图,以高概率,在时间内是一个常数的最佳有界出度的有向图的因素。此外,在出度有界且谣言数有界的有向图上,FWR所需的传输次数比现有方法任意好。具体来说,FWR在具有n个节点的有界度图上需要O(n)个消息,而经典转发和基于网络编码的方法都需要ω(n)个消息。我们的结果是使用组合和概率参数。值得注意的是,它们不依赖于底层图的扩展属性,因此FWR的消息复杂度甚至在常数度扩展图上也任意优于经典转发,如n \rightarrow \infty。在资源受限的应用中,每次传输都会消耗电池电量和带宽,我们的研究结果表明,在每个节点上使用少量内存可以节省大量资源。

英文摘要:

We study a gossip protocol called forwarding without repeating (FWR). The objective is to spread multiple rumors over a graph as efficiently as possible. FWR accomplishes this by having nodes record which messages they have forwarded to each neighbor, so that each message is forwarded at most once to each neighbor. We prove that FWR spreads a rumor over a strongly connected digraph, with high probability, in time which is within a constant factor of optimal for digraphs with bounded out-degree. Moreover, on digraphs with bounded out-degree and bounded number of rumors, the number of transmissions required by FWR is arbitrarily better than that of existing approaches. Specifically, FWR requires O(n) messages on bounded-degree graphs with n nodes, whereas classical forwarding and an approach based on network coding both require ω(n) messages. Our results are obtained using combinatorial and probabilistic arguments. Notably, they do not depend on expansion properties of the underlying graph, and consequently the message complexity of FWR is arbitrarily better than classical forwarding even on constant-degree expander graphs, as n \rightarrow \infty. In resource-constrained applications, where each transmission consumes battery power and bandwidth, our results suggest that using a small amount of memory at each node leads to a significant savings.

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

↑