Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
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
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Hi-index | 0.00 |
In many P2P systems, the path between any two nodes is mainly decided by their topology of overlay network instead of physical one. However, peers are scattered in distributed geography, requests may route across different Autonomous Systems (AS) . So, the inconsistency between overlay network and physical one can not ensure the routing efficiency in the real world. We introduce DAPS (Delay Aware P2P System), a new P2P overlay network that considers both overlay and physical networks. DAPS adopt end-to-end delay as the performance metrics and use “pruning flooding” to achieve efficient routing.