TY - GEN
T1 - Cooperative caching
T2 - 33rd IEEE Conference on Local Computer Networks, LCN 2008
AU - Hefeeda, Mohamed
AU - Noorizadeh, Behrooz
PY - 2008
Y1 - 2008
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 - https://www.scopus.com/pages/publications/58049102901
U2 - 10.1109/LCN.2008.4664146
DO - 10.1109/LCN.2008.4664146
M3 - Conference contribution
AN - SCOPUS:58049102901
SN - 9781424424139
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 12
EP - 19
BT - 33rd IEEE Conference on Local Computer Networks, LCN 2008
Y2 - 14 October 2008 through 17 October 2008
ER -