2012 21st International Conference on Computer Communications and Networks (ICCCN) 2012
DOI: 10.1109/icccn.2012.6289289
|View full text |Cite
|
Sign up to set email alerts
|

Caching Policies for In-Network Caching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(27 citation statements)
references
References 11 publications
0
27
0
Order By: Relevance
“…Rosensweig et al (2010) presented a model that approximates miss ratios for any multi-cache topology when the caching policy is basic LRU. In Li et al (2012), the authors extend the work in Rosensweig et al (2010), and develop an analytical model to predict the caching performance of various replacement policies in an in-network caching system. Based on the approximation, the authors of Li et al (2012) further propose the multipolicy cache management where the replacement policy on each cache should be differentiated according to its location.…”
Section: Open Questions and Research Directionsmentioning
confidence: 99%
“…Rosensweig et al (2010) presented a model that approximates miss ratios for any multi-cache topology when the caching policy is basic LRU. In Li et al (2012), the authors extend the work in Rosensweig et al (2010), and develop an analytical model to predict the caching performance of various replacement policies in an in-network caching system. Based on the approximation, the authors of Li et al (2012) further propose the multipolicy cache management where the replacement policy on each cache should be differentiated according to its location.…”
Section: Open Questions and Research Directionsmentioning
confidence: 99%
“…There are many caching policies [16]- [19] that have been introduced in literature. The two main cache policies are Least Frequently Used (LFU) and Lease Recently Used (LRU) that their name clearly describes how eviction happens in a cache.…”
Section: B Cachingmentioning
confidence: 99%
“…LRU-K basic idea [18] is to keep track of the number of K last times that a content was referenced. In [19] different caching policies for in-network caching were discussed.…”
Section: B Cachingmentioning
confidence: 99%
“…The common approach is the design of content router functionalities to support incoming requests for different data files, dynamically cache those files, and efficiently manage router caching space through suitable cache replacement policies [7] [44]. For instance, the Breadcrumbs system in [45] presents a best-effort caching and query routing policy that uses the caching history of passing contents to modify the forwarding rates of request packets.…”
Section: A In-transient Datamentioning
confidence: 99%