We consider a public content caching system that is shared by a number of proxies. The cache could be located in an edge-cloud datacenter and the the proxies could each serve a large population of mobile end-users. The proxies operate their own LRU-list of a certain capacity in the shared cache. The length of objects appearing in plural LRU-lists is divided among them . We provide a " working set " approximation to quickly approximate the cache-hit probabilities under object sharing. We also discuss an approach to sharing cache I/O based on token bucket mechanisms .Also, why and how a proxy may issue mock requests to exploit the shared cache is discussed .
We consider a content-caching system thatis shared by a number of proxies. The cache could belocated in an edge-cloud datacenter and the proxies couldeach serve a large population of mobile end-users. Eachproxy operates its own LRU-list of a certain capacity inthe shared cache. The length of objects simultaneouslyappearing in plural LRU-lists is equally divided amongthem,i.e., object sharing among the LRUs . We provide a " working-set " approximation for this system to quicklyestimate the cache-hit probabilities under such objectsharing, which can be used to facilitate admission control .Also, a way to reduce ripple evictions,i.e.,setrequestoverhead, is suggested. We give numerical results for ourMemCacheD with Object Sharing (MCD-OS) prototype .
R
public content caching system that is
content-caching system thatis
R
be located
belocated
R
the proxies could each
proxies couldeach
R
The proxies operate their
Eachproxy operates its
R
in the
inthe
R
appearing
simultaneouslyappearing
R
divided among them
equally divided amongthem,i.e., object sharing among the LRUs
R
working set
working-set
R
to quickly approximate
for this system to quicklyestimate
R
object sharing. We also discuss an approach to sharing cache I/O based on token bucket mechanisms
such objectsharing, which can be used to facilitate admission control
R
why and how a proxy may issue mock requests to exploit the shared cache is discussed
a way to reduce ripple evictions,i.e.,setrequestoverhead, is suggested. We give numerical results for ourMemCacheD with Object Sharing (MCD-OS) prototype