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

动态分布式计算研究

On Dynamic Distributed Computing

Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec

摘要:

本文首次表明,分布式计算可以在高度动态和敌对的环境中既可靠又高效。更具体地说,我们将展示如何维护集群的大小$O(\log N)$,每个包含三分之二以上的诚实节点的概率高,在一个系统中,其大小可以不同\textit{polynomially}相对于其初始大小。此外,每个节点的到达或离开引起的通信成本是关于$N$,系统的最大规模的多对数。我们的聚类可以实现,尽管存在拜占庭对手控制的一部分$\bad \leq \{1}{3}-ε$的节点,对于一些固定的常数$ε> 0$,独立于$N$。到目前为止,这样的聚类只能用于大小可以不断变化的系统,并且不清楚多项式方差是否完全可能。

英文摘要:

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size $O(\log N)$, each containing more than two thirds of honest nodes with high probability, within a system whose size can vary \textit{polynomially} with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to $N$, the maximal size of the system. Our clustering can be achieved despite the presence of a Byzantine adversary controlling a fraction $\bad \leq \{1}{3}-ε$ of the nodes, for some fixed constant $ε> 0$, independent of $N$. So far, such a clustering could only be performed for systems who size can vary constantly and it was not clear whether that was at all possible for polynomial variances.

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

↑