2017/01/01 by Muhammad Bilal, Shin‐Gak Kang, Shin-Gak Kang · 2 citations
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Opportunistic and Delay-Tolerant Networks #acm:68M10 #acm:68M11 #acm:68M12 #acm:68M14 #acm:68M20 #cs.NI #msc:68M10 #msc:68M11 #msc:68M12 #msc:68M14 #msc:68M20
paper · pdf · doi:10.1109/access.2017.2669344
published as IEEE Access, Vol. 5, pp. 1692-1701 (2017) · This print includes minor enhancement and corrections to the published journal version of this article in IEEE Access
openalex publication_date 2017/01/01 · arxiv created 2017/06/27 · arxiv updated 2017/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
To cope with the ongoing changing demands of the internet, 'in-network caching' has been presented as an application solution for two decades. With the advent of information-centric network (ICN) architecture, 'in-network caching' becomes a network level solution. Some unique features of ICNs, e.g., rapidly changing cache states, higher request arrival rates, smaller cache sizes, and other factors, impose diverse requirements on the content eviction policies. In particular, eviction policies should be fast and lightweight. In this study, we propose cache replication and eviction schemes, Conditional Leave Cope Everywhere (CLCE) and Least Frequent Recently Used (LFRU), which are well suited for the ICN type of cache networks (CNs). The CLCE replication scheme reduces the redundant caching of contents; hence improves the cache space utilization. LFRU approximates the Least Frequently Used (LFU) scheme coupled with the Least Recently Used (LRU) scheme and is practically implementable for rapidly changing cache networks like ICNs.