ISP-friendly peer matching without ISP collaboration

Cheng Hsin Hsu, Mohamed Hefeeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08
DOIs
Publication statusPublished - 1 Dec 2008
Externally publishedYes
Event2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08 - Madrid, Spain
Duration: 9 Dec 200812 Dec 2008

Other

Other2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08
CountrySpain
CityMadrid
Period9/12/0812/12/08

Fingerprint

Internet service providers
Costs
Topology
Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Hsu, C. H., & Hefeeda, M. (2008). ISP-friendly peer matching without ISP collaboration. In Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08 [75] https://doi.org/10.1145/1544012.1544087

ISP-friendly peer matching without ISP collaboration. / Hsu, Cheng Hsin; Hefeeda, Mohamed.

Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08. 2008. 75.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hsu, CH & Hefeeda, M 2008, ISP-friendly peer matching without ISP collaboration. in Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08., 75, 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08, Madrid, Spain, 9/12/08. https://doi.org/10.1145/1544012.1544087
Hsu CH, Hefeeda M. ISP-friendly peer matching without ISP collaboration. In Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08. 2008. 75 https://doi.org/10.1145/1544012.1544087
Hsu, Cheng Hsin ; Hefeeda, Mohamed. / ISP-friendly peer matching without ISP collaboration. Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08. 2008.
@inproceedings{2d2abacaa57741eab3b06e81d8473936,
title = "ISP-friendly peer matching without ISP collaboration",
abstract = "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.",
author = "Hsu, {Cheng Hsin} and Mohamed Hefeeda",
year = "2008",
month = "12",
day = "1",
doi = "10.1145/1544012.1544087",
language = "English",
isbn = "9781605582108",
booktitle = "Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08",

}

TY - GEN

T1 - ISP-friendly peer matching without ISP collaboration

AU - Hsu, Cheng Hsin

AU - Hefeeda, Mohamed

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70350764019&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350764019&partnerID=8YFLogxK

U2 - 10.1145/1544012.1544087

DO - 10.1145/1544012.1544087

M3 - Conference contribution

SN - 9781605582108

BT - Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08

ER -