Models of Smoothing in Dynamic Networks

09/28/2020
by   Uri Meir, et al.
0

Smoothed analysis is a framework suggested for mediating gaps between worst-case and average-case complexities. In a recent work, Dinitz et al. [Distributed Computing, 2018] suggested to use smoothed analysis in order to study dynamic networks. Their aim was to explain the gaps between real-world networks that function well despite being dynamic, and the strong theoretical lower bounds for arbitrary networks. To this end, they introduced a basic model of smoothing in dynamic networks, where an adversary picks a sequence of graphs, representing the topology of the network over time, and then each of these graphs is slightly perturbed in a random manner. The model suggested above is based on a per-round noise, and our aim in this work is to extend it to models of noise more suited for multiple rounds. This is motivated by long-lived networks, where the amount and location of noise may vary over time. To this end, we present several different models of noise. First, we extend the previous model to cases where the amount of noise is very small. Then, we move to more refined models, where the amount of noise can change between different rounds, e.g., as a function of the number of changes the network undergoes. We also study a model where the noise is not arbitrarily spread among the network, but focuses in each round in the areas where changes have occurred. Finally, we study the power of an adaptive adversary, who can choose its actions in accordance with the changes that have occurred so far. We use the flooding problem as a running case-study, presenting very different behaviors under the different models of noise, and analyze the flooding time in different models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2022

Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds

We study the distributed minimum spanning tree (MST) problem, a fundamen...
research
11/18/2022

Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks

Data dissemination is a fundamental task in distributed computing. This ...
research
05/02/2018

Breaking the (√(n)) Barrier: Fast Consensus under a Late Adversary

We study the consensus problem in a synchronous distributed system of n ...
research
04/18/2022

Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity

Maximal Independent Set (MIS) is one of the central and most well-studie...
research
08/11/2022

Smoothed Analysis of Information Spreading in Dynamic Networks

The best known solutions for k-message broadcast in dynamic networks of ...
research
05/21/2022

Smoothing Codes and Lattices: Systematic Study and New Bounds

In this article we revisit smoothing bounds in parallel between lattices...
research
09/24/2020

Algorithms for a Topology-aware Massively Parallel Computation Model

Most of the prior work in massively parallel data processing assumes hom...

Please sign up or login with your details

Forgot password? Click here to reset