Advertisement

Active and Concurrent Topology Maintenance

  • Xiaozhou Li
  • Jayadev Misra
  • C. Greg Plaxton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3274)

Abstract

A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join and leave the network, possibly concurrently. In this paper, we first present a protocol that maintains a ring, the basis of several structured peer-to-peer networks. We then present a protocol that maintains Ranch, a topology consisting of multiple rings. The protocols handle both joins and leaves concurrently and actively (i.e., neighbor variables are updated once a join or a leave occurs). We use an assertional method to prove the correctness of the protocols, that is, we first identify a global invariant for a protocol and then show that every action of the protocol preserves the invariant. The protocols are simple and the proofs are rigorous and explicit.

Keywords

Neighbor Variable Incoming Message Passive Approach Membership Change Topology Exchange 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arora, A., Gouda, M.G.: Closure and convergence: A foundation for faulttolerant computing. IEEE Transactions on Software Engineering 19, 1015–1027 (1993)CrossRefGoogle Scholar
  2. 2.
    Aspnes, J., Shah, G.: Skip graphs. In: Proceedings of the 14th Annual ACMSIAM Symposium on Discrete Algorithms, January 2003, pp. 384–393 (2003); See also Shah’s Ph.D. dissertation, Yale University (2003)Google Scholar
  3. 3.
    Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)zbMATHGoogle Scholar
  4. 4.
    Gouda, M.G.: Elements of Network Protocol Design. John Wiley & Sons, Chichester (1998)Google Scholar
  5. 5.
    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, March 2003, pp. 113–126 (2003)Google Scholar
  6. 6.
    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, August 2002, pp. 41–52 (2002)Google Scholar
  7. 7.
    Lehmann, D., Rabin, M.: On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In: Proceedings of 8th ACM Symposium on Principles of Programming Languages, January 1981, pp. 133–138 (1981)Google Scholar
  8. 8.
    Li, X.: Maintaining the Chord ring. Technical Report TR–04–30, Department of Computer Science, University of Texas at Austin (July 2004)Google Scholar
  9. 9.
    Li, X., Misra, J., Plaxton, C.G.: Active and concurrent topology maintenance for a structured peer-to-peer network topology. Technical Report TR–04–21, Department of Computer Science, University of Texas at Austin (May 2004)Google Scholar
  10. 10.
    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, July 2004, pp. 376–376 (2004); Full paper available as TR–04–03, Department of Computer Science, University of Texas at Austin (February 2004) Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Liu, H., Lam, S.S.: Neighbor table construction and update in a dynamic peerto- peer network. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, May 2003, pp. 509–519 (2003)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    McGuire, T.M.: Correct Implementation of Network Protocols. PhD thesis, Department of Computer Science, University of Texas at Austin (April 2004)Google Scholar
  18. 18.
    Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications 21, 995–1002 (2003)CrossRefGoogle Scholar
  19. 19.
    Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems 32, 241–280 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    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)Google Scholar
  21. 21.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  22. 22.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Transactions on Networking 11, 17–32 (2003)CrossRefGoogle Scholar
  23. 23.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Xiaozhou Li
    • 1
  • Jayadev Misra
    • 1
  • C. Greg Plaxton
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at AustinAustin

Personalised recommendations