Universal finite-state and self-stabilizing computation in anonymous dynamic networks

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 a 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 smallest amount of potentially corrupted history initially stored by any agent), as well as a general finite-state algorithm that stabilizes in τ ( 2 n 2 + n ) rounds. Our work improves upon previously known methods that only apply to static networks (Boldi–Vigna, Dist. Comp. 2002). In addition, we develop new fundamental techniques and operations involving history trees, which are of independent interest.