On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Topology inference from BGP routing dynamics
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the feasibility of commercial, legal P2P content distribution
ACM SIGCOMM Computer Communication Review
An analytical study of peer-to-peer media streaming systems
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
How DNS misnaming distorts internet topology mapping
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
INTERNET TOPOLOGY DISCOVERY: A SURVEY
IEEE Communications Surveys & Tutorials
Semi-distributed informed peer selection for scalable P2P overlay network
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
BiCo: Network operator-friendly P2P traffic control through bilateral cooperation with peers
Computer Networks: The International Journal of Computer and Telecommunications Networking
ISP-friendly P2P live streaming: A roadmap to realization
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on P2P Streaming
Peer-assisted network operator-friendly P2P traffic control technique
Proceedings of the 7th International Conference on Network and Services Management
| Hi-index | 0.00 |
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the cost on Internet Service Providers (ISPs) for carrying the P2P traffic. We study the following peer-matching problem: given a set of potential senders, find the best subset of them that will minimize the transit cost on ISPs. This problem is fairly general and the proposed algorithms for solving it can be used in many P2P systems. We propose two ISP-friendly algorithms for solving this problem: ISPF and ISPF-Lite. These two matching algorithms leverage public available information, such as BGP tables, to infer the network topology, and to minimize the cost on ISPs. The inference algorithms, however, are fairly complex, and we propose optimization techniques to reduce the inference time and to lower the memory requirement. We use trace-driven simulations to show that the proposed algorithms outperform other popular matching algorithms by a large margin. Between the two proposed algorithms, ISPF results in better matching, but incurs higher complexity. Hence, we recommend ISPF if resources are not stringent, otherwise ISPF-Lite is recommended.