Abstract
The best known solutions for k-message broadcast in dynamic networks of size n require Ω(nk) rounds. In this paper, we see if these bounds can be improved by smoothed analysis. To do so, we study perhaps the most natural randomized algorithm for disseminating tokens in this setting: at every time step, choose a token to broadcast randomly from the set of tokens you know. We show that with even a small amount of smoothing (i.e., one random edge added per round), this natural strategy solves k-message broadcast in \(\tilde{O}(n+k^3) \) rounds, with high probability, beating the best known bounds for \(k=o(\sqrt {n}) \) and matching the Ω(n + k) lower bound for static networks for k = O(n1/3) (ignoring logarithmic factors). In fact, the main result we show is even stronger and more general: given ℓ-smoothing (i.e., ℓ random edges added per round), this simple strategy terminates in O(kn2/3log 1/3(n)ℓ− 1/3) rounds. We then prove this analysis close to tight with an almost-matching lower bound. To better understand the impact of smoothing on information spreading, we next turn our attention to static networks, proving a tight bound of \(\tilde{O}(k\sqrt {n}) \) rounds to solve k-message broadcast, which is better than what our strategy can achieve in the dynamic setting. This confirms the intuition that although smoothed analysis reduces the difficulties induced by changing graph structures, it does not eliminate them altogether. Finally, we apply tools developed to support our smoothed analysis to prove an optimal result for k-message broadcast in so-called well-mixed networks in the absence of smoothing. By comparing this result to an existing lower bound for well-mixed networks, we establish a formal separation between oblivious and strongly adaptive adversaries with respect to well-mixed token spreading, partially resolving an open question on the impact of adversary strength on the k-message broadcast problem.
- John Augustine, Gopal Pandurangan, Peter Robinson, and Eli Upfal. Towards robust and efficient computation in dynamic peer-to-peer networks. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2012.Google ScholarCross Ref
- Chen Avin, Michal Koucký, and Zvi Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Proceedings of the International Colloquium on Automata, Languages and Programming, 2008.Google ScholarDigital Library
- Soumyottam Chatterjee, Gopal Pandurangan, and Nguyen Dinh Pham. Distributed mst: a smoothed analysis. In Proceedings of the 21st International Conference on Distributed Computing and Networking, pages 1–10, 2020.Google ScholarDigital Library
- Andrea Clementi, Riccardo Silvestri, and Luca Trevisan. Information spreading in dynamic graphs. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012.Google Scholar
- Oksana Denysyuk and Luís Rodrigues. Random walks on evolving graphs with recurring topologies. In Proceedings of the International Symposium on Distributed Computing, 2014.Google ScholarCross Ref
- Michael Dinitz, Jeremy T Fineman, Seth Gilbert, and Calvin Newport. Smoothed analysis of dynamic networks. Distributed Computing, 31(4):273–287, 2018.Google ScholarDigital Library
- Benjamin Doerr. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics, pages 1–87. Springer International Publishing, Cham, 2020. URL: https://doi.org/10.1007/978-3-030-29414-4_1, doi:10.1007/978-3-030-29414-4_1.Google ScholarCross Ref
- Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, and Emanuele Viola. On the complexity of information spreading in dynamic networks. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 717–736. SIAM, 2013.Google Scholar
- Mohsen Ghaffari, Nancy Lynch, and Calvin Newport. The cost of radio network broadcast for different models of unreliable links. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013.Google Scholar
- Bernhard Haeupler and David Karger. Faster information dissemination in dynamic networks via network coding. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2011.Google Scholar
- F. Kuhn and R. Oshman. Dynamic networks: models and algorithms. ACM SIGACT News, 42(1):82–96, 2011.Google ScholarDigital Library
- Fabian Kuhn, Nancy Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In Proceedings of the forty-second ACM symposium on Theory of computing, pages 513–522, 2010.Google ScholarDigital Library
- Fabian Kuhn, Nancy Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In Proceedings of the ACM Symposium on Theory of Computing, 2010.Google ScholarDigital Library
- Fabian Kuhn, Rotem Oshman, and Yoram Moses. Coordinated consensus in dynamic networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2011.Google Scholar
- Uri Meir, Ami Paz, and Gregory Schwartzman. Models of smoothing in dynamic networks. In Proceedings of the 34th International Symposium on Distributed Computing,, pages 36:1–36:16, 2020. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.36, doi:10.4230/LIPIcs.DISC.2020.36.Google ScholarCross Ref
- Anisur Rahaman Molla and Disha Shur. Smoothed analysis of leader election in distributed networks. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pages 183–198. Springer, 2020.Google Scholar
- Calvin Newport. Lower bounds for structuring unreliable radio networks. In Proceedings of the International Symposium on Distributed Computing, 2014.Google ScholarCross Ref
- Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM, 51(3):385–463, 2004.Google ScholarDigital Library
- Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM, 52(10):76–84, 2009.Google ScholarDigital Library
Index Terms
- Smoothed Analysis of Information Spreading in Dynamic Networks
Recommendations
Faster information dissemination in dynamic networks via network coding
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe use network coding to improve the speed of distributed computation in the dynamic network model of Kuhn, Lynch and Oshman [STOC '10]. In this model an adversary adaptively chooses a new network topology in every round, making even basic distributed ...
Smoothed analysis of dynamic networks
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 ...
Smoothed Analysis of Leader Election in Distributed Networks
Stabilization, Safety, and Security of Distributed Systems
Comments