Performance evaluation of the random replacement policy for networks of caches

Performance Evaluation Review

Volumn 40, Issue 1 SPEC. ISS., 2012, Pages 395-396

  Gallo, Massimo ^a   Kauffmann, Bruno ^a   Muscariello, Luca ^a   Simonian, Alain ^a   Tanguy, Christian ^a  

^a ORANGE LABS   (France)

Author keywords

asymptotic analysis; cache replacement policies; content distribution networks; information centric networking

Indexed keywords

CACHE NETWORKS; CACHE REPLACEMENT POLICY; CACHE SIZE; CONTENT DISTRIBUTION NETWORKS; DECAY EXPONENTS; HOMOGENEOUS TREE; INFORMATION-CENTRIC NETWORKING; PERFORMANCE EVALUATION; PERFORMANCE ISSUES; POPULARITY DISTRIBUTION; POWER-LAW; REPLACEMENT POLICY;

ASYMPTOTIC ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; NETWORK ARCHITECTURE;

JOINT PROSTHESES;

EID: 84864650706     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2254756.2254810     Document Type: Conference Paper

References (4)

1. G. Carofiglio, M. Gallo, L. Muscariello, and D. Perino. Modeling data transfer in content-centric networking. In Proc. of ITC23, 2011.
2. M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian, and C. Tanguy. Performance evaluation of the random replacement policy for networks of caches (14 pages version). http://arxiv.org/abs/1202.4880, 2012.
3. E. Gelenbe. A unified approach to the evaluation of a class of replacement algorithms. IEEE Transactions on Computer, 22(6):611-618, 1973.
4. P. R. Jelenković and X. Kang. Characterizing the miss sequence of the LRU cache. ACM SIGMETRICS Performance Evaluation Review, 36:119-121, August 2008.