Scalable Cache Component in ICN Adaptable to Various Network Traffic Access Patterns

Atsushi OOKA; Eum SUYONG; Shingo ATA; Masayuki MURATA

doi:10.1587/transcom.2017ITP0006

Scalable Cache Component in ICN Adaptable to Various Network Traffic Access Patterns

Atsushi OOKA, Eum SUYONG, Shingo ATA, Masayuki MURATA

Full Text Views

0

Cite this

Summary :

Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.

Publication: IEICE TRANSACTIONS on Communications Vol.E101-B No.1 pp.35-48

Publication Date: 2018/01/01

Publicized: 2017/07/05

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2017ITP0006

Type of Manuscript: Special Section PAPER (Special Section on Internet Technologies to Accelerate Smart Society)

Category

Authors

Atsushi OOKA
  Osaka University
Eum SUYONG
  Osaka University
Shingo ATA
  Osaka City University
Masayuki MURATA
  Osaka University

Keyword

information-centric networking, content-centric networking, caching, cache replacement algorithm

Cite this

Copy

Atsushi OOKA, Eum SUYONG, Shingo ATA, Masayuki MURATA, "Scalable Cache Component in ICN Adaptable to Various Network Traffic Access Patterns" in IEICE TRANSACTIONS on Communications, vol. E101-B, no. 1, pp. 35-48, January 2018, doi: 10.1587/transcom.2017ITP0006.
Abstract: Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017ITP0006/_p

Copy

@ARTICLE{e101-b_1_35,
author={Atsushi OOKA, Eum SUYONG, Shingo ATA, Masayuki MURATA, },
journal={IEICE TRANSACTIONS on Communications},
title={Scalable Cache Component in ICN Adaptable to Various Network Traffic Access Patterns},
year={2018},
volume={E101-B},
number={1},
pages={35-48},
abstract={Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.},
keywords={},
doi={10.1587/transcom.2017ITP0006},
ISSN={1745-1345},
month={January},}

Copy

TY - JOUR
TI - Scalable Cache Component in ICN Adaptable to Various Network Traffic Access Patterns
T2 - IEICE TRANSACTIONS on Communications
SP - 35
EP - 48
AU - Atsushi OOKA
AU - Eum SUYONG
AU - Shingo ATA
AU - Masayuki MURATA
PY - 2018
DO - 10.1587/transcom.2017ITP0006
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2018
AB - Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.
ER -