The impact of DHT routing geometry on resilience and proximity

  title={The impact of DHT routing geometry on resilience and proximity},
  author={K. Gummadi and R. Gummadi and S. Gribble and S. Ratnasamy and S. Shenker and I. Stoica},
  booktitle={SIGCOMM '03},
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… Expand
Proximity Neighbor Selection in Structured P2P Network
RASTER: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systems
Shortest-path routing in randomized DHT-based Peer-to-Peer systems
A small-world DHT built on generalized network coordinates
DHT routing analysis in a logarithmically transformed space
Detouring Skip Graph: Efficient Routing via Detour Routes on Skip Graph Topology
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience


Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Pastry: Scalable, distributed object location and routing for large-scale peer-to-
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Exploiting Network Proximity in Peer-to-peer Networks
  • Technical Report MSR-TR-2002-82, Microsoft Research,
  • 2002
Distributed Object Location in a Dynamic Environment
  • In Proceedings of the ACM SPAA,
  • 2002
Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing
  • Technical Report UCB//CSD-01-1141,
  • 2001