%0 Journal Article %1 bilal2017LFRU %A Bilal, Muhammad %A Kang, Shin-Gak %D 2017 %J IEEE Access %K Cache Centric Content Eviction Information-Centric Management Network Networking Replication myown %N 1 %P 1962–1701 %R 10.1109/ACCESS.2017.2669344 %T A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks %U http://arxiv.org/abs/1702.04078 %V 5 %X 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.

@article{bilal2017LFRU, abstract = {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.}, added-at = {2018-09-18T07:05:52.000+0200}, author = {Bilal, Muhammad and Kang, Shin-Gak}, biburl = {https://www.bibsonomy.org/bibtex/2f54c527121d27085300959c8b3d655d9/mbilal084}, description = {A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks}, doi = {10.1109/ACCESS.2017.2669344}, interhash = {a990da27b4e84eaea2c806c016db02b1}, intrahash = {f54c527121d27085300959c8b3d655d9}, journal = {IEEE Access}, keywords = {Cache Centric Content Eviction Information-Centric Management Network Networking Replication myown}, note = {cite arxiv:1702.04078Comment: This print includes minor enhancement and corrections to the published journal version of this article in IEEE Access}, number = 1, pages = {1962–1701}, timestamp = {2018-09-18T07:27:13.000+0200}, title = {A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks}, url = {http://arxiv.org/abs/1702.04078}, volume = 5, year = 2017 }