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

动态网络中不经意攻击者的信息传播

Information Spreading in Dynamic Networks under Oblivious Adversaries

John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman

摘要:

我们研究了动态网络中的流言问题,由对手控制,可以任意修改网络从一个回合到另一个,只要网络总是连接的。在流言问题中,$n$令牌在$n$网络节点之间任意分布,并且目标是将所有的$n$令牌传播到每个节点。我们的重点是令牌转发算法,除了存储、复制和转发令牌之外,不以任何方式操作令牌。在任何静态网络中,Gossip都可以在线性时间内完成,但动态网络的一个基本开放问题是存在一个分布式协议,该协议可以做得比容易实现的$O(n^2)$回合边界好得多。在以前的工作中,它已被证明,在自适应对手,每个令牌转发算法需要$Ω(n^2/\log n)$轮。在本文中,我们研究了不经意的对手,这不同于自适应对手在一个关键的方面-他们是不经意的随机选择的协议。我们提出了一个$\tildeΩ(n^{3/2})$下界下不经意的对手的RANDDIFF,一个自然的算法,其中邻居交换令牌随机从他们的令牌集的差异均匀选择。我们还提出了一个$\tildeΩ(n^{4/3})$界下的一个更强的概念不经意的对手对称的知识为基础的算法。在积极的一面,我们提出了一个集中式的算法,完成八卦$\tilde{O}(n^{3/2})$轮。我们还显示了一个$\tilde{O}(n^{5/3})$上界的RANDDIFF在一个限制类的不经意的对手,我们称之为路径尊重。

英文摘要:

We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, $n$ tokens are arbitrarily distributed among the $n$ network nodes, and the goal is to disseminate all the $n$ tokens to every node. Our focus is on token-forwarding algorithms, which do not manipulate tokens in any way other than storing, copying, and forwarding them. Gossip can be completed in linear time in any static network, but a basic open question for dynamic networks is the existence of a distributed protocol that can do significantly better than an easily achievable bound of $O(n^2)$ rounds. In previous work, it has been shown that under adaptive adversaries, every token forwarding algorithm requires $Ω(n^2/\log n)$ rounds. In this paper, we study oblivious adversaries, which differ from adaptive adversaries in one crucial aspect--- they are oblivious to random choices made by the protocol. We present an $\tildeΩ(n^{3/2})$ lower bound under an oblivious adversary for RANDDIFF, a natural algorithm in which neighbors exchange a token chosen uniformly at random from the difference of their token sets. We also present an $\tildeΩ(n^{4/3})$ bound under a stronger notion of oblivious adversary for symmetric knowledge-based algorithms. On the positive side, we present a centralized algorithm that completes gossip in $\tilde{O}(n^{3/2})$ rounds. We also show an $\tilde{O}(n^{5/3})$ upper bound for RANDDIFF in a restricted class of oblivious adversaries, which we call paths-respecting.

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

↑