Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Kuhn, R. Oshman (2011)
Dynamic networks: models and algorithmsSIGACT News, 42
R. Karp, C. Schindelhauer, S. Shenker, Berthold Vöcking (2000)
Randomized rumor spreadingProceedings 41st Annual Symposium on Foundations of Computer Science
S. Strogatz (2001)
Exploring complex networksNature, 410
John Augustine, Gopal Pandurangan, Peter Robinson, E. Upfal (2011)
Towards robust and efficient computation in dynamic peer-to-peer networks
Bernhard Haeupler, David Karger (2011)
Faster information dissemination in dynamic networks via network coding
Stephen Boyd, Arpita Ghosh, B. Prabhakar, D. Shah (2006)
Randomized gossip algorithmsIEEE Transactions on Information Theory, 52
Calvin Newport (2014)
Lower Bounds for Structuring Unreliable Radio NetworksArXiv, abs/1408.0812
Regina O'Dell, Roger Wattenhofer (2005)
Information dissemination in highly dynamic graphs
A. Clementi, R. Silvestri, L. Trevisan (2011)
Information spreading in dynamic graphsDistributed Computing, 28
M. Ghaffari, N. Lynch, Calvin Newport (2013)
The cost of radio network broadcast for different models of unreliable links
S Boyd, A Ghosh, B Prabhakar, D Shah (2006)
Randomized gossip algorithmsIEEE/ACM Trans Netw., 14
F. Kuhn, N. Lynch, R. Oshman (2010)
Distributed computation in dynamic networks
Chinmoy Dutta, Gopal Pandurangan, R. Rajaraman, Zhifeng Sun, Emanuele Viola (2013)
On the Complexity of Information Spreading in Dynamic Networks
C. Avin, M. Koucký, Zvi Lotker (2008)
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
D. Kempe, A. Dobra, J. Gehrke (2003)
Gossip-based computation of aggregate information44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Thorsten Hens, Sabine Elmiger (2019)
AggregationSpringer Texts in Business and Economics
Alejandro Cornejo, Seth Gilbert, Calvin Newport (2012)
Aggregation in dynamic networks
Atish Sarma, A. Molla, Gopal Pandurangan (2012)
Fast Distributed Computation in Dynamic Networks via Random Walks
D. Spielman, S. Teng (2009)
Smoothed analysis: an attempt to explain the behavior of algorithms in practiceCommun. ACM, 52
D. Spielman, S. Teng (2001)
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial timeJ. ACM, 51
O. Denysyuk, L. Rodrigues (2014)
Random Walks on Evolving Graphs with Recurring Topologies
F. Kuhn, Y. Moses, R. Oshman (2011)
Coordinated consensus in dynamic networks
P. Erd (1993)
Random Walks on Graphs: A Survey
In this paper, we generalize the technique of smoothed analysis to apply to distributed algorithms in dynamic networks in which the network graph can change from round to round. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics, our proposed dynamic network version of smoothed analysis studies the impact of random perturbations of the underlying changing network topologies. Similar to the original application of smoothed analysis, our goal is to study whether known strong lower bounds in these 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 fragile (random walks), some are moderately fragile (flooding), and some are robust (aggregation).
Distributed Computing – Springer Journals
Published: May 5, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.