Improving lookup latency in distributed hash table systems using random sampling

IEEE/ACM Transactions on Networking

Volumn 13, Issue 5, 2005, Pages 1121-1134

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

^a University of Southern California   (United States)

^b Stanford University   (United States)

Author keywords

Distributed hash table (DHT); Internet topology; Latency expansion; Latency stretch; Peer to peer; Random sampling; Randomized algorithm

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; RANDOM PROCESSES; ROUTERS; SAMPLING;

DISTRIBUTED HASH TABLE (DHT); INTERNET TOPOLOGY; LATENCY EXPANSION; LATENCY STRETCH; RANDOM SAMPLING; RANDOMIZED ALGORITHM;

INTERNET;

EID: 28044467147     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.857106     Document Type: Article

References (41)

1. I. Abraham, D. Malkhi, and O. Dubzinski, "LAND: Locality aware networks for distributed hash tables," presented at the ACM-SIAM Symp. Discrete Algorithms (SODA04), New Orleans, LA, 2004.
2. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs," in Proc. 32nd ACM Symp. Theory of Computing, Portland, OR, 2000, pp. 171-180.
3. B. Bollobas, Random Graphs. Orlando, FL: Academic, 1985.
4. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and Zipf-like distribution: Evidence and implications," in Proc. IEEE INFOCOM, vol. 1, Mar. 1999, pp. 126-134.
5. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, "Exploiting network proximity in peer-to-peer overlay networks," Microsoft Research, Tech. Rep. MSR-TR-2002-82, 2002.
6. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-bandwidth multicast in a cooperative environment," presented at the 19th ACM Symp. Operating Systems Principles (SOSP'03), Lake Bolton, NY, Oct. 2003.
7. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, "SCRIBE: A large-scale and decentralized application-level multicast infrastructure," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.
8. R. Cox, A. Muthitacharoen, and R. Morris, "Serving DNS using Chord," presented at the 1st Int. Workshop on Pier-to-Peer Systems (IPTPS'02), Cambridge, MA, Mar. 2002.
9. F. Dabek, M. F. Kasshoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," presented at the 18th ACM. Symp. Operating Systems Principles (SOSP'01), Banff, Canada, Oct. 2001.
10. T. S. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proc. IEEE INFOCOM, vol. 1, Jun. 2002, pp. 170-179.
11. C. Faloutsos, P. Faloutsos, and M. Faloutsos, "On power-law relationships of the internet topology," in Proc. ACM SIGCOMM, Aug. 1999, pp. 251-262.
12. R. Govindan and H. Tangmunarunkit, "Heuristics for Internet map discovery," in Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar. 2000, pp. 1371-1380.
13. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, "Distributed object location in a dynamic network," presented at the 14th Annu. ACM Symp. Parallel Algorithms and Architectures, Winnipeg, MB, Canada, Aug. 2002.
14. S. Iyer, A. Rowstron, and P. Druschel, "SQUIRREL: A decentralized peer-to-peer web cache:' in Proc. 21st ACM Symp. Principles of Distributed Computing (PODC'02), Monterey, CA, 2002, pp. 213-222.
15. K. Gummadi, R. Gummadi, S. Ratnasamy, S. Shenker, and I. Sotica, "The impact of DHT routing geometry on resilience and proximity," in Proc. ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, pp. 381-394.
16. D. R. Karger and M. Ruhl, "Finding nearest neighbors in growth-restricted metrics," in Proc. 34th ACM Symp. Theory of Computing (STOC'02), Montreal, QC, Canada, May 2002, pp. 741-750.
17. A. Keromytis, V. Misra, and D. Rubenstein, "SOS: Secure overlay services," in Proc. ACM SIGCOMM, Pittsburgh, PA, 2002, pp. 61-72.
18. 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," in Proc. 9th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Cambridge, MA, Nov. 2000, pp. 190-201.
19. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. 21st ACM Symp. Principles of Distributed Computing (PODC'02), Monterey, CA, 2002, pp.183-192.
20. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
21. V. N. Padmanabhan and L. Subramanian, "An investigation of geographic mapping techniques for Internet hosts," in Proc. ACM SIGCOMM, San Diego, CA, 2001, pp. 1-13.
22. A. Muthitacharoen, R. Morris, T. M. Gil, and B. Chen, "Ivy: A read/ write peer-to-peer file system," presented at the 5th Symp. Operating Systems Design and Implementation (OSDI'02), Boston, MA, Dec. 2002.
23. G. Phillips, S. Shenker, and H. Tangmunarunkit, "Scaling of multicast trees: Comments on the Chuang-Sirbu scaling law," in Proc. ACM SIGCOMM, 1999, pp. 41-51.
24. C. G. Plaxton, R. Rajaraman, and A. W Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. 9th Annu. ACM Symp. Parallel Algorithms and Architectures, Jun. 1997, pp. 311-320.
25. S. Ratnaswamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, Aug. 2001, pp. 161-172.
26. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically-aware overlay construction and server selection," in Proc. IEEE INFOCOM, 2002, pp. 1190-1199.
27. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Application-level multicast using content-addressable networks," Proc. 3rd Int. Workshop on Networked Group Communication (NGC '01, pp. 14-29, Nov. 2001.
28. S. Ratnasamy, S. Shenker, and I. Stoica, "Routing algorithms for DHTs: Some open questions," presented at the 1st Int. Workshop on Peer-to-Peer Systems (IPTPS'02), Cambridge, MA, Mar. 2002.
29. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," Univ. of California, Berkeley, CA, Tech. Rep. UCB// CSD-031299. Dec. 2003.
30. S. C. Rhea and J. Kubiatowicz, "Probabilistic location and routing," in Proc. IEEE INFOCOM, vol. 3, Jun. 2002, pp. 1248-1257.
31. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov. 2001, pp. 329-350.
32. A. Rowstron and P. Druschel, "Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility," presented at the ACM Symp. Operating Systems Principles (SOSP'01), Banff, Canada, Oct. 2001.
33. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 133-145.
34. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, "Internet indirection infrastructure," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 73-86.
35. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A peer-to-peer lookup service for Internet applications," presented at the ACM SIGCOMM, San Diego, CA, Sep. 2001.
36. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Network topology generators: Degree-based vs. structural," presented at the ACM SIGCOMM, Pittsburgh, PA, Aug. 2002.
37. M. Waldvogel and R. Rinaldi, "Efficient topology-aware overlay network," presented at the 1st Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ, Oct. 2002.
38. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-resilient wide-area location and routing," Univ. of California, Berkeley, Tech. Rep. UCB/CSD-01-1141, Apr. 2001.
39. A. Goel, R. Govindan, and H. Zhang. (2004) Improving lookup latency in distributed hash table systems using random sampling. Comput. Sci. Dept., Univ. of Southern California. [Online]. Available: http://ww.cs. usc.edu/Research/TechReports/04-825.zip
40. S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz, "Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination," in Proc. 11th Int. Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001), Port Jefferson, NY, Jun. 2001, pp. 124-133.
41. Chord Simulator. [Online]. Available: http://pdos.lcs.mit.edu/cgi-bin/ cvsweb.cgi/sfsnet/simulator