Cooperative caching

The case for P2P traffic

Mohamed Hefeeda, Behrooz Noorizadeh

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

6 Citations (Scopus)

Abstract

This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet service providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASes), while the second considers cooperation among caches deployed within the same AS. We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect actual traffic traces for multiple caches. Then, we perform an extensive trace-based simulation study to analyze different angles of cooperative caching schemes. Our results demonstrate that: (i) significant improvement in byte hit rate can be achieved using cooperative caching, (ii) simple object replacement policies are sufficient to achieve that gain, and (iii) the overhead imposed by cooperative caching is negligible.

Original languageEnglish
Title of host publicationProceedings - Conference on Local Computer Networks, LCN
Pages12-19
Number of pages8
DOIs
Publication statusPublished - 31 Dec 2008
Externally publishedYes
Event33rd IEEE Conference on Local Computer Networks, LCN 2008 - Montreal, AB, Canada
Duration: 14 Oct 200817 Oct 2008

Other

Other33rd IEEE Conference on Local Computer Networks, LCN 2008
CountryCanada
CityMontreal, AB
Period14/10/0817/10/08

Fingerprint

Internet service providers

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Hefeeda, M., & Noorizadeh, B. (2008). Cooperative caching: The case for P2P traffic. In Proceedings - Conference on Local Computer Networks, LCN (pp. 12-19). [4664146] https://doi.org/10.1109/LCN.2008.4664146

Cooperative caching : The case for P2P traffic. / Hefeeda, Mohamed; Noorizadeh, Behrooz.

Proceedings - Conference on Local Computer Networks, LCN. 2008. p. 12-19 4664146.

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

Hefeeda, M & Noorizadeh, B 2008, Cooperative caching: The case for P2P traffic. in Proceedings - Conference on Local Computer Networks, LCN., 4664146, pp. 12-19, 33rd IEEE Conference on Local Computer Networks, LCN 2008, Montreal, AB, Canada, 14/10/08. https://doi.org/10.1109/LCN.2008.4664146
Hefeeda M, Noorizadeh B. Cooperative caching: The case for P2P traffic. In Proceedings - Conference on Local Computer Networks, LCN. 2008. p. 12-19. 4664146 https://doi.org/10.1109/LCN.2008.4664146
Hefeeda, Mohamed ; Noorizadeh, Behrooz. / Cooperative caching : The case for P2P traffic. Proceedings - Conference on Local Computer Networks, LCN. 2008. pp. 12-19
@inproceedings{b7fc38c7c3864821b73ceff14bef44f9,
title = "Cooperative caching: The case for P2P traffic",
abstract = "This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet service providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASes), while the second considers cooperation among caches deployed within the same AS. We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect actual traffic traces for multiple caches. Then, we perform an extensive trace-based simulation study to analyze different angles of cooperative caching schemes. Our results demonstrate that: (i) significant improvement in byte hit rate can be achieved using cooperative caching, (ii) simple object replacement policies are sufficient to achieve that gain, and (iii) the overhead imposed by cooperative caching is negligible.",
author = "Mohamed Hefeeda and Behrooz Noorizadeh",
year = "2008",
month = "12",
day = "31",
doi = "10.1109/LCN.2008.4664146",
language = "English",
isbn = "9781424424139",
pages = "12--19",
booktitle = "Proceedings - Conference on Local Computer Networks, LCN",

}

TY - GEN

T1 - Cooperative caching

T2 - The case for P2P traffic

AU - Hefeeda, Mohamed

AU - Noorizadeh, Behrooz

PY - 2008/12/31

Y1 - 2008/12/31

N2 - This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet service providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASes), while the second considers cooperation among caches deployed within the same AS. We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect actual traffic traces for multiple caches. Then, we perform an extensive trace-based simulation study to analyze different angles of cooperative caching schemes. Our results demonstrate that: (i) significant improvement in byte hit rate can be achieved using cooperative caching, (ii) simple object replacement policies are sufficient to achieve that gain, and (iii) the overhead imposed by cooperative caching is negligible.

AB - This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet service providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASes), while the second considers cooperation among caches deployed within the same AS. We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect actual traffic traces for multiple caches. Then, we perform an extensive trace-based simulation study to analyze different angles of cooperative caching schemes. Our results demonstrate that: (i) significant improvement in byte hit rate can be achieved using cooperative caching, (ii) simple object replacement policies are sufficient to achieve that gain, and (iii) the overhead imposed by cooperative caching is negligible.

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

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

U2 - 10.1109/LCN.2008.4664146

DO - 10.1109/LCN.2008.4664146

M3 - Conference contribution

SN - 9781424424139

SP - 12

EP - 19

BT - Proceedings - Conference on Local Computer Networks, LCN

ER -