Cache (computing): Difference between revisions

Revision as of 13:57, 3 October 2024

Revision as of 23:18, 6 October 2024

Line 82:

[[Information-centric networking]] (ICN) is an approach to evolve the [[Internet]] infrastructure away from a host-centric paradigm, based on perpetual connectivity and the [[end-to-end principle]], to a network architecture in which the focal point is identified information. Due to the inherent caching capability of the nodes in an ICN, it can be viewed as a loosely connected network of caches, which has unique requirements for caching policies. However, ubiquitous content caching introduces the challenge to content protection against unauthorized access, which requires extra care and solutions.<ref>{{cite journal|author=Bilal, Muhammad|display-authors=etal|title=Secure Distribution of Protected Content in Information-Centric Networking|journal=IEEE Systems Journal|pages=1–12|arxiv=1907.11717|year=2019|volume=14|issue=2|doi=10.1109/JSYST.2019.2931813|bibcode=2020ISysJ..14.1921B|s2cid=198967720}}</ref>

Unlike proxy servers, in ICN the cache is a network-level solution. Therefore, it has rapidly changing cache states and higher request arrival rates; moreover, smaller cache sizes impose different requirements on the content eviction policies. In particular, eviction policies for ICN should be fast and lightweight. Various cache replication and eviction schemes for different ICN architectures and applications have been proposed.{{cn|date=August 2024}}<!--[[User:Kvng/RTH]]-->

====Policies====

=====Time aware least recently used (TLRU)=====

The Timetime aware Leastleast Recentlyrecently Usedused (TLRU)<ref>{{cite conference|last1=Bilal|first1=Muhammad|first2=Shin-Gak|last2=Kang|conference=16th International Conference on Advanced Communication Technology|title=Time Aware Least Recent Used (TLRU) cache management policy in ICN|year=2014|pages=528–532|doi=10.1109/ICACT.2014.6779016|arxiv=1801.00390|bibcode=2018arXiv180100390B|isbn=978-89-968650-3-2|s2cid=830503}}</ref> is a variant of LRU designed for the situation where the stored contents in cache have a valid life timelifetime. The algorithm is suitable in network cache applications, such as ICN, [[content delivery network]]s (CDNs) and distributed networks in general. TLRU introduces a new term: TTU (Timetime to Useuse (TTU). TTU is a time stamp of aon content/page which stipulates the usability time for the content based on the locality of the content and information from the content publisher announcement. Owing to this locality -based time stamp, TTU provides more control to the local administrator to regulate in -network storage.

In the TLRU algorithm, when a piece of content arrives, a cache node calculates the local TTU value based on the TTU value assigned by the content publisher. The local TTU value is calculated by using a locally -defined function. Once the local TTU value is calculated the replacement of content is performed on a subset of the total content stored in cache node. The TLRU ensures that less popular and small lifeshort-lived content should be replaced with the incoming content.<ref>{{cite conference|last1=Bilal|first1=Muhammad|first2=Shin-Gak|last2=Kang|conference=16th International Conference on Advanced Communication Technology|title=Time Aware Least Recent Used (TLRU) cache management policy in ICN|year=2014|pages=528–532|doi=10.1109/ICACT.2014.6779016|arxiv=1801.00390|bibcode=2018arXiv180100390B|isbn=978-89-968650-3-2|s2cid=830503}}</ref><!--[[User:Kvng/RTH]]-->

=====Least frequent recently used (LFRU)=====