Temporal locality in today's content caching

Traverso, Stefano; Ahmed, Mohamed; Garetto, Michele; Giaccone, Paolo; Leonardi, E.; Niccolini, Saverio

doi:10.1145/2541468.2541470

Cited by 196 publications

(211 citation statements)

References 33 publications

Supporting

Mentioning

198

Contrasting

Order By: Relevance

“…A key point in our approach is that we consider the probability that a document receives a given number of requests, rather than the probability that a request is directed to a given document. This representation is consistent with recently developed caching models [17,21,6]. Moreover, it allows us to avoid the fitting of a rank-frequency plot, which is in essence an order statistic and exhibits over-fitting.…”

Section: Summary Of Resultssupporting

confidence: 82%

See 1 more Smart Citation

An Inverse Problem Approach for Content Popularity Estimation

Olmos¹,

Kauffmann²

2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

The Internet increasingly focuses on content, as exemplified by the now popular Information Centric Networking paradigm. This means, in particular, that estimating content popularities becomes essential to manage and distribute content pieces efficiently. In this paper, we show how to properly estimate content popularities from a traffic trace.Specifically, we consider the problem of the popularity inference in order to tune content-level performance models, e.g. caching models. In this context, special care must be taken due to the fact that an observer measures only the flow of requests, which differs from the model parameters, though both quantities are related by the model assumptions. Current studies, however, ignore this difference and use the observed data as model parameters. In this paper, we highlight the inverse problem that consists in determining parameters so that the flow of requests is properly predicted by the model. We then show how such an inverse problem can be solved using Maximum Likelihood Estimation. Based on two large traces from the Orange network and two synthetic datasets, we eventually quantify the importance of this inversion step for the performance evaluation accuracy.

show abstract

Section: Summary Of Resultssupporting

confidence: 82%

“…In particular, our framework can be extended to to renewal [6,1] and cluster processes [17,21]. In these cases new challenges arises, due the reformulation of the ML method.…”

Section: Other Applications and Extensionsmentioning

confidence: 99%

An Inverse Problem Approach for Content Popularity Estimation

Olmos¹,

Kauffmann²

2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

show abstract

“…A handful of attempts in the past few years have been made to investigate most efficient methods of caching in ICN, both empirically [13,31,32] and analytically [4,6,24]. The results from some of these studies, however, are somewhat inconsistent and indecisive.…”

Section: Architectures and Systemsmentioning

confidence: 99%

“…Section 4 addresses the impact of locality of references (i.e., content requests) on the performance of caching in an ICN. Our work is inspired in part by the results delineated by Traverso et al [31] on temporal locality of content references. We introduce a novel view of reference locality that captures both spatial and temporal aspects.…”

Section: Introductionmentioning

confidence: 99%

Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks

Dabirmoghaddam

Barijough

Garcia-Luna-Aceves³

2014

Proceedings of the 1st ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

A formal framework is presented for the characterization of cache allocation models in Information-Centric Networks (ICN). The framework is used to compare the performance of optimal caching everywhere in an ICN with opportunistic caching of content only near its consumers. This comparison is made using the independent reference model adopted in all prior studies, as well as a new model that captures nonstationary reference locality in space and time. The results obtained analytically and from simulations show that optimal caching throughout an ICN and opportunistic caching at the edge routers of an ICN perform comparably the same. In addition, caching content opportunistically only near its consumers is shown to outperform the traditional on-path caching approach assumed in most ICN architectures in an unstructured network with arbitrary topology represented as a random geometric graph.

show abstract

“…S. Travelso et al [43], [47] analyzed influence of temporal locality to cache performance by using trace-driven simulation. They compared cache size giving the same hit ratio for raw trace and shuffled trace (partially randomized trace).…”

Section: Popularity Modelmentioning

confidence: 99%

A Survey of Caching Networks in Content Oriented Networks

Yamamoto

2016

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY Content oriented network is expected to be one of the most promising approaches for resolving design concept difference between content oriented network services and location oriented architecture of current network infrastructure. There have been proposed several content oriented network architectures, but research efforts for content oriented networks have just started and technical issues to be resolved are still remained. Because of content oriented feature, content data transmitted in a network can be reused by content requests from other users. Pervasive cache is one of the most important benefits brought by the content oriented network architecture, which forms interconnected caching networks. Caching network is the hottest research area and lots of research activities have been published. This paper surveys recent research activities for caching networks in content oriented networks, with focusing on important factors which affect caching network performance, i.e. content request routing, caching decision, and replacement policy of cache. And this paper also discusses future direction of caching network researches. key words: cache networks, content oriented networks, in-network cache

show abstract

Temporal locality in today's content caching

Cited by 196 publications

References 33 publications

An Inverse Problem Approach for Content Popularity Estimation

An Inverse Problem Approach for Content Popularity Estimation

Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks

A Survey of Caching Networks in Content Oriented Networks

Contact Info

Product

Resources

About