Cache replacement policies revisited: the case of P2P traffic

  • Authors:
  • A. Wierzbicki;N. Leibowitz;M. Ripeanu;R. Wozniak

  • Affiliations:
  • Polish-Japanese Inst. of Inf. Technol., Poland;La Trobe Univ., Bundoora, Vic., Australia;Sch. of Telecommun. Eng., Valladolid Univ., Spain;Sch. of Telecommun. Eng., Valladolid Univ., Spain

  • Venue:
  • CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Peer-to-peer (P2P) file-sharing applications generate a large part if not most of today's Internet traffic. The large volume of this traffic (thus the high potential benefits of caching) and the large cache sizes required (thus nontrivial costs associated with caching) only underline that efficient cache replacement policies are important in this case. P2P file-sharing traffic has several characteristics that distinguish it from well studied Web traffic and that require a focused study of efficient cache management policies. This paper uses trace driven simulations to compare traditional cache replacement policies with new policies that try to exploit characteristics of the P2P file-sharing traffic generated by applications using the FastTrack protocol.