Document Open Access Logo

Towards Communication-Efficient Peer-To-Peer Networks

Authors Khalid Hourani , William K. Moses Jr. , Gopal Pandurangan

PDF
Thumbnail PDF

File

LIPIcs.ESA.2024.71.pdf
  • Filesize: 0.79 MB
  • 15 pages

Document Identifiers

Author Details

Khalid Hourani
  • 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

  • Hourani, Khalid: K. Hourani was supported in part by NSF grants CCF-1540512, IIS-1633720, and CCF-1717075 and BSF grant 2016419.
  • 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

Khalid Hourani, William K. Moses Jr., and Gopal Pandurangan. Towards Communication-Efficient Peer-To-Peer Networks. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 71:1-71:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.71

Abstract

We focus on designing Peer-to-Peer (P2P) networks that enable efficient communication. Over the last two decades, there has been substantial algorithmic research on distributed protocols for building P2P networks with various desirable properties such as high expansion, low diameter, and robustness to a large number of deletions. A key underlying theme in all of these works is to distributively build a random graph topology that guarantees the above properties. Moreover, the random connectivity topology is widely deployed in many P2P systems today, including those that implement blockchains and cryptocurrencies. However, a major drawback of using a random graph topology for a P2P network is that the random topology does not respect the underlying (Internet) communication topology. This creates a large propagation delay, which is a major communication bottleneck in modern P2P networks. In this paper, we work towards designing P2P networks that are communication-efficient (having small propagation delay) with provable guarantees. Our main contribution is an efficient, decentralized protocol, Close-Weaver, that transforms a random graph topology embedded in an underlying Euclidean space into a topology that also respects the underlying metric. We then present efficient point-to-point routing and broadcast protocols that achieve essentially optimal performance with respect to the underlying space.

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
  • Expanders
  • Broadcast
  • Geometric Routing

Metrics

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

Related Versions

References

  1. Ittai Abraham, Dahlia Malkhi, and Oren Dobzinski. LAND: stretch (1 + epsilon) locality-aware networks for dhts. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 550-559. SIAM, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982873.
  2. D. Aldous and J.M. Steele. Asymptotics for euclidean minimal spanning trees on random points. Probab. Th. Rel. Fields, (92):247-258, 1992. Google Scholar
  3. 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. URL: https://doi.org/10.1145/1073970.1073991.
  4. 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
  5. 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
  6. 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. URL: https://doi.org/10.1007/s00224-006-1349-0.
  7. Free BSD. ping(8), 2022. URL: https://man.freebsd.org/cgi/man.cgi?query=ping&sektion=8.
  8. 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
  9. Colin Cooper, Martin E. Dyer, and Catherine S. Greenhill. Sampling regular graphs and a peer-to-peer network. Combinatorics, Probability & Computing, 16(4):557-593, 2007. Google Scholar
  10. Kyle Croman, Christian Decker, Ittay Eyal, Adem Efe Gencer, Ari Juels, Ahmed Kosba, Andrew Miller, Prateek Saxena, Elaine Shi, Emin Gün Sirer, Dawn Song, and Roger Wattenhofer. On scaling decentralized blockchains. In Jeremy Clark, Sarah Meiklejohn, Peter Y.A. Ryan, Dan Wallach, Michael Brenner, and Kurt Rohloff, editors, Financial Cryptography and Data Security, pages 106-125, Berlin, Heidelberg, 2016. Springer Berlin Heidelberg. Google Scholar
  11. Frank Dabek, Russ Cox, M. Frans Kaashoek, and Robert Tappan Morris. Vivaldi: a decentralized network coordinate system. In Raj Yavatkar, Ellen W. Zegura, and Jennifer Rexford, editors, ACM SIGCOMM, pages 15-26, 2004. Google Scholar
  12. Maximilian Drees, Robert Gmyr, and Christian Scheideler. Churn- and dos-resistant overlay networks based on network reconfiguration. In Christian Scheideler and Seth Gilbert, editors, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, pages 417-427. ACM, 2016. URL: https://doi.org/10.1145/2935764.2935783.
  13. Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer. Diameter and broadcast time of random geometric graphs in arbitrary dimensions. Algorithmica, 67(1):65-88, 2013. Google Scholar
  14. Ghurumuruhan Ganesan. Stretch and diameter in random geometric graphs. Algorithmica, 80:300-330, 2018. Google Scholar
  15. Seth Gilbert, Gopal Pandurangan, Peter Robinson, and Amitabh Trehan. Dconstructor: Efficient and robust network construction with polylogarithmic overhead. In Yuval Emek and Christian Cachin, editors, PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pages 438-447. ACM, 2020. URL: https://doi.org/10.1145/3382734.3405716.
  16. 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
  17. Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. Time-optimal construction of overlay networks. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, ACM Symposium on Principles of Distributed Computing (PODC), pages 457-468, 2021. Google Scholar
  18. Kirsten Hildrum, John Kubiatowicz, Sean Ma, and Satish Rao. A note on the nearest neighbor in growth-restricted metrics. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 560-561. SIAM, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982874.
  19. 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
  20. Khalid Hourani, William K. Moses Jr., and Gopal Pandurangan. Towards communication-efficient peer-to-peer networks, 2024. URL: https://arxiv.org/abs/2406.16661.
  21. Zi Hu, John S. Heidemann, and Yuri Pradkin. Towards geolocation of millions of IP addresses. In Proceedings of the 12th ACM SIGCOMM Internet Measurement Conference, IMC, pages 123-130, 2012. Google Scholar
  22. 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
  23. David R. Karger and Matthias Ruhl. Finding nearest neighbors in growth-restricted metrics. In John H. Reif, editor, Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pages 741-750. ACM, 2002. URL: https://doi.org/10.1145/509907.510013.
  24. Brad Karp and Hsiang-Tsung Kung. Gpsr: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking, pages 243-254, 2000. Google Scholar
  25. Evangelos Kranakis, Harvinder Singh, and Jorge Urrutia. Compass routing on geometric networks. In Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999, 1999. URL: http://www.cccg.ca/proceedings/1999/c46.pdf.
  26. Mike Krebs and Anthony Shaheen. Expander families and Cayley graphs: a beginner’s guide. Oxford University Press, 2011. Google Scholar
  27. Fabian Kuhn, Roger Wattenhofer, Yan Zhang, and Aaron Zollinger. Geometric ad-hoc routing: Of theory and practice. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 63-72, 2003. Google Scholar
  28. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In IEEE INFOCOM, pages 2133-2143, 2003. Google Scholar
  29. 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
  30. 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
  31. Andrew K. Miller, James Litton, Andrew Pachulski, Neal Gupta, Dave Levin, Neil Spring, and Bobby Bhattacharjee. Discovering bitcoin ’ s public topology and influential nodes, 2015. Google Scholar
  32. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2^nd edition, 2017. Google Scholar
  33. S. Muthukrishnan and Gopal Pandurangan. Thresholding random geometric graph properties motivated by ad hoc sensor networks. J. Comput. Syst. Sci., 76(7):686-696, 2010. Google Scholar
  34. Edgar M. Palmer. Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley & Sons, Inc., USA, 1985. Google Scholar
  35. 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
  36. Gopal Pandurangan, Peter Robinson, and Amitabh Trehan. Dex: self-healing expanders. Distributed Computing, 29(3):163-185, 2016. Google Scholar
  37. David Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, 2000. Google Scholar
  38. Mathew D. Penrose. Random Geometric Graphs. Oxford University Press, 2003. Google Scholar
  39. C. Greg Plaxton, Rajmohan Rajaraman, and Andréa W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst., 32(3):241-280, 1999. URL: https://doi.org/10.1007/s002240000118.
  40. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware 2001: IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, Germany, November 12-16, 2001 Proceedings 2, pages 329-350. Springer, 2001. Google Scholar
  41. Atish Das Sarma, Anisur Rahaman Molla, and Gopal Pandurangan. Distributed computation in dynamic networks via random walks. Theor. Comput. Sci., 581:45-66, 2015. URL: https://doi.org/10.1016/j.tcs.2015.02.044.
  42. Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, and Prasad Tetali. Distributed random walks. J. ACM, 60(1):2:1-2:31, 2013. URL: https://doi.org/10.1145/2432622.2432624.
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