loading...
Cache replacement policies revisited: the case of P2P traffic
Chicago, IL, USA April 19-April 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGrid.2004.1336565Fourth IEEE International Symposium o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A. Wierzbicki, Polish-Japanese Inst. of Inf. Technol., Poland
N. Leibowitz, La Trobe Univ., Bundoora, Vic., Australia
M. Ripeanu, Sch. of Telecommun. Eng., Valladolid Univ., Spain
R. Wozniak, Sch. of Telecommun. Eng., Valladolid Univ., Spain
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.
Citation:
A. Wierzbicki, N. Leibowitz, M. Ripeanu, R. Wozniak, "Cache replacement policies revisited: the case of P2P traffic," ccgrid, pp.182-189, Fourth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.