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
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
BYPASS: Topology-Aware Lookup Overlay for DHT-based P2P File Locating Services
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
P^22P - Prepaid Peer-to-Peer Services
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Plethora: an efficient wide-area storage system
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 0.01 |
Despite various hurdles, as copyright issues and security concerns, peer-to-peer (P2P) networks and systems still grow and gain in popularity, and the research community continues to develop interesting applications of P2P technology, together with new platforms for application development. Because the overall performance of these platforms and applications also depends on the performance of the background routing protocol, new systems are mostly based on distributed hash tables (DHT), which are algorithms that provide efficient mechanisms for resource location. However, DHTs assume the system is uniform in available resources and that every node participating in the DHT is within the same transport domain. A number of earlier works has gone on topology-awareness, as a possibility to improve the system's lookup performance. In this paper, we go on to a configurable context-aware system and propose CAP, a novel scheme, which promises contextual data retrieval, alleviated message latency, and enhanced lookup time.