Abstract
Internet overlay services must adapt to the substrate network topology and link properties to achieve high performance. A common overlay structure management layer is desirable for enhancing the architectural modularity of service design and deployment. A shared substrate-aware overlay structure can also save redundant per-service link-selection probing when overlay nodes participate in multiple services. Despite the benefits, the concept of building services on a common structure management layer does not work well with recently proposed scalable distributed hashtable (DHT) protocols that employ protocol-specific overlay structures. In this paper, we present the design of a self-organizing DHT protocol based on the Landmark Hierarchy. Coupled with a simple low-latency overlay structure management protocol, this approach can support low-latency DHT lookup without any service-specific requirement on the overlay structure. Using simulations and experimentation on 51 PlanetLab sites, we measure the performance of the proposed scheme in terms of lookup latency, load balance, and stability during node churns.
This work was supported in part by the National Science Foundation grants CCR-0306473 and ITR/IIS-0312925.
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.
References
Andersen, D., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient Overlay Networks. In: Proc. of SOSP, Banff, Canada, October 2001, pp. 131–145 (2001)
Bavier, A., Bowman, M., Chun, B., Culler, D., Karlin, S., Muir, S., Peterson, L., Roscoe, T., Spalink, T., Wawrzoniak, M.: Operating System Support for Planetary-Scale Network Services. In: Proc. of NSDI, San Francisco, CA, March 2004, pp. 253–266 (2004)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Peerto- Peer Overlay Networks. In: Proc. of the FuDiCo Workshop, Bertinoro, Italy (June 2002)
Chen, B., Morris, R.: L+: Scalable Landmark Routing and Address Lookup for Multi-hop Wireless Networks. Technical Report MIT-LCS-TR-837, Laboratory for Computer Science, MIT (2002)
Chu, Y.-H., Rao, S.G., Zhang, H.: A Case for End System Multicast. In: Proc. of SIGMETRICS, Santa Clara, CA, June 2000, pp. 1–12 (2000)
Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for Low Latency and High Throughput. In: Proc. of NSDI, San Francisco, CA, March 2004, pp. 85–98 (2004)
Francis, P., Jamin, S., Paxson, V., Zhang, L., Gryniewicz, D.F., Jin, Y.: An Architecture for a Global Internet Host Distance Estimation Service. In: Proc. of INFOCOM, New York, NY (March 1999)
Jain, S., Mahajan, R., Wetherall, D.: A Study of the Performance Potential of DHT-based Overlays. In: Proc. of USITS, Seattle, WA (March 2003)
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistency Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In: Proc. of the ACM Symp. on Theory of Computing, El Paso, TX, May 1997, pp. 654–663 (1997)
Kleinrock, L., Kamoun, F.: Hierarchical Routing for Large Networks. Computer Networks 1, 155–174 (1977)
Kumar, S., Alaettinoglu, C., Estrin, D.: SCalable Object-tracking Through Unattended Techniques (SCOUT). In: Proc. of ICNP, Osaka, Japan (November 2000)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. of the ACM International Conference on Supercomputing, York, NY, June 2002, pp. 84–95 (2002)
Ng, E., Zhang, H.: Predicting Internet Network Distance with Coordinates-based Approaches. In: Proc. of INFOCOM, New York, NY (June 2002)
BGP Routing Data at the National Laboratory for Applied Network Research, http://moat.nlanr.net/Routing/rawdata
Active Measurement Project at the National Laboratory for Applied Network Research, http://amp.nlanr.net
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content- Addressable Network. In: Proc. of SIGCOMM, San Diego, CA, August 2001, pp. 161–172 (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and Server Selection. In: Proc. of INFOCOM, New York, NY (June 2002)
University of Oregon Route Views Archive Project, http://archive.routeviews.org
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-Peer Systems. In: Proc. of the IFIP/ACM Middleware, Heidelberg, Germany (November 2001)
Shen, K.: Structure Management for Scalable Overlay Service Construction. In: Proc. of NSDI, San Francisco, CA, March 2004, pp. 281–294 (2004)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord:AScalable Peerto- peer Lookup Service for Internet Applications. In: Proc. of SIGCOMM, San Diego, CA, August 2001, pp. 149–160 (2001)
Tsuchiya, P.F.: The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks. In: Proc. of SIGCOMM, Stanford, CA, August 1988, pp. 35–42 (1988)
Waldvogel, M., Rinaldi, R.: Efficient Topology-Aware Overlay Network. In: Proc. of the HotNets Workshop, Princeton, NJ (October 2002)
Winick, J., Jamin, S.: Inet-3.0: Internet Topology Generator. Technical Report CSE-TR- 456-02, Dept. of EECS, University of Michigan (2002)
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to Model an Internetwork. In: Proc. of INFOCOM, San Francisco, CA (March 1996)
Zhang, H., Goel, A., Govindan, R.: Incrementally Improving Lookup Latency in Distributed Hash Table Systems. In: Proc. of SIGMETRICS, San Diego, CA (June 2003)
Zhao, B., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark Routing on Overlay Networks. In: Proc. of the Workshop on Peer-to-Peer Systems, Cambridge, MA (March 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, K., Sun, Y. (2004). Distributed Hashtable on Pre-structured Overlay Networks. In: Chi, CH., van Steen, M., Wills, C. (eds) Web Content Caching and Distribution. WCW 2004. Lecture Notes in Computer Science, vol 3293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30471-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30471-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23516-3
Online ISBN: 978-3-540-30471-5
eBook Packages: Springer Book Archive