Incrementally improving lookup latency in distributed hash table systems

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 114-125

  Zhang, Hui ^a   Goel, Ashish ^b   Govindan, Ramesh ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

DHT; Latency stretch; Peer to peer; Random sampling

Indexed keywords

DISTRIBUTED HASH TABLE (DHT) SYSTEMS; LATENCY STRETCH; PEER-TO-PEER; RANDOM SAMPLING;

COMPUTER SIMULATION; INFORMATION RETRIEVAL; INTERNET; ROUTERS; SAMPLING; TOPOLOGY;

TABLE LOOKUP;

EID: 4544368116     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781042     Document Type: Conference Paper

References (31)

1. W. Aiello, F. Chung, and L. Lu. A Random Graph Model for Massive Graphs. the 32nd Annual Symposium on Theory of Computing, 2000.
2. B. Bollobas. Random Graphs. Academic Press, Inc. Orlando, Florida, 1985.
3. L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker. Web Caching and Zipf-like Distribution: Evidence and Implications. IEEE INFOCOM, 1999.
4. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting Network Proximity in Peer-to-Peer Overlay Networks. Technical report MSR-TR-2002-82, 2002.
5. R. Cox, A. Muthitacharoen, R. Morris. Serving DNS Using Chord. the First International Workshop on Peer-to-peer Systems (IPTPS'02). March, 2002.
6. F. Dabek, M. F. Kasshoek, D. Karger, R. Morris, and I. Stoica. Wide-area Cooperative Storage with CFS. ACM SOSP'01. October 2001.
7. T.S. Eugene, and H. Zhang. Predicting Internet Network Distance with Coordinates-based Approaches. IEEE INFOCOM, 2002.
8. C.Faloutsos, P. Faloutsos, and M.Faloutsos. On Power-law Relationships of the Internet Topology. ACM SIGCOMM, 1999.
9. R. Govindan and H. Tangmunarunkit. Heuristics for Internet Map Discovery. IEEE INFOCOM, 2000.
10. S. Iyer, A. Rowstron, and P. Druschel. SQUIRREL: A Decentralized Peer-to-peer Web Cache. the 21st ACM Symposium on Principles of Distributed Computing (PODC2002). July 2002.
11. D.R. Karger and M. Ruhl. Finding Nearest Neighbors in Growth-restricted Metrics. ACM Symposium on Theory of Computing (STOC '02). May 2002.
12. A. Keromytis, V. Misra and D. Rubenstein. SOS: Secure Overlay Services. ACM SIGCOMM, 2002.
13. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An Architecture for Global-scale Persistent Storage. the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
14. V.N. Padmanabhan, L. Subramanian. An Investigation of Geographic Mapping Techniques for Internet Hosts. ACM SIGCOMM, 2001.
15. G. Phillips, S. Shenker, H. Tangmunarunkit. Scaling of Multicast Trees: Comments on the Chuang-Sirbu Scaling Law. ACM SIGCOMM, 1999.
16. C.G. Plaxton, R. Rajaraman, and A.W Richa. Accessing Nearby Copies of Replicated Objects in A Distributed Environment. the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, 1997.
17. S. Ratnaswamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-addressable Network. ACM SIGCOMM, 2001.
18. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-Aware Overlay Construction and Server Selection. IEEE INFOCOM, 2002.
19. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level Multicast Using Content-addressable Networks. NGC 2001. Nov. 2001.
20. S. Ratnasamy, S. Shenker, and I. Stoica. Routing Algorithms for DHTs: Some Open Questions. the First International Workshop on Peer-to-peer Systems (IPTPS'02). March, 2002.
21. S. C. Rhea, J. Kubiatowicz. Probabilistic Location and Routing. IEEE INFOCOM, 2002.
22. A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. International Conference on Distributed Systems Platforms (Middleware), Nov 2001.
23. A. Rowstron, A.M. Kermarrec, M. Castro, and P. Druschel. Scribe: The Design of A Large-scale Event Notification Infrastructure. the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001). Nov. 2001.
24. N. Spring, R. Mahajan, D. Wetherall. Measuring ISP Topologies with Rocketfuel. ACM SIGCOMM, 2002.
25. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, S. Surana. Internet Indirection Infrastructure. ACM SIGCOMM, 2002.
26. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Peer-to-peer Lookup Service for Internet Applications. ACM SIGCOMM, 2001.
27. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network Topology Generators: Degree-Based vs. Structural. ACM SIGCOMM 2002.
28. M. Waldvogel, R. Rinaldi. Efficient Topology-Aware Overlay Network. First Workshop on Hot Topics in Networks (HotNets-I).October 2002
29. H. Zhang, A. Goel, and R. Govindan. Incrementally Improving Lookup Latency in Distributed Hash Table Systems. Technical Report 03-786, Computer Science Department, University of Southern California, 2003. available at ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/03-786.pdf
30. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An Infrastructure for Fault-resilient Wide-area Location and Routing. Tech. Report UCB/CSD-01-1141, U.C. Berkeley, April 2001.
31. Chord simulator. http://pdos.lcs.mit.edu/cgi-bin/cvsweb.cgi/sfsnet/ simulator