Crown: An Efficient and Stable Distributed Resource Lookup Protocol

  • T. I. Wang
  • K. H. Tsai
  • Y. H. Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3207)

Abstract

This paper modifies the Chord protocol and results in a new resource lookup protocol, the Crown protocol, which is suitable for mobile and wireless network environment. In Chord, all peers are connected to form a single ring topology, while Crown protocol adds concept of group and expands the ring to a group-ring. Besides, Crown adds a replica mechanism and a fault-recovery mechanism to strengthen the group-ring topology, and enhances the availability and reliability of resources. The group-ring concept makes the whole topology more stable when peers join or leave frequently.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Goldszmidt, G., Yemini, Y.: Evaluating Management Decisions via Delegation. In: IFIP International Symposium on Network Management (April 1993)Google Scholar
  2. 2.
    RFC 3174 US Secure Hash Algorithm 1 (SHA1) Google Scholar
  3. 3.
    The Gnutella Protocol Specification v0.4 Revision 1.2Google Scholar
  4. 4.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)CrossRefGoogle Scholar
  5. 5.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM (2001)Google Scholar
  6. 6.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. 18th IFIP/ACM Int’l. Conf. Distributed Systems Platforms, Middleware (2001)Google Scholar
  7. 7.
    Zhao, Y., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley (2001)Google Scholar
  8. 8.
    Plaxton, G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of ACM SPAA, June 1997, ACM, New York (1997)Google Scholar
  9. 9.
    Ranganathan, K., Iamnitchi, A., Foster, I.: Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities. In: Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, Berlin, Germany (May 2002)Google Scholar
  10. 10.
    Medina, Lakhina, A., Matta, I., Byers, J.: BRITE: An Approach to Universal Topology Generation. In: Proceedings of MASCOTS 2001, Cincinnati, OH (August 2001)Google Scholar
  11. 11.
    Tangmunarunkit, H., Govindan, R., Jamin, S., Willinger, S.S.W.: Network Topology Generators: Degree-Based vs. Structural. Technical report, Computer Science Department, University of Southern California, Technical Report 02-760 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • T. I. Wang
    • 1
  • K. H. Tsai
    • 1
  • Y. H. Lee
    • 1
  1. 1.National Cheng Kung UniversityTainanTaiwan, R.O.C.

Personalised recommendations