When the cache is full, the algorithm must choose which items to discard to make room for the new ones.
Therefore, it has rapidly changing cache states and higher request arrival rates; moreover, smaller cache sizes further impose different kind of requirements on the content eviction policies.
In particular, eviction policies for Information-centric networking should be fast and lightweight.
Various cache replication and eviction schemes for different Information-centric networking architectures and applications are proposed.
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.