@inbook{e5c16d6d92024b3f9ae95970eca151f9,
title = "A cluster caching rule in next generation networks",
abstract = "Probabilistic aspects of caching are considered. The caching serves to keep popular contents inside a memory unit called {\textquoteleft}cache{\textquoteright} to be able to access them quickly. Using extreme value theory we propose a caching strategy called Cluster Caching Rule driven by content popularity that may change in time. A non-Poisson request arrival process is used when requests are statistically correlated. The idea of the new approach is to locate in cache only contents whose popularity exceeds a sufficiently large threshold. Due to dependence and possible heavy-tailed distribution of inter-requests and inter-arrival times of documents, the popularity process builds clusters of exceedances. The cluster and intercluster sizes are geometrically distributed as derived in Markovich (2014). We use it to calculate means of the cache utilization and occupancy. We escape assumptions like a constant size of content and a Poisson request process that are typical in the literature.",
keywords = "Cache occupancy, Cache utilization, Caching, Cluster of exceedances, Content, Popularity process",
author = "N. Markovich",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.",
year = "2016",
month = mar,
day = "1",
doi = "10.1007/978-3-319-30843-2\_32",
language = "English",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "305--313",
booktitle = "Communications in Computer and Information Science",
address = "Germany",
}