On the benefits of cooperative proxy caching for peer-to-peer traffic

Mohamed Hefeeda, Behrooz Noorizadeh

Research output: Contribution to journalArticle

34 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 (ASs), 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 traffic traces for multiple caches. Then, we perform extensive trace-based simulations to analyze different angles of cooperative caching schemes. Our results demonstrate that: 1) significant improvement in byte hit rate can be achieved using cooperative caching, 2) simple object replacement policies are sufficient to achieve that gain, and 3) the overhead imposed by cooperative caching is negligible. In addition, we develop an analytic model to assess the gain from cooperative caching in different settings. The model accounts for number of caches, salient P2P traffic features, and network characteristics. Our model confirms that substantial gains from cooperative caching are attainable under wide ranges of traffic and network characteristics.

Original languageEnglish
Article number5204077
Pages (from-to)998-1010
Number of pages13
JournalIEEE Transactions on Parallel and Distributed Systems
Volume21
Issue number7
DOIs
Publication statusPublished - 29 Mar 2010
Externally publishedYes

Fingerprint

Internet service providers

Keywords

  • Caching
  • Cooperative caching
  • Peer-to-peer systems
  • Traffic modeling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this

On the benefits of cooperative proxy caching for peer-to-peer traffic. / Hefeeda, Mohamed; Noorizadeh, Behrooz.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 7, 5204077, 29.03.2010, p. 998-1010.

Research output: Contribution to journalArticle

Hefeeda, Mohamed ; Noorizadeh, Behrooz. / On the benefits of cooperative proxy caching for peer-to-peer traffic. In: IEEE Transactions on Parallel and Distributed Systems. 2010 ; Vol. 21, No. 7. pp. 998-1010.
@article{4d27e198e21945f790fe5aa7265f6795,
title = "On the benefits of cooperative proxy caching for peer-to-peer 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 (ASs), 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 traffic traces for multiple caches. Then, we perform extensive trace-based simulations to analyze different angles of cooperative caching schemes. Our results demonstrate that: 1) significant improvement in byte hit rate can be achieved using cooperative caching, 2) simple object replacement policies are sufficient to achieve that gain, and 3) the overhead imposed by cooperative caching is negligible. In addition, we develop an analytic model to assess the gain from cooperative caching in different settings. The model accounts for number of caches, salient P2P traffic features, and network characteristics. Our model confirms that substantial gains from cooperative caching are attainable under wide ranges of traffic and network characteristics.",
keywords = "Caching, Cooperative caching, Peer-to-peer systems, Traffic modeling",
author = "Mohamed Hefeeda and Behrooz Noorizadeh",
year = "2010",
month = "3",
day = "29",
doi = "10.1109/TPDS.2009.130",
language = "English",
volume = "21",
pages = "998--1010",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "7",

}

TY - JOUR

T1 - On the benefits of cooperative proxy caching for peer-to-peer traffic

AU - Hefeeda, Mohamed

AU - Noorizadeh, Behrooz

PY - 2010/3/29

Y1 - 2010/3/29

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 (ASs), 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 traffic traces for multiple caches. Then, we perform extensive trace-based simulations to analyze different angles of cooperative caching schemes. Our results demonstrate that: 1) significant improvement in byte hit rate can be achieved using cooperative caching, 2) simple object replacement policies are sufficient to achieve that gain, and 3) the overhead imposed by cooperative caching is negligible. In addition, we develop an analytic model to assess the gain from cooperative caching in different settings. The model accounts for number of caches, salient P2P traffic features, and network characteristics. Our model confirms that substantial gains from cooperative caching are attainable under wide ranges of traffic and network characteristics.

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 (ASs), 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 traffic traces for multiple caches. Then, we perform extensive trace-based simulations to analyze different angles of cooperative caching schemes. Our results demonstrate that: 1) significant improvement in byte hit rate can be achieved using cooperative caching, 2) simple object replacement policies are sufficient to achieve that gain, and 3) the overhead imposed by cooperative caching is negligible. In addition, we develop an analytic model to assess the gain from cooperative caching in different settings. The model accounts for number of caches, salient P2P traffic features, and network characteristics. Our model confirms that substantial gains from cooperative caching are attainable under wide ranges of traffic and network characteristics.

KW - Caching

KW - Cooperative caching

KW - Peer-to-peer systems

KW - Traffic modeling

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

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

U2 - 10.1109/TPDS.2009.130

DO - 10.1109/TPDS.2009.130

M3 - Article

AN - SCOPUS:77953122863

VL - 21

SP - 998

EP - 1010

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 7

M1 - 5204077

ER -