STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Towards global network positioning
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
ICDCSW '05 Proceedings of the First International Workshop on Mobility in Peer-to-Peer Systems - Volume 08
Overlay Weaver: An overlay construction toolkit
Computer Communications
| Hi-index | 0.00 |
Structured peer-to-peer overlay networks such as Chord, CAN, Tapestry, and Pastry, operate as distributed hash tables (DHTs). However, since every node is assigned a unique identifier in the basic design of DHT (randomly hashed), "locality-awareness" is not inherent due to the topology mismatching between the P2P overlay network and the physical underlying network. In this paper, we propose to incorporate physical locality into a Chord system. To potentially benefit from some level of knowledge about the relative proximity between peers, a network positioning model is necessary for capturing physical location information of network nodes. Thus, we incorporate GNP (Global Network Positioning) into Chord (Chord-GNP) since peers can easily maintain geometric coordinates that characterize their locations in the Internet. Next, we identify and explore three factors affecting Chord-GNP performance: distance between peers, message timeout calculation and lookup latency. The measured results show that Chord-GNP efficiently locates the nearest available node providing a locality property. In addition, both the number of the messages necessary to maintain routing information and the time taken to retrieve data in Chord-GNP is less than that in Chord.