Smoothed Analysis of Dynamic Networks - DIStributed Computing 2015 Access content directly
Conference Papers Year : 2015

Smoothed Analysis of Dynamic Networks

Abstract

We generalize the technique of smoothed analysis to distributed algorithms in dynamic networks. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics, dynamic graph smoothed analysis studies the impact of random perturbations of the underlying changing network graph topologies. Similar to the original application of smoothed analysis, our goal is to study whether known strong lower bounds in dynamic network models are robust or fragile: do they withstand small (random) perturbations, or do such deviations push the graphs far enough from a precise pathological instance to enable much better performance? Fragile lower bounds are likely not relevant for real-world deployment, while robust lower bounds represent a true difficulty caused by dynamic behavior. We apply this technique to three standard dynamic network problems with known strong worst-case lower bounds: random walks, flooding, and aggregation. We prove that these bounds provide a spectrum of robustness when subjected to smoothing—some are extremely fragile (random walks), some are moderately fragile / robust (flooding), and some are extremely robust (aggregation).
Fichier principal
Vignette du fichier
48.pdf (306 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01207204 , version 1 (30-09-2015)

Identifiers

Cite

Michael Dinitz, Jeremy Fineman, Seth Gilbert, Calvin Newport. Smoothed Analysis of Dynamic Networks. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_34⟩. ⟨hal-01207204⟩

Collections

DISC2015
170 View
63 Download

Altmetric

Share

Gmail Facebook X LinkedIn More