K. Gummadi
S. Ratnasamy
S. Shenker
I. Stoica
ABSTRACT
The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly networks. In this paper we focus on how these basic geometric approaches affect the resilience and proximity properties of DHTs. One factor that distinguishes these geometries is the degree of flexibility they provide in the selection of neighbors and routes. Flexibility is an important factor in achieving good static resilience and effective proximity neighbor and route selection. Our basic finding is that, despite our initial preference for more complex geometries, the ring geometry allows the greatest flexibility, and hence achieves the best resilience and proximity performance.
- M. Castro, M. Jones, Anne-Marie Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman. An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays. In Proceedings of the INFOCOM 2003, San Francisco, April 2003.Google Scholar
Cross Ref
- Miguel Castro, Peter Drushel, Y.C. Hu, and Antony Rowstron. Exploiting Network Proximity in Peer-to-peer Networks. Technical Report MSR-TR-2002-82, Microsoft Research, 2002.Google Scholar
- Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Lake Louise, AB, Canada, October 2001. Google ScholarDigital Library
- Peter Druschel and Antony Rowstron. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Lake Louise, AB, Canada, October 2001. Google ScholarDigital Library
- IRIS: Infrastructure for Resilient Internet Systems. http://iris.lcs.mit.edu, May 2002.Google Scholar
- David Karger Frans Kaashoek. Simple Constant-Space Distributed Hash Tables. In Proceedings of the IPTPS 2003, Berkeley, February 2003.Google Scholar
- Anjali Gupta, Barbara Liskov, and Rodrigo Rodrigues. One Hop Lookups for Peer-to-Peer Overlays. In Proceedings of the HotOS-IX 2003, Hawaii, May 2003. Google ScholarDigital Library
- Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, and Ben Y. Zhao. Distributed Object Location in a Dynamic Environment. In Proceedings of the ACM SPAA, 2002. Google ScholarDigital Library
- Sushant Jain, Ratul Mahajan, and David Wetherall. A Study of Performance Potential of DHT-based Overlays. In Proceedings of the 4th Usenix Symposium on Internet Technologies and Systems (USITS), Seattle, WA, USA, March 2003. Google ScholarDigital Library
- David R. Karger and Matthias Ruhl. Finding Nearest Neighbours in Growth-restricted Metrics. In Proceedings of the ACM STOC, Montreal, May 2002. Google ScholarDigital Library
- J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the ACM STOC 2000, 2000. Google ScholarDigital Library
- John Kubiatowicz. Oceanstore: An Architecture for Global-Scalable Persistent Storage. In Proceedings of the ASPLOS 2000, Cambridge, MA, USA, November 2000. Google ScholarDigital Library
- Dmitri Loguinov, Anuj Kumar, Vivek Rai, and Sai Ganesh. Graph-Theoretic Analysis of Structured Peer-to-Peer Systems; Routing Distances and Fault Resilience. In Proceedings of the ACM SIGCOMM '03 Conference, Karlsruhe, Germany, August 2003. Google ScholarDigital Library
- Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy: A Scalable Dynamic Emulation of the Butterfly. In Proceedings of the PODC, 2002. Google ScholarDigital Library
- Petar Maymounkov and David Mazieres. Kademlia: A Peer-to-peer Information Systems Based on the XOR Metric.In Proceedings of the IPTPS 2002, Boston, March 2002. Google ScholarDigital Library
- C. Greg Plaxton, Rajmohan Rajaraman, and Andrea W. Richa. Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In Proceedings of the ACM SPAA, June 1997. Google ScholarDigital Library
- CAIDA: The Skitter Measurement Project. www.caida.org/tools/measurement/skitter/index.html, 2002.Google Scholar
- Sylvia Ratnasamy. A Scalable Content-Addressable Network. PhD thesis, University of California, Berkeley, October 2002. Google ScholarDigital Library
- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001. Google ScholarDigital Library
- Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker. Application-level Multicast using Content-Addressable Networks. In Proceedings of the NGC 2001, 2001. Google ScholarDigital Library
- Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker. Topologically-Aware Overlay Construction and Server Selection. In Proceedings of the INFOCOMM, 2002.Google Scholar
- Antony Rowstron and Peter 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), pages 329--350, November 2001. Google ScholarDigital Library
- Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A Measurement Study of Peer-to-peer File Sharing Systems. In Proceedings of the Multimedia Computing and Networking Conference (MMCN), San Jose, CA, USA, January 2002.Google Scholar
- John Kubiatowicz Sean Rhea, Timothy Roscoe. DHTs Need Application-Driven Benchmarks. In Proceedings of the IPTPS 2003, Berkeley, February 2003.Google Scholar
- Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of the ACM SIGCOMM 2001, San Diego, CA, USA, August 2001. Google ScholarDigital Library
- Marcel Waldvogel and Roberto Renaldi. Efficient Topology-Aware Overlay Network. In Proceedings of the HotNets-I 2002, Princeton, October 2002.Google Scholar
- Ben Y. Zhao, Anthony Joseph, and John D. Kubiatowicz. Locality Aware Mechanisms for Large-scale Networks. In Proceedings of the FuDiCo 02, Bertinoro, Italy, June 2002.Google Scholar
- B.Y. Zhao, K.D. Kubiatowicz, and A.D. Joseph. Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing. Technical Report UCB//CSD-01-1141, University of California at Berkeley, April 2001. Google ScholarDigital Library
- Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, and John Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In Proceedings of the NOSSDAV 2001, 2001. Google ScholarDigital Library
Index Terms
- The impact of DHT routing geometry on resilience and proximity
Recommendations
Building a Low-latency, Proximity-aware DHT-Based P2P Network
KSE '09: Proceedings of the 2009 International Conference on Knowledge and Systems EngineeringDHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for Chord, which is a typical DHT-based P2P network protocol. We propose a simple ...
The Security Routing Based on Convergence Detected about Route in DHT
NCIS '11: Proceedings of the 2011 International Conference on Network Computing and Information Security - Volume 01In order to reduce the harm of malicious nodes to the DHT network, the paper makes analysis about the DHT routing algorithm, we get the iteration function of routing on DHT. Through the analysis on iterative routing functions, we summarize the common ...
Symmetric routing in DHT overlays
In this paper, we propose to extend the DHT topology to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable search support. We consider routing algorithms for a bidirectional variant of the DHT network and show how the ...
Comments