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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. ACM SIGCOMM (2001)
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)
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)
Shenker, S., Ratnasamy, S., Handley, M., Karp, R.: Topologically-aware overlay construction and server selection. In: Proc. Infocom, New York (2002)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. Tech. Rep., Microsoft Research (2002)
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)
Waldvogel, M., Rinaldi, R.: Efficient topology-aware overlay network. In: Proceedings of HotNets-I (2002)
Ng, E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proc. Infocom (2002)
Tangmunarunkit, H., Govindan, R., Shenker, S., Estrin, D.: The impact of routing policy on internet paths. In: Proc. Infocom (2001)
Freedman, M., Mazieres, D.: Sloppy hashing and self-organizing clusters. In: Proc. IPTPS 2003 (2003)
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)
Krisnamurthy, B., Wang, J.: On network-aware clustering of web sites. In: Proc. SIGCOMM (2000)
Wang, J.: Network Aware Client Clustering and Applications. PhD thesis, Cornell University (2001)
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)
Kangasharju, J., Ross, K.W.: Adaptive replication and replacement strategies for P2P caching. Tech. Rep (2002)
Oregon University “Route Views” archive, http://rv-archive.uoregon.edu/
Merit Network, http://www.merit.edu/simipma/routingtable/
Castify Networks, http://www.castify.net
Whois service at RIPE, http://www.ripe.net/db/whois/whois.html
Traceroute site, http://www.traceroute.org
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garcés-Erice, L., Ross, K.W., Biersack, E.W., Felber, P.A., Urvoy-Keller, G. (2003). Topology-Centric Look-Up Service. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds) Group Communications and Charges. Technology and Business Models. NGC ICQT 2003 2003. Lecture Notes in Computer Science, vol 2816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39405-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-39405-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20051-2
Online ISBN: 978-3-540-39405-1
eBook Packages: Springer Book Archive