基于Gossip的最优聚集计算
Optimal Gossip-Based Aggregate Computation
摘要:
我们提出了第一个可证明几乎最优的基于流言的聚合计算算法,是时间最优和消息最优的。给定一个$n$ -节点网络,我们的算法保证所有的节点都能计算公共的聚合(如Min,Max,Count,Sum,Average,Rank等)。在最佳$O(\log n)$时间内并使用$O(n \log \log n)$消息来计算它们的值。我们的结果改进了Kempe等人的算法。\cite{kempe}是时间最优的,但使用$O(n \log n)$消息,以及Kashyap等人的算法。\cite{efficient-gossip}使用$O(n \log \log n)$消息,但不是时间最优的(需要$O(\log n \log \log n)$时间)。此外,我们表明,我们的算法可以用来提高基于流言的聚合计算在稀疏通信网络,如对等网络。我们的算法的主要技术成分是一种技术,称为{ \em分布式随机排名(DRR)},可以在其他应用程序中也是有用的。DRR给出了一个有效的分布式过程划分成一个森林的(不相交)树的小尺寸的网络。我们的算法是非地址无关的。相比之下,我们显示了一个下界的$Ω(n\log n)$的消息复杂性的任何地址无关算法计算聚合。这表明,非地址不经意算法需要获得显着更好的消息复杂度。我们的下限保持不变,无论所用的轮数或消息大小如何。我们的下界是第一个非平凡的基于流言的聚合计算的下界,也给出了第一个正式的证明,计算聚合是严格困难的比谣言传播的地址遗忘模型。
英文摘要:
We present the first provably almost-optimal gossip-based algorithms for aggregate computation that are both time optimal and message-optimal. Given a $n$-node network, our algorithms guarantee that all the nodes can compute the common aggregates (such as Min, Max, Count, Sum, Average, Rank etc.) of their values in optimal $O(\log n)$ time and using $O(n \log \log n)$ messages. Our result improves on the algorithm of Kempe et al. \cite{kempe} that is time-optimal, but uses $O(n \log n)$ messages as well as on the algorithm of Kashyap et al. \cite{efficient-gossip} that uses $O(n \log \log n)$ messages, but is not time-optimal (takes $O(\log n \log \log n)$ time). Furthermore, we show that our algorithms can be used to improve gossip-based aggregate computation in sparse communication networks, such as in peer-to-peer networks. The main technical ingredient of our algorithm is a technique called {\em distributed random ranking (DRR)} that can be useful in other applications as well. DRR gives an efficient distributed procedure to partition the network into a forest of (disjoint) trees of small size. Our algorithms are non-address oblivious. In contrast, we show a lower bound of $Ω(n\log n)$ on the message complexity of any address-oblivious algorithm for computing aggregates. This shows that non-address oblivious algorithms are needed to obtain significantly better message complexity. Our lower bound holds regardless of the number of rounds taken or the size of the messages used. Our lower bound is the first non-trivial lower bound for gossip-based aggregate computation and also gives the first formal proof that computing aggregates is strictly harder than rumor spreading in the address-oblivious model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。