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

动态网络中的信息传播

Information Spreading in Dynamic Networks

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun

摘要:

我们研究动态网络中的信息传播(也称为八卦)的基本问题。在gossip中,或者更一般地,在$k$ -gossip中,存在最初存在于某些节点中的$k$信息(或令牌)片段,并且问题是将$k$令牌传播到所有节点。目标是在尽可能少的分布式计算中完成任务。这个问题在动态网络中尤其具有挑战性,在动态网络中,网络拓扑可以从一轮到另一轮变化,并且可以由在线对手控制。本文的重点是令牌转发算法的功能,这些算法除了存储和转发令牌之外,不以任何方式操作令牌。我们首先考虑一个最坏情况的对抗模型,该模型首先由Kuhn、Lynch和Oshman~ \cite{kuhn+lo:dynamic}研究,其中每一轮的通信链路由对手选择,节点在广播消息之前不知道当前轮的邻居是谁。我们的主要结果是一个$Ω(nk/\log n)$下界的任何确定性令牌转发算法,以解决$k$ -流言所需的轮数。这解决了在~ \cite{kuhn+lo:dynamic}中提出的一个公开问题,改进了它们的$Ω(n \log k)$的下限,并将它们的$O(nk)$的上限匹配到对数因子内。接下来,我们表明,令牌转发算法可以实现次二次的时间在离线版本的问题,对手必须提交所有的拓扑结构的变化提前在计算的开始,并提出两个多项式时间离线令牌转发算法。我们的研究结果是朝着了解动态网络中令牌转发算法的能力和局限性迈出了一步。

英文摘要:

We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, $k$-gossip, there are $k$ pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the $k$ tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is especially challenging in dynamic networks where the network topology can change from round to round and can be controlled by an on-line adversary. The focus of this paper is on the power of token-forwarding algorithms, which do not manipulate tokens in any way other than storing and forwarding them. We first consider a worst-case adversarial model first studied by Kuhn, Lynch, and Oshman~\cite{kuhn+lo:dynamic} in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current round are before they broadcast their messages. Our main result is an $Ω(nk/\log n)$ lower bound on the number of rounds needed for any deterministic token-forwarding algorithm to solve $k$-gossip. This resolves an open problem raised in~\cite{kuhn+lo:dynamic}, improving their lower bound of $Ω(n \log k)$, and matching their upper bound of $O(nk)$ to within a logarithmic factor. We next show that token-forwarding algorithms can achieve subquadratic time in the offline version of the problem where the adversary has to commit all the topology changes in advance at the beginning of the computation, and present two polynomial-time offline token-forwarding algorithms. Our results are a step towards understanding the power and limitation of token-forwarding algorithms in dynamic networks.

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

↑