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
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
HiScamp: self-organizing hierarchical membership protocol
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Hi-index | 0.00 |
Most of current structured P2P systems exploit Distributed Hash Table (DHT) to archive an administration-free, fault tolerant overlay network and guarantee to deliver a message to its destination within O(logN) hops. While elegant from a theoretical perspective, those systems face difficulties in a realistic environment. Instead of building P2P overlays from a theoretical perspective, this design tries to construct an overlay from the physical network. By combining different network topology aware techniques, a distinctive overlay structure closely matching the Internet topology is created. The P2P overlay based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment.