arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.09847cs.DC
收藏

动态网络中信息传播的通信成本

The Communication Cost of Information Spreading in Dynamic Networks

Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan

摘要:

本文研究了对抗动态网络中分布式信息传播(也称为流言或令牌传播)的消息复杂性,目标是将$k$令牌信息传播到$n$节点网络中的每个节点。假设令牌的数量很大,我们考虑传播令牌的摊销(平均)消息复杂度。我们的重点是令牌转发算法,除了存储、复制和转发令牌之外,不以任何方式操作令牌。我们考虑两种类型的对手,任意重新布线的网络,同时保持连接:自适应的对手,是知道的所有节点和算法(包括当前的随机选择)的状态,和遗忘的对手,是不经意的随机选择的算法。激励我们工作的中心问题是,是否可以实现次二次摊销信息复杂度的信息传播。我们提出了两组结果取决于节点如何发送消息到他们的邻居:(1)本地广播:我们显示了一个紧密的下限$Ω(n^2)$的摊销本地广播的数量,这是匹配的朴素洪泛算法,(2)单播:我们研究的消息复杂度作为网络中的动态变化的数量的函数。为了促进这一点,我们引入了一个自然的复杂性措施,用于分析动态网络称为对手竞争的消息复杂性,对手支付单位成本的每一个拓扑结构的变化。在此模型下,它表明,如果$k$是足够大的,我们可以得到一个最佳的摊销消息复杂度为$O(n)$。我们还提出了一个随机算法,实现次二次摊销消息的复杂性时,令牌的数量并不大下一个不经意的对手。

英文摘要:

This paper investigates the message complexity of distributed information spreading (a.k.a gossip or token dissemination) in adversarial dynamic networks, where the goal is to spread $k$ tokens of information to every node on an $n$-node network. We consider the amortized (average) message complexity of spreading a token, assuming that the number of tokens is large. Our focus is on token-forwarding algorithms, which do not manipulate tokens in any way other than storing, copying, and forwarding them. We consider two types of adversaries that arbitrarily rewire the network while keeping it connected: the adaptive adversary that is aware of the status of all the nodes and the algorithm (including the current random choices), and the oblivious adversary that is oblivious to the random choices made by the algorithm. The central question that motivates our work is whether one can achieve subquadratic amortized message complexity for information spreading. We present two sets of results depending on how nodes send messages to their neighbors: (1) Local broadcast: We show a tight lower bound of $Ω(n^2)$ on the number of amortized local broadcasts, which is matched by the naive flooding algorithm, (2) Unicast: We study the message complexity as a function of the number of dynamic changes in the network. To facilitate this, we introduce a natural complexity measure for analyzing dynamic networks called adversary-competitive message complexity where the adversary pays a unit cost for every topological change. Under this model, it is shown that if $k$ is sufficiently large, we can obtain an optimal amortized message complexity of $O(n)$. We also present a randomized algorithm that achieves subquadratic amortized message complexity when the number of tokens is not large under an oblivious adversary.

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

↑