Document Open Access Logo

Brief Announcement: Highly Dynamic and Fully Distributed Data Structures

Authors John Augustine , Antonio Cruciani , Iqra Altaf Gillani

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.47.pdf
  • Filesize: 0.67 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Networks → Peer-to-peer networks
  • Theory of computation → Data structures design and analysis
Keywords
  • Peer-to-peer network
  • dynamic network
  • data structure
  • churn
  • distributed algorithm
  • randomized algorithm

Metrics

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

Abstract

We study robust and efficient distributed algorithms for building and maintaining distributed data structures in dynamic Peer-to-Peer (P2P) networks. P2P networks are characterized by a high level of dynamicity with abrupt heavy node churn (nodes that join and leave the network continuously over time). We present a novel algorithmic framework to build and maintain, with high probability, a skip list for poly(n) rounds despite a churn rate of 𝒪(n/log n), which is the number of nodes joining and/or leaving per round; n is the stable network size. We assume that the churn is controlled by an oblivious adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Importantly, the maintenance overhead in any interval of time (measured in terms of the total number of messages exchanged and the number of edges formed/deleted) is (up to log factors) proportional to the churn rate. Furthermore, the algorithm is scalable in that the messages are small (i.e., at most polylog(n) bits) and every node sends and receives at most polylog(n) messages per round.
To the best of our knowledge, our work provides the first-known fully-distributed data structure and associated algorithms that provably work under highly dynamic settings (i.e., high churn rate that is near-linear in n). Furthermore, the nodes operate in a localized manner. 
Our framework crucially relies on new distributed and parallel algorithms to merge two n-element skip lists and delete a large subset of items, both in 𝒪(log n) rounds with high probability. These procedures may be of independent interest due to their elegance and potential applicability in other contexts in distributed data structures.
Finally, we believe that our framework can be generalized to other distributed and dynamic data structures including graphs, potentially leading to stable distributed computation despite heavy churn.

Cite As Get BibTex

John Augustine, Antonio Cruciani, and Iqra Altaf Gillani. Brief Announcement: Highly Dynamic and Fully Distributed Data Structures. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 47:1-47:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.47

Author Details

John Augustine
  • Indian Institute of Technology Madras, Chennai, India
Antonio Cruciani
  • Aalto University, Espoo, Finland
Iqra Altaf Gillani
  • National Institute of Technology Srinagar, India

Funding

  • Cruciani, Antonio: This work was supported in part by the Research Council of Finland, Grant 363558 and Partially supported by the Cryptography, Cybersecutiry, and Distributed Trust laboratory at IIT Madras (Indian Institute of Technology Madras) while visiting the institute.

References

  1. James Aspnes and Gauri Shah. Skip graphs. ACM Trans. Algorithms, 2007. URL: https://doi.org/10.1145/1290672.1290674.
  2. John Augustine, Antonio Cruciani, and Iqra Altaf Gillani. Maintaining distributed data structures in dynamic peer-to-peer networks, 2024. URL: https://doi.org/10.48550/arXiv.2409.10235.
  3. John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. 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 2015, Berkeley, CA, USA, 17-20 October, 2015. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/FOCS.2015.29.
  4. 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 2012, Kyoto, Japan, January 17-19, 2012. SIAM, 2012. URL: https://doi.org/10.1137/1.9781611973099.47.
  5. John Augustine and Sumathi Sivasubramaniam. Spartan: Sparse robust addressable networks. J. Parallel Distributed Comput., 2021. URL: https://doi.org/10.1016/J.JPDC.2020.12.013.
  6. Michael A. Bender, Jeremy T. Fineman, Mahnush Movahedi, Jared Saia, Varsha Dani, Seth Gilbert, Seth Pettie, and Maxwell Young. Resource-competitive algorithms. SIGACT News, 2015. URL: https://doi.org/10.1145/2818936.2818949.
  7. John F. Canny. Collaborative filtering with privacy. In 2002 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 12-15, 2002. IEEE Computer Society, 2002. URL: https://doi.org/10.1109/SECPRI.2002.1004361.
  8. Inc Cloudmark. Website of cloudmark. https://cloudmark.com/, last checked on 14-February-2024.
  9. Peter Druschel and Antony I. T. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proceedings of HotOS-VIII: 8th Workshop on Hot Topics in Operating Systems, May 20-23, 2001, Elmau/Oberbayern, Germany. IEEE Computer Society, 2001. URL: https://doi.org/10.1109/HOTOS.2001.990064.
  10. Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, and Thomas E. Anderson. Profiling a million user dht. In Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007, San Diego, California, USA, October 24-26, 2007. ACM, 2007. URL: https://doi.org/10.1145/1298306.1298325.
  11. Roxana Geambasu, Tadayoshi Kohno, Amit A. Levy, and Henry M. Levy. Vanish: Increasing data privacy with self-destructing data. In 18th USENIX Security Symposium, Montreal, Canada, August 10-14, 2009, Proceedings. USENIX Association, 2009. URL: http://www.usenix.org/events/sec09/tech/full_papers/geambasu.pdf.
  12. Michael T. Goodrich, Michael J. Nelson, and Jonathan Z. Sun. The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006. ACM Press, 2006. URL: http://dl.acm.org/citation.cfm?id=1109557.1109601.
  13. Kathrin Hanauer, Monika Henzinger, and Christian Schulz. Recent advances in fully dynamic graph algorithms - A quick reference guide. ACM J. Exp. Algorithmics, 2022. URL: https://doi.org/10.1145/3555806.
  14. Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. Skipnet: A scalable overlay network with practical locality properties. In 4th USENIX Symposium on Internet Technologies and Systems, USITS'03, Seattle, Washington, USA, March 26-28, 2003. USENIX, 2003. URL: http://www.usenix.org/events/usits03/tech/harvey.html.
  15. Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. Skip^+: A self-stabilizing skip graph. J. ACM, 2014. URL: https://doi.org/10.1145/2629695.
  16. Antony I. T. Rowstron and Peter Druschel. Storage management and caching in past, A large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating System Principles, SOSP 2001, Chateau Lake Louise, Banff, Alberta, Canada, October 21-24, 2001. ACM, 2001. URL: https://doi.org/10.1145/502034.502053.
  17. Thomas Tseng, Laxman Dhulipala, and Guy E. Blelloch. Batch-parallel euler tour trees. In Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975499.8.
  18. Vasileios Vlachos, Stephanos Androutsellis-Theotokis, and Diomidis Spinellis. Security applications of peer-to-peer networks. Comput. Networks, 2004. URL: https://doi.org/10.1016/J.COMNET.2004.01.002.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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