arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0612118cs.NIcs.ITmath.IT
收藏

多条消息的八卦

Gossiping with Multiple Messages

Sujay Sanghavi, Bruce Hajek, Laurent Massoulie

摘要:

本文研究了多条信息在大型网络中的传播,其中用户以随机不协调的方式相互联系,用户每单位时间上传一条信息。潜在的动机是设计和分析的片选择协议的对等网络传播的文件分成几块。我们首先研究单边协议,其中片选择是基于发射机或接收机的状态。我们表明,任何这样的协议只依赖于推,或者只拉,是低效的,在传播所有的作品给所有用户。我们提出了一个混合单边片选择协议- INTERLEAVE -并表明,通过使用推和拉,它传播$k$片从一个单一的来源,$n$用户在$10(k+\log n)$的时间,同时遵守的约束,每个用户可以上传最多一块在一个单位的时间内,大$n$的概率很高。在这种情况下,最佳的、不切实际的集中式协议将花费$k+\log_2 n$时间。此外,如果源实现前向擦除编码,并且用户推送最新发布的编码片段(但不拉取),则有效的传播也是可能的。我们还研究双边协议,其中片选择是基于发射机和接收机的状态。我们表明,它是可能的传播$n$件$n$用户在$n+O(\log n)$的时间,从初始状态,每个用户有一个独特的一块。

英文摘要:

This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users upload one piece per unit time. The underlying motivation is the design and analysis of piece selection protocols for peer-to-peer networks which disseminate files by dividing them into pieces. We first investigate one-sided protocols, where piece selection is based on the states of either the transmitter or the receiver. We show that any such protocol relying only on pushes, or alternatively only on pulls, is inefficient in disseminating all pieces to all users. We propose a hybrid one-sided piece selection protocol -- INTERLEAVE -- and show that by using both pushes and pulls it disseminates $k$ pieces from a single source to $n$ users in $10(k+\log n)$ time, while obeying the constraint that each user can upload at most one piece in one unit of time, with high probability for large $n$. An optimal, unrealistic centralized protocol would take $k+\log_2 n$ time in this setting. Moreover, efficient dissemination is also possible if the source implements forward erasure coding, and users push the latest-released coded pieces (but do not pull). We also investigate two-sided protocols where piece selection is based on the states of both the transmitter and the receiver. We show that it is possible to disseminate $n$ pieces to $n$ users in $n+O(\log n)$ time, starting from an initial state where each user has a unique piece.

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

↑