Advertisement

Topology-Centric Look-Up Service

  • L. Garcés-Erice
  • K. W. Ross
  • E. W. Biersack
  • P. A. Felber
  • G. Urvoy-Keller
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2816)

Abstract

Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path that mimics the router-level shortest-path, thereby providing a small “stretch”. Experimental evaluation confirms that a lookup in TOPLUS takes time comparable to that of IP routing.

Keywords

Overlay Network Distribute Hash Table Virtual Node Cache Service Lookup Service 
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.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM (2001)Google Scholar
  2. 2.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. ACM SIGCOMM (2001)Google Scholar
  3. 3.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep., Computer Science Division, University of California, Berkeley (2001)Google Scholar
  5. 5.
    Shenker, S., Ratnasamy, S., Handley, M., Karp, R.: Topologically-aware overlay construction and server selection. In: Proc. Infocom, New York (2002)Google Scholar
  6. 6.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. Tech. Rep., Microsoft Research (2002)Google Scholar
  7. 7.
    Joseph, A.D., Zhao, B.Y., Duan, Y., Huang, L., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: Proc. IPTPS 2002, Cambridge, MA (2002)Google Scholar
  8. 8.
    Waldvogel, M., Rinaldi, R.: Efficient topology-aware overlay network. In: Proceedings of HotNets-I (2002)Google Scholar
  9. 9.
    Ng, E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proc. Infocom (2002)Google Scholar
  10. 10.
    Tangmunarunkit, H., Govindan, R., Shenker, S., Estrin, D.: The impact of routing policy on internet paths. In: Proc. Infocom (2001)Google Scholar
  11. 11.
    Freedman, M., Mazieres, D.: Sloppy hashing and self-organizing clusters. In: Proc. IPTPS 2003 (2003)Google Scholar
  12. 12.
    Krishnamurthy, B., Wang, J., Xie, Y.: Early measurements of a cluster-based architecture for P2P systems. In: ACM SIGCOMM Internet Measurement Workshop, San Francisco (2001)Google Scholar
  13. 13.
    Krisnamurthy, B., Wang, J.: On network-aware clustering of web sites. In: Proc. SIGCOMM (2000)Google Scholar
  14. 14.
    Wang, J.: Network Aware Client Clustering and Applications. PhD thesis, Cornell University (2001)Google Scholar
  15. 15.
    Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer informatic system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Kangasharju, J., Ross, K.W.: Adaptive replication and replacement strategies for P2P caching. Tech. Rep (2002)Google Scholar
  17. 17.
    Oregon University “Route Views” archive, http://rv-archive.uoregon.edu/
  18. 18.
  19. 19.
    Castify Networks, http://www.castify.net
  20. 20.
  21. 21.
  22. 22.
    Traceroute site, http://www.traceroute.org
  23. 23.
    Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating latency between arbitrary internet end hosts. In: Proc. 2nd Internet Measurement Workshop, Marseille, France (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • L. Garcés-Erice
    • 1
  • K. W. Ross
    • 2
  • E. W. Biersack
    • 1
  • P. A. Felber
    • 1
  • G. Urvoy-Keller
    • 1
  1. 1.Institut EURECOMSophia AntipolisFrance
  2. 2.Polytechnic UniversityBrooklynUSA

Personalised recommendations