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
Passive estimation of TCP round-trip times
ACM SIGCOMM Computer Communication Review
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
Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing
IEEE Transactions on Parallel and Distributed Systems
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
Towards Location-aware Topology in both Unstructured and Structured P2P Systems
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Building a Scalable Bipartite P2P Overlay Network
IEEE Transactions on Parallel and Distributed Systems
The design of secure and efficient P2PSIP communication systems
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
| Hi-index | 0.01 |
The Peer-to-Peer (P2P) technology has many potential advantages, including high scalability and cost-effectiveness. However, most P2P system performance suffers from the mismatch between the overlays topology and the underlying physical network topology, causing a large volume of redundant traffic in the Internet. A lot of research works have been presented to address this issue, but most results still have some drawbacks. In this paper, we propose a quite simple but efficient topology matching technique, T2MC, which uses the peers' Traceroute result to execute 2-Means Classification, thereafter lets peers to build efficient "close" cluster. By performing experiments using the measured realistic Internet data of China, we show that T2MC outperforms the well-known GNP in both aspects of accuracy and maintenance cost.