Document Open Access Logo

Time- and Communication-Efficient Overlay Network Construction via Gossip

Authors Fabien Dufoulon , Michael Moorman , William K. Moses Jr. , Gopal Pandurangan

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.42.pdf
  • Filesize: 0.88 MB
  • 23 pages

Document Identifiers

Author Details

Fabien Dufoulon
  • School of Computing and Communications, Lancaster University, UK
Michael Moorman
  • Department of Computer Science, University of Houston, TX, USA
William K. Moses Jr.
  • Department of Computer Science, Durham University, UK
Gopal Pandurangan
  • Department of Computer Science, University of Houston, TX, USA

Funding

  • Dufoulon, Fabien: Part of the work was done while Fabien Dufoulon was a postdoctoral fellow at the University of Houston, Houston, TX, USA. F. Dufoulon was supported in part by National Science Foundation (NSF) grants CCF-1540512, IIS-1633720, and CCF-1717075 and U.S.-Israel Binational Science Foundation (BSF) grant 2016419.
  • Moorman, Michael: M. Moorman was supported in part by NSF IIS-1633720 REU Supplement grant.
  • Moses Jr., William K.: Part of the work was done while William K. Moses Jr. was a postdoctoral fellow at the University of Houston, Houston, TX, USA. W. K. Moses Jr. was supported in part by NSF grants CCF-1540512, IIS-1633720, and CCF-1717075 and BSF grant 2016419.
  • Pandurangan, Gopal: G. Pandurangan was supported in part by NSF grants CCF-1540512, IIS-1633720, and CCF-1717075 and BSF grant 2016419.

Cite AsGet BibTex

Fabien Dufoulon, Michael Moorman, William K. Moses Jr., and Gopal Pandurangan. Time- and Communication-Efficient Overlay Network Construction via Gossip. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 42:1-42:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.42

Abstract

We focus on the well-studied problem of distributed overlay network construction. We consider a synchronous gossip-based communication model where in each round a node can send a message of small size to another node whose identifier it knows. The network is assumed to be reconfigurable, i.e., a node can add new connections (edges) to other nodes whose identifier it knows or drop existing connections. Each node initially has only knowledge of its own identifier and the identifiers of its neighbors. The overlay construction problem is, given an arbitrary (connected) graph, to reconfigure it to obtain a bounded-degree expander graph as efficiently as possible. The overlay construction problem is relevant to building real-world peer-to-peer network topologies that have desirable properties such as low diameter, high conductance, robustness to adversarial deletions, etc. Our main result is that we show that starting from any arbitrary (connected) graph G on n nodes and m edges, we can construct an overlay network that is a constant-degree expander in polylog rounds using only Õ(n) messages. Our time and message bounds are both essentially optimal (up to polylogarithmic factors). Our distributed overlay construction protocol is very lightweight as it uses gossip (each node communicates with only one neighbor in each round) and also scalable as it uses only Õ(n) messages, which is sublinear in m (even when m is moderately dense). To the best of our knowledge, this is the first result that achieves overlay network construction in polylog rounds and o(m) messages. Our protocol uses graph sketches in a novel way to construct an expander overlay that is both time and communication efficient. A consequence of our overlay construction protocol is that distributed computation can be performed very efficiently in this model. In particular, a wide range of fundamental tasks such as broadcast, leader election, and minimum spanning tree (MST) construction can be accomplished in polylog rounds and Õ(n) message complexity in any graph.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Mathematics of computing → Probabilistic algorithms
  • Mathematics of computing → Discrete mathematics
Keywords
  • Peer-to-Peer Networks
  • Overlay Construction Protocol
  • Gossip
  • Expanders
  • Sublinear Bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. Analyzing graph structure via linear measurements. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 459-467, 2012. Google Scholar
  2. Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Proceedings of the 31st ACM Symposium on Principles of Database Systems (PODS), pages 5-14, 2012. Google Scholar
  3. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, and Yitong Yin. Fast construction of overlay networks. In Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 145-154, 2005. Google Scholar
  4. Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, and Yitong Yin. Fast construction of overlay networks. In Phillip B. Gibbons and Paul G. Spirakis, editors, SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pages 145-154. ACM, 2005. Google Scholar
  5. John Augustine, Soumyottam Chatterjee, and Gopal Pandurangan. A fully-distributed scalable peer-to-peer protocol for byzantine-resilient distributed hash tables. In Kunal Agrawal and I-Ting Angelina Lee, editors, SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, pages 87-98. ACM, 2022. URL: https://doi.org/10.1145/3490148.3538588.
  6. John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, and Jason Li. Distributed computation in node-capacitated networks. In Christian Scheideler and Petra Berenbrink, editors, The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, pages 69-79. ACM, 2019. URL: https://doi.org/10.1145/3323165.3323195.
  7. John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, and Eli Upfal. Storage and search in dynamic peer-to-peer networks. In Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 53-62, 2013. Google Scholar
  8. John Augustine, Gopal Pandurangan, and Peter Robinson. Fast byzantine agreement in dynamic networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 74-83, 2013. Google Scholar
  9. John Augustine, Gopal Pandurangan, and Peter Robinson. Fast byzantine leader election in dynamic networks. In 29th International Symposium on Distributed Computing (DISC), volume 9363 of Lecture Notes in Computer Science, pages 276-291, 2015. Google Scholar
  10. John Augustine, Gopal Pandurangan, and Peter Robinson. Distributed algorithmic foundations of dynamic networks. SIGACT News, 47(1):69-98, 2016. Google Scholar
  11. John Augustine, Gopal Pandurangan, Peter Robinson, Scott Roche, and Eli Upfal. Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 350-369, 2015. Google Scholar
  12. John Augustine, Gopal Pandurangan, Peter Robinson, and Eli Upfal. Towards robust and efficient computation in dynamic peer-to-peer networks. In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 551-569, 2012. Google Scholar
  13. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. The effect of faults on network expansion. Theory Comput. Syst., 39(6):903-928, 2006. Google Scholar
  14. Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, and Petar Maymounkov. Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In Howard J. Karloff and Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 961-970. ACM, 2012. URL: https://doi.org/10.1145/2213977.2214064.
  15. Keren Censor-Hillel and Hadas Shachnai. Fast information spreading in graphs with large weak conductance. SIAM J. Comput., 41(6):1451-1465, 2012. URL: https://doi.org/10.1137/110845380.
  16. 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, ICDCN '20, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3369740.3369778.
  17. Colin Cooper, Martin E. Dyer, and Catherine S. Greenhill. Sampling regular graphs and a peer-to-peer network. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 980-988. SIAM, 2005. Google Scholar
  18. Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, and Prasad Tetali. Distributed random walks. J. ACM, 60(1), 2013. Google Scholar
  19. Alan J. Demers, Daniel H. Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard E. Sturgis, Daniel C. Swinehart, and Douglas B. Terry. Epidemic algorithms for replicated database maintenance. In Fred B. Schneider, editor, Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10-12, 1987, pages 1-12. ACM, 1987. Google Scholar
  20. Michael Dinitz, Michael Schapira, and Asaf Valadarsky. Explicit expanding expanders. Algorithmica, 78(4):1225-1245, 2017. URL: https://doi.org/10.1007/s00453-016-0269-x.
  21. Uriel Feige, David Peleg, Prabhakar Raghavan, and Eli Upfal. Randomized broadcast in networks. Random Structures & Algorithms, 1(4):447-460, 1990. Google Scholar
  22. Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and systems (TOPLAS), 5(1):66-77, 1983. Google Scholar
  23. Mohsen Ghaffari, Fabian Kuhn, and Hsin-Hao Su. Distributed MST and routing in almost mixing time. In Proceedings of the 2017 ACM Symposium on Principles of Distributed Computing (PODC), pages 131-140, 2017. Google Scholar
  24. Mohsen Ghaffari and Jason Li. New distributed algorithms in almost mixing time via transformations from parallel algorithms. In Ulrich Schmid and Josef Widder, editors, 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, volume 121 of LIPIcs, pages 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.31.
  25. George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), pages 57-68, 2011. Google Scholar
  26. Seth Gilbert, Gopal Pandurangan, Peter Robinson, and Amitabh Trehan. Dconstructor: Efficient and robust network construction with polylogarithmic overhead. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 438-447, 2020. Google Scholar
  27. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks: Algorithms and evaluation. Performance Evaluation, 63(3):241-263, 2006. Google Scholar
  28. Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. Distributed monitoring of network properties: The power of hybrid networks. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, volume 80 of LIPIcs, pages 137:1-137:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.137.
  29. Robert Gmyr and Gopal Pandurangan. Time-Message Trade-Offs in Distributed Algorithms. In 32nd International Symposium on Distributed Computing (DISC 2018), pages 32:1-32:18, 2018. Google Scholar
  30. Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. Time-optimal construction of overlay networks. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC), pages 457-468, 2021. Google Scholar
  31. Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4):439-561, 2006. Google Scholar
  32. Tim Jacobs and Gopal Pandurangan. Stochastic analysis of a churn-tolerant structured peer-to-peer scheme. Peer-to-Peer Networking and Applications, 6(1):1-14, 2013. Google Scholar
  33. Hossein Jowhari, Mert Saglam, and Gábor Tardos. Tight bounds for lp samplers, finding duplicates in streams, and related problems. In Maurizio Lenzerini and Thomas Schwentick, editors, Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece, pages 49-58. ACM, 2011. URL: https://doi.org/10.1145/1989284.1989289.
  34. Richard M. Karp, Christian Schindelhauer, Scott Shenker, and Berthold Vöcking. Randomized rumor spreading. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 565-574. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/SFCS.2000.892324.
  35. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), November 2002. Google Scholar
  36. David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-based computation of aggregate information. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 482-491. IEEE, 2003. Google Scholar
  37. Valerie King, Shay Kutten, and Mikkel Thorup. Construction and impromptu repair of an MST in a distributed network with o(m) communication. In Chryssis Georgiou and Paul G. Spirakis, editors, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015, pages 71-80. ACM, 2015. URL: https://doi.org/10.1145/2767386.2767405.
  38. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. On the complexity of universal leader election. Journal of the ACM, 62(1):7:1-7:27, 2015. Invited paper from ACM PODC 2013. URL: https://doi.org/10.1145/2699440.
  39. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In IEEE INFOCOM, pages 2133-2143, 2003. Google Scholar
  40. Peter Mahlmann and Christian Schindelhauer. Distributed random digraph transformations for peer-to-peer networks. In Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 308-317, 2006. Google Scholar
  41. Yifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, and Kannan Srinivasan. Perigee: Efficient peer-to-peer network design for blockchains. In ACM Symposium on Principles of Distributed Computing (PODC), pages 428-437, 2020. Google Scholar
  42. Ali Mashreghi and Valerie King. Time-communication trade-offs for minimum spanning tree construction. In Proceedings of the 18th International Conference on Distributed Computing and Networking (ICDCN), 2017. Google Scholar
  43. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2^nd edition, 2017. Google Scholar
  44. Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal. Building low-diameter P2P networks. In IEEE Symposium on the Foundations of Computer Science (FOCS), pages 492-499, 2001. Google Scholar
  45. Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. Fast distributed algorithms for connectivity and mst in large graphs. ACM Transactions on Parallel Computing (TOPC), 5(1):1-22, 2018. Google Scholar
  46. Gopal Pandurangan and Amitabh Trehan. Xheal: a localized self-healing algorithm using expanders. Distributed Computing, 27(1):39-54, 2014. Google Scholar
  47. Tiago P. Peixoto. The graph-tool python library. figshare, 2014. URL: https://doi.org/10.6084/m9.figshare.1164194.
  48. David Peleg. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, 2000. Google Scholar
  49. Leslie G. Valiant. A scheme for fast parallel communication. SIAM J. Comput., 11(2):350-361, 1982. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact