Skip to main content
SpringerLink
Log in

Concurrent Maintenance of Rings

  • Original Article
  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join or leave the network, possibly concurrently. In this paper, we consider the maintenance of the ring topology, the basisof several peer-to-peer networks, in the fault-free environment. We design, and prove the correctness of, protocols that maintain a bidirectional ring under both joins and leaves. Our protocols update neighbor variables once a membership change occurs. We prove the correctness of our protocols using an assertional proof method, that is, we first identify a global invariant for a protocol and then show that every action of the protocol preserves the invariant. Our protocols are simple and our proofs are rigorous and explicit.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arora A., Gouda M.G.(1993). Closure and convergence: A foundation for fault-tolerant computing. IEEE Trans. Softw. Eng. 19, 1015–1027

    Article  Google Scholar 

  2. Ashcroft E.A.(1975). Proving assertions about parallel programs. J. Comput. Syst. Sci. 10, 110–135

    MATH  MathSciNet  Google Scholar 

  3. Aspnes, J., Shah, G.: Skip graphs. In: Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms. January 2003. See also Shah’s Ph.D. dissertation, Yale University, pp. 384–393 (2003)

  4. Awerbuch, B., Scheideler, C.: The Hyperring: A low-congestion deterministic data structure for distributed environments. In: Proceedings of the 15th Annual ACM-SIAM symposium on discrete algorithms (2004)

  5. Chandy K.M., Misra J.(1988). Parallel Program Design: A foundation. Addison-Wesley, Reading

    Google Scholar 

  6. Gouda M.G.(1998). Elements of Network Protocol Design. Wiley, Newyork

    Google Scholar 

  7. Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: Proceedings of the 4th USENIX symposium on internet technologies and systems. pp. 113–126 (2003)

  8. Hildrum, K., Kubiatowicz, J., Rao, S., Zhao, B.Y.: Distributed data location in a dynamic network. In: Proceedings of the 14th annual ACM symposium on parallel algorithms and architectures. pp. 41–52 (2002)

  9. Lamport L.(1982). An assertional correctness proof of a distributed algorithm. Sci. Comput. Program 2, 175–206

    Article  MATH  MathSciNet  Google Scholar 

  10. Lamport L.(1987). A fast mutual exclusion algorithm. ACM Trans. Comput. Syst. 5, 1–11

    Google Scholar 

  11. Li, X., Misra, J., Plaxton, C.G.: Brief announcement: Concurrent maintenance of rings. In: Proceedings of the 23rd ACM symposium on principles of distributed computing. pp. 376–376, July 2004. Full paper available as TR–04–03, Department of Computer Science, University of Texas at Austin, February 2004, (2004)

  12. Li, X., Plaxton, C.G.: On name resolution in peer-to-peer networks. In: Proceedings of the 2nd workshop on principles of mobile computing. October 2002 pp. 82–89, (2002)

  13. Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the 21st ACM symposium on principles of distributed computing, July 2002, pp. 233–242 (2002)

  14. Liu, H., Lam, S.S.: Neighbor table construction and update in a dynamic peer-to-peer network. In: Proceedings of the 23rd international conference on distributed computing systems, May 2003, pp. 509–519 (2003)

  15. Lynch, N., Malkhi, D., Ratajczak, D.: Atomic data access in content addressable networks. In: Proceedings of the 1st international workshop on peer-to-peer systems, March 2002, pp. 295–305 (2002)

  16. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM symposium on principles of distributed computing, June 2002, pp. 183–192 (2002)

  17. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proceedings of the 4th USENIX symposium on internet technologies and systems. March 2003, pp. 127–140 (2003)

  18. McGuire, T.M.: Correct implementation of network protocols. PhD Thesis, Department of Computer Science, University of Texas at Austin (2004)

  19. Pandurangan, G., Raghavan, P., and Upfal, E.: Building low-diameter P2P networks. In: Proceedings of the 37th annual symposium on foundations of computer science. October 2001, pp. 492–499 (2002)

  20. Plaxton C.G., Rajaraman R., Richa A.W.(1999). Accessing nearby copies of replicated objects in a distributed environment. Theo. Comput. Syst. 32, 241–280

    Article  MATH  MathSciNet  Google Scholar 

  21. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker,S.: A scalable content addressable network. In: Proceedings of the 2001 ACM SIGCOMM conference on applications, technologies, architectures, and protocols for computer communication. pp. 161–172 (2001)

  22. Risson, J., Robinson, K., Moors, T.: Fault tolerant active rings for structured peer-to-peer overlays. In: Proceedings of the 30th annual IEEE conference on local computer networks (LCN), pp. 18–25, November 2005, (2005)

  23. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM international conference on distributed systems platforms, November 2001, pp. 329–350 (2001)

  24. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of multimedia computing and networking (MMCN). January (2002)

  25. Stoica I., Morris R., Liben D.,-Nowell Karger D., Kaashoek F., Dabek F., Balakrishnan H.(2003). Chord: A scalable peer-to-peer lookup service for internet applications. IEEE/ACM Trans. Netw. 11, 17–32

    Article  Google Scholar 

  26. Zhao B.Y., Huang L., Stribling J., Rhea S.C., Joseph A.D., Kubiatowicz J.(2003). Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Selected Areas Commun. 22, 41–53

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, Austin, TX, 78712, USA

    Xiaozhou Li, Jayadev Misra & C. Greg. Plaxton

Authors
  1. Xiaozhou Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jayadev Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Greg. Plaxton
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. Greg. Plaxton.

Additional information

Li and Plaxton are supported by the National Science Foundation Grant CCR–0310970. Misra is supported by the National Science Foundation Grant CCR–0204323

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, X., Misra, J. & Plaxton, C.G. Concurrent Maintenance of Rings. Distrib. Comput. 19, 126–148 (2006). https://doi.org/10.1007/s00446-006-0008-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-006-0008-7

Keywords

Search

Navigation