Improving lookup performance over a widely-deployed DHT

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Stutzbach, Daniel ^a   Rejaie, Reza ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE OF REPLICATION; DISTRIBUTED HASH TABLES;

COMPUTER SIMULATION; ROUTING ALGORITHMS; USER INTERFACES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38049024292     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.329     Document Type: Conference Paper

References (29)

1. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications," IEEE/ACM Transactions on Networking, 2002.
2. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in SIGCOMM, 2001.
3. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov. 2001, pp. 329-350.
4. P. Maymounkov and D. Mazieres, "Kademlia: A Peer-to-peer Information System Based on the XOR Metric," in International Workshop on Peer-to-Peer Systems, 2002.
5. J. Li, J. Stribling, R. Morris, and M. F. Kaashoek, "Bandwidth- efficient Management of DHT Routing Tables," in Networked Systems Design and Implementation, Boston, MA, May 2005.
6. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," in SIGCOMM, Karlsruhe, Germany, Aug. 2003.
7. J. Li, J. Stribling, F. Kaashoek, R. Morris, and T. Gil, "A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn," in INFOCOM, Miami, FL, Mar. 2005.
8. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," in SOSP, Banff, AB, Canada, Oct. 2001.
9. V. Ramasubramanian and E. G. Sirer, "The Design and Implementation of a Next Generation Name Service for the Internet," in SIGCOMM, Portland, OR, 2004.
10. S. Rhea, D. Geels, and J. Kubiatowicz, "Handling Churn in a DHT," in USENIX, 2004, pp. 127-140.
11. S. S. Lam and H. Liu, "Failure Recovery for Structured P2P Networks: Protocol Design and Performance Evaluation," in SIGMETRICS, New York, NY, June 2004.
12. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 41-53, Jan. 2004.
13. B. Leong, B. Liskov, and E. D. Demaine, "EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management," in nternational Conference on Networks, Nov. 2004.
14. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris, "Designing a DHT for Low Latency and High Throughput," in NSDI, Berkeley, CA, 2004.
15. D. D. Clark, "Design Philosophy of the DARPA Internet Protocols," ACM SIGCOMM Computer Communication Review, vol. 25, no. 1, Jan. 1995.
16. D. Stutzbach and R. Rejaie, "Capturing Accurate Snapshots of the Gnutella Network," in Global Internet Symposium, Miami, FL, Mar. 2005, pp. 127-132.
17. D. Stutzbach, "Csearch::jumpstart() Deletes Wrong Contacts," http://forum.emule-project.net/index.php?showtopic=81094, June 2005.
18. _, "Kad Lookups Start In Wrong Place," http://forum.emule- project.net/index.php?showtopic=81113, June 2005.
19. _, "M best Not Initialized And Updated Properly," http://forum.emule-project.net/index.php?showtopic=81020, June 2005.
20. S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi, "A Statistical Theory of Chord under Churn," in International Workshop on Peer-to-Peer Systems (IPTPS), Ithaca, NY, Feb. 2005.
21. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of Peer-to-Peer Systems," in Principles of Distributed Computing, Monterey, CA, July 2002.
22. J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek, "Comparing the performance of distributed hash tables under churn," in International Workshop on Peer-to-Peer Systems, 2004.
23. R. Mahajan, M. Castro, and A. Rowstron, "Controlling the Cost of Reliability in Peer-to-Peer Overlays," in International Workshop on Peer-to-Peer Systems, 2003.
24. S. Sen and J. Wang, "Analyzing Peer-To-Peer Traffic Across Large Networks," IEEE/ACM Transactions on Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.
25. K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan, "Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload," in SOSP, 2003.
26. J. Pouwelse, P. Garbacki, D. Epema, and H. Sips, "The Bittorrent P2P File-sharing System: Measurements and Analysis," in International Workshop on Peer-to-Peer Systems (IPTPS), Ithaca, NY, Feb. 2005.
27. M. Izal, G. Urvoy-Keller, E. W. Biersack, P. A. Felber, A. A. Hamra, and L. Garces-Erice, "Dissecting BitTorrent: Five Months in a Torrent's Lifetime," in PAM, Apr. 2004.
28. J. Chu, K. Labonte, and B. N. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," in ITCom: Scalability and Traffic Control in IP Networks II Conferences, July 2002.
29. D. Stutzbach and R. Rejaie, "Characterizing Churn in Peer-to-Peer Networks," University of Oregon, Eugene, OR, Tech. Rep. CIS-TR-2005- 03, May 2005.