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

顶点拥塞模型中快速鲁棒信息传播的研究

On Fast and Robust Information Spreading in the Vertex-Congest Model

Keren Censor-Hillel, Tariq Toukan

摘要:

在顶点拥塞模型中,每个$n$节点向其所有邻居节点发送相同的$O(\log{n})$比特消息,研究故障对\emph{information spreading}基本问题的影响.我们对应付失败的贡献是双重的。首先,我们证明了随机算法,均匀随机选择下一个消息转发是缓慢的,需要$Ω(n/\sqrt{k})$轮的一些图,我们表示为$G_{n,k}$,其中$k$是顶点连通性。其次,我们设计了一个随机算法,使动态消息的选择,随着执行的概率变化。我们证明,$G_{n,k}$它只需要一个接近最佳的$O(n\log^3{n}/k)$轮数,尽管每轮$q=O(k/n\log^3{n})$失败率。我们的技术选择的概率,根据执行的变化是独立的利益。

英文摘要:

This paper initiates the study of the impact of failures on the fundamental problem of \emph{information spreading} in the Vertex-Congest model, in which in every round, each of the $n$ nodes sends the same $O(\log{n})$-bit message to all of its neighbors. Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring $Ω(n/\sqrt{k})$ rounds on some graphs, which we denote by $G_{n,k}$, where $k$ is the vertex-connectivity. Second, we design a randomized algorithm that makes dynamic message choices, with probabilities that change over the execution. We prove that for $G_{n,k}$ it requires only a near-optimal number of $O(n\log^3{n}/k)$ rounds, despite a rate of $q=O(k/n\log^3{n})$ failures per round. Our technique of choosing probabilities that change according to the execution is of independent interest.

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

↑