arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.02128cs.DCcs.DMcs.DS
收藏

匿名动态网络中的计算是线性的

Computing in Anonymous Dynamic Networks Is Linear

Giuseppe A. Di Luna, Giovanni Viglietta

AI总结:

针对具有领导者的匿名1-区间连通动态网络,本文提出基于“历史树”组合结构的线性时间计数算法,能在3n轮内计算所有确定性可计算函数,将运行时间优化至最优的2n轮,并打破了先前O(n^{4+ε} log^3(n))轮的算法记录。

摘要:

我们为具有领导者的匿名1-区间连通动态网络中的进程提供了首个线性时间计数算法。作为副产品,我们能够在$3n$轮内计算此类网络中确定性可计算的每个函数。如果不需要显式终止,运行时间可改善至$2n$轮,我们证明这在小常数加法意义上是最优的(这也是计数的首个非平凡下界)。作为主要研究工具,我们引入了一种独立感兴趣的称为“历史树”的组合结构。这使我们的论文完全自包含,证明优雅透明,算法易于实现。近年来,大量精力投入于具有具有领导者的匿名1-区间连通网络计数算法的设计与分析。。一系列日益复杂的工作(多基于经典质量分布技术)最近导致了$O({n^{4+ ε}} \log^{3} (n))$轮($对于$ε>0$)的著名计数算法,这是本文之前的最先进技术。我们的贡献不仅开辟了历史树应用的有前途研究路线,还表明匿名动态网络中的计算是实际可行的,且远比先前推测想的要低得多。

英文摘要:

We give the first linear-time counting algorithm for processes in anonymous 1-interval-connected dynamic networks with a leader. As a byproduct, we are able to compute in $3n$ rounds every function that is deterministically computable in such networks. If explicit termination is not required, the running time improves to $2n$ rounds, which we show to be optimal up to a small additive constant (this is also the first non-trivial lower bound for counting). As our main tool of investigation, we introduce a combinatorial structure called "history tree", which is of independent interest. This makes our paper completely self-contained, our proofs elegant and transparent, and our algorithms straightforward to implement. In recent years, considerable effort has been devoted to the design and analysis of counting algorithms for anonymous 1-interval-connected networks with a leader. A series of increasingly sophisticated works, mostly based on classical mass-distribution techniques, have recently led to a celebrated counting algorithm in $O({n^{4+ ε}} \log^{3} (n))$ rounds (for $ε>0$), which was the state of the art prior to this paper. Our contribution not only opens a promising line of research on applications of history trees, but also demonstrates that computation in anonymous dynamic networks is practically feasible, and far less demanding than previously conjectured.

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

↑