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

匿名动态网络中的通用有限状态与自稳定计算

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks

Sapienza University of Rome(罗马大学);University of Aizu(会津大学)

Giuseppe A. Di Luna, Giovanni Viglietta

AI总结:

研究匿名动态网络计算问题,提出通用自稳定算法在\(\max\{4\tau n - 2\mu, 2\mu\}\)轮稳定,通用有限状态算法在\(\tau(2n^2 + n)\)轮稳定,改进先前方法并开发历史树相关新技术。

摘要:

若通信网络中的代理彼此无法区分,则称其为“匿名”;若其通信链路随时间可能不可预测地出现或消失,则称其为“动态”。假设匿名动态网络的\(n\)个代理每个最初都有一个输入,计算此类输入的任意(基于频率)函数需要\(2\tau n\)轮通信。在不做额外假设且不知\(n\)的情况下,计算大多数函数并显式终止是不可能的。当前算法依赖历史树增量构建,会消耗无限内存且易出错。本文提供了一种通用自稳定算法,在\(\max\{4\tau n - 2\mu, 2\mu\}\)轮内稳定(\(\mu\)衡量每个代理内存中初始存在的损坏数据量),以及一种通用有限状态算法,在\(\tau(2n^2 + n)\)轮内稳定,改进了仅适用于静态网络的先前方法,还开发了涉及历史树的新基础技术和操作。

英文摘要:

A communication network is said to be "anonymous" if its agents are indistinguishable from each other; it is "dynamic" if its communication links may appear or disappear unpredictably over time. Assuming that each of the $n$ agents of an anonymous dynamic network is initially given an input, it takes $2τn$ communication rounds for the agents to compute an arbitrary (frequency-based) function of such inputs (Di Luna-Viglietta, DISC 2023), where $τ$ is a parameter called "dynamic disconnectivity", and measures how far the network is from being always connected (for always connected dynamic networks, $τ=1$). It is known that, without making additional assumptions on the network and without knowing the number of agents $n$, it is impossible to compute most functions and explicitly terminate. In fact, current state-of-the-art algorithms only achieve stabilization, i.e., allow each agent to return an output after every communication round. Outputs can be changed, and are guaranteed to be all correct after $2τn$ rounds. Such algorithms rely on the incremental construction of a data structure called "history tree", which is augmented at every round. Thus, they end up consuming an unlimited amount of memory, and are also prone to errors in case of memory loss or corruption. In this paper, we provide a general self-stabilizing algorithm for anonymous dynamic networks that stabilizes in $\max\{4τn-2μ,2μ\}$ rounds (where $μ$ measures the amount of corrupted data initially present in the memory of each agent), as well as a general finite-state algorithm that stabilizes in $τ(2n^2+n)$ rounds. Our work improves upon previously known methods that only apply to eventually static networks (Boldi-Vigna, Dist. Comp. 2002). In addition, we develop new fundamental techniques and operations involving history trees, which are of independent interest.

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

↑