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

具有故障节点的网络中的最优广播

Optimal broadcasting in networks with faulty nodes

Yoel Grinshpon, Ori Gurel-Gurevich

摘要:

大型计算机网络是现代技术的重要组成部分,并且经常需要将信息广播到网络中的所有计算机。如果所有的计算机都能一直完美地工作,这很简单。然而,假设某些计算机偶尔会出现故障。什么是最快的方法,以确保高概率所有工作的计算机得到的信息?在本文中,我们分析了三种算法来做到这一点。所有算法都在对数时间内终止,假设计算机以概率$1-p$彼此独立地失败。我们证明了第三个算法,它运行在时间$(1+o(1))(\frac{\log N}{\log(1+p)})$,是渐近最优的。

英文摘要:

Large computer networks are an essential part of modern technology, and quite often information needs to be broadcast to all the computers in the network. If all computers work perfectly all the time, this is simple. Suppose, however, that some of the computers fail occasionally. What is the fastest way to ensure that with high probability all working computers get the information? In this paper, we analyze three algorithms to do so. All algorithms terminate in logarithmic time, assuming computers fail with probability $1-p$ independently of each other. We prove that the third algorithm, which runs in time $(1+o(1))(\frac{\log N}{\log(1+p)})$, is asymptotically optimal.

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

↑