Locality in structured peer-to-peer networks

13 years 6 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is the way they handle locality in the underlying network. Topology-based node identifier assignment, proximity routing, and proximity neighbor selection are examples of heuristics used to minimize message delays in the underlying network. While these heuristics are sometimes effective, they all rely on a single global overlay that may install the key of a popular object at a node far from most of the nodes accessing it. Furthermore, a response to a lookup message does not contain any locality information about the nodes holding a copy of the object. We address these issues in Plethora, a novel two-level overlay P2P network. A local overlay in Plethora acts as a locality-aware cache for the global overlay, grouping nodes close together in ...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JPDC
Authors Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama
Comments (0)