随机谣言传播协议的强鲁棒性
Strong Robustness of Randomized Rumor Spreading Protocols
摘要:
随机谣言传播是在网络上传播信息的经典协议。在SODA 2008上,提出了该协议的准随机版本,并证明了其运行时间的竞争边界。这就引出了一个问题:准随机协议在多大程度上继承了随机谣言传播的第二个主要优点,即对传输失败的鲁棒性?在本文中,我们提出了一个精确到$(1 \pm o(1))$因素的结果。我们将自己限制在网络中,其中每两个顶点都由直接链接连接。对于所有其他非平凡网络,精确到其前导常数的运行时间是未知的。我们表明,如果每个传输到达其目的地的概率$p \in (0,1]$后,$(1+\e)(\frac{1}{\log_2(1+p)}\log_2n+\frac{1}{p}\ln n)$轮的准随机协议已通知所有$n$节点在网络中的概率至少为$1-n^{-p\e/40}$。注意,这比直观上自然的$1/p$因子在非损坏情况下在大约$\log_2 n + \ln n $的运行时间上增加更快。我们还提供了一个相应的下界的经典模型。这表明,尽管独立随机性程度大大降低,但准随机模型至少与完全随机模型一样稳健。
英文摘要:
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission failures? In this paper, we present a result precise up to $(1 \pm o(1))$ factors. We limit ourselves to the network in which every two vertices are connected by a direct link. Run-times accurate to their leading constants are unknown for all other non-trivial networks. We show that if each transmission reaches its destination with a probability of $p \in (0,1]$, after $(1+\e)(\frac{1}{\log_2(1+p)}\log_2n+\frac{1}{p}\ln n)$ rounds the quasirandom protocol has informed all $n$ nodes in the network with probability at least $1-n^{-p\e/40}$. Note that this is faster than the intuitively natural $1/p$ factor increase over the run-time of approximately $\log_2 n + \ln n $ for the non-corrupted case. We also provide a corresponding lower bound for the classical model. This demonstrates that the quasirandom model is at least as robust as the fully random model despite the greatly reduced degree of independent randomness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。