Enhancing Locality in Structured Peer-to-Peer Networks

  • Authors:
  • Ronaldo A. Ferreira;Suresh Jagannathan;Ananth Grama

  • Affiliations:
  • Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN

  • Venue:
  • ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed hash tables (DHTs), used in a numberof structured peer-to-peer systems, provide efficientmechanisms for resource location. A key distinguishingfeature of current DHT systems such as Chord, Pastry,and Tapestry is the way they handle locality in the underlyingnetwork. Topology-based node identifier assignment,proximity routing, and proximity neighbor selectionare examples of heuristics used to minimize message delaysin the underlying network. While these heuristicsare sometimes effective, they rely on a single global overlaythat may install the key of a popular object at anode far from most of the nodes accessing it. Furthermore,a response to a lookup does not contain any localityinformation about the nodes holding a copy of the object.We address these issues by proposing a novel two-leveloverlay peer-to-peer architecture. In our architecture, localoverlays act as locality-aware caches for the globaloverlay, grouping nodes close together in the underlyingnetwork. Local overlays are constructed by exploitingthe structure of the Internet as Autonomous Systems.We present detailed experimental results demonstratingthe practicality of the system, and showing performancegains in response time of up to 60% comparedto a single global overlay with state-of-the-art localizationschemes. We also present efficient distributed algorithmsfor maintaining local overlays in the presence ofnode arrivals and departures.