Home > Research > Publications & Outputs > A Cache Management Scheme for Efficient Content...

Text available via DOI:

View graph of relations

A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks. / Bilal, Muhammad; Kang, Shin Gak.
In: IEEE Access, Vol. 5, 7857720, 2017, p. 1692-1701.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Bilal M, Kang SG. A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks. IEEE Access. 2017;5:1692-1701. 7857720. doi: 10.1109/ACCESS.2017.2669344

Author

Bibtex

@article{d9b7e04ce02d4ba1b46610fa86f1abe6,
title = "A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks",
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 the 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 paper, 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 scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.",
keywords = "cache management, cache network, content centric networking, Content eviction, content replication",
author = "Muhammad Bilal and Kang, {Shin Gak}",
year = "2017",
doi = "10.1109/ACCESS.2017.2669344",
language = "English",
volume = "5",
pages = "1692--1701",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

RIS

TY - JOUR

T1 - A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks

AU - Bilal, Muhammad

AU - Kang, Shin Gak

PY - 2017

Y1 - 2017

N2 - 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 the 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 paper, 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 scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.

AB - 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 the 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 paper, 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 scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.

KW - cache management

KW - cache network

KW - content centric networking

KW - Content eviction

KW - content replication

UR - http://www.scopus.com/inward/record.url?scp=85015972463&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2017.2669344

DO - 10.1109/ACCESS.2017.2669344

M3 - Journal article

AN - SCOPUS:85015972463

VL - 5

SP - 1692

EP - 1701

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 7857720

ER -