DeepAI AI Chat
Log In Sign Up

Efficient Computation in Congested Anonymous Dynamic Networks

01/19/2023
by   Giuseppe A. Di Luna, et al.
0

An "anonymous dynamic network" is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that deterministically computing an arbitrary function of a multiset of input values given to these processes takes only a linear number of communication rounds. However, fast algorithms for anonymous dynamic networks rely on the construction and communication of large data structures called "history trees", whose size is polynomial in the number of processes. This approach is unfeasible if the network is "congested", and only messages of logarithmic size can be sent though its links. Observe that sending a large message piece by piece over several rounds is not in itself a solution, due to the anonymity of the processes combined with the dynamic nature of the network. Moreover, it is known that certain basic tasks such as all-to-all token dissemination (by means of single-token forwarding) require Ω(n^2/log n) rounds in congested networks. In this work, we develop a series of practical and efficient techniques that make it possible to use history trees in congested anonymous dynamic networks. Among other applications, we show how to compute arbitrary functions in such networks in O(n^3) communication rounds, greatly improving upon previous state-of-the-art algorithms for congested networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/21/2022

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

We study the broadcast problem on dynamic networks with n processes. The...
04/05/2022

Computing in Anonymous Dynamic Networks Is Linear

We give the first linear-time counting algorithm for processes in anonym...
10/08/2018

Event History Analysis of Dynamic Communication Networks

Statistical analysis on networks has received growing attention due to d...
02/18/2020

Synthesis in Presence of Dynamic Links

The problem of distributed synthesis is to automatically generate a dist...
09/17/2020

Finding Subgraphs in Highly Dynamic Networks

In this paper we consider the fundamental problem of finding subgraphs i...
07/17/2022

Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks

We give a simple and complete characterization of which functions can be...
12/29/2020

A Number Theoretic Approach for Fast Discovery of Single-Hop Wireless Networks

Interference management has become a key factor in regulating transmissi...