Flexible Content Placement in Cache Networks using Reinforced Counters
Networking and Internet Architecture
2015-03-19 v2
Abstract
In this paper we study the problem of content placement in a cache network. We consider a network where routing of requests is based on random walks. Content placement is done using a novel mechanism referred to as reinforced counters. To each content we associate a counter, which is incremented every time the content is requested, and which is decremented at a fixed rate. We model and analyze this mechanism, tuning its parameters so as to achieve desired performance goals for a single cache or for a cache network. We also show that the optimal static content placement, without reinforced counters, is NP hard under different design goals.
Cite
@article{arxiv.1501.03446,
title = {Flexible Content Placement in Cache Networks using Reinforced Counters},
author = {Guilherme Domingues and Edmundo de Souza e Silva and Rosa M. M. Leao and Daniel S. Menasche},
journal= {arXiv preprint arXiv:1501.03446},
year = {2015}
}
Comments
Submitted to 33rd Brazilian Symposium on Computer Networks and Distributed Systems, SBRC' 2015