A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks
Increase in the size of content due to the emergence of bandwidth-intensive applications leads to a problematic phenomenon of packet-level caching which is called looped replacement. This causes a waste of cache usage and results in caching performance degradation. The goals of the paper are twofold...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9112164/ |
id |
doaj-674efe555f8247139dff92dd25d27ed0 |
---|---|
record_format |
Article |
spelling |
doaj-674efe555f8247139dff92dd25d27ed02021-03-30T02:54:51ZengIEEEIEEE Access2169-35362020-01-01810824710825910.1109/ACCESS.2020.30010889112164A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN NetworksYoji Yamamoto0Junji Takemasa1https://orcid.org/0000-0002-5361-1855Yuki Koizumi2Toru Hasegawa3Graduate School of Information Science and Technology, Osaka University, Osaka, JapanKDDI Research and Development Laboratories, Inc., Fujimino, JapanGraduate School of Information Science and Technology, Osaka University, Osaka, JapanGraduate School of Information Science and Technology, Osaka University, Osaka, JapanIncrease in the size of content due to the emergence of bandwidth-intensive applications leads to a problematic phenomenon of packet-level caching which is called looped replacement. This causes a waste of cache usage and results in caching performance degradation. The goals of the paper are twofold: identifying the root cause of looped replacement and mitigating it. In order to achieve the goals, we analytically investigate not only how looped replacement occurs, but also how cache hit probability decreases. According to the analysis, we propose to use cache admission, which only admits packets arriving frequently to a cache, as a countermeasure against both problems. Finally, we develop an analytical model of packet-level caching with cache admission, and theoretically proves that cache admission mitigates these problems and improves cache hit probability.https://ieeexplore.ieee.org/document/9112164/Information centric networkingpacket-level cachinglarge object |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Yoji Yamamoto Junji Takemasa Yuki Koizumi Toru Hasegawa |
spellingShingle |
Yoji Yamamoto Junji Takemasa Yuki Koizumi Toru Hasegawa A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks IEEE Access Information centric networking packet-level caching large object |
author_facet |
Yoji Yamamoto Junji Takemasa Yuki Koizumi Toru Hasegawa |
author_sort |
Yoji Yamamoto |
title |
A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks |
title_short |
A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks |
title_full |
A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks |
title_fullStr |
A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks |
title_full_unstemmed |
A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks |
title_sort |
packet-level caching algorithm for mitigating negative effects caused by large objects in icn networks |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
Increase in the size of content due to the emergence of bandwidth-intensive applications leads to a problematic phenomenon of packet-level caching which is called looped replacement. This causes a waste of cache usage and results in caching performance degradation. The goals of the paper are twofold: identifying the root cause of looped replacement and mitigating it. In order to achieve the goals, we analytically investigate not only how looped replacement occurs, but also how cache hit probability decreases. According to the analysis, we propose to use cache admission, which only admits packets arriving frequently to a cache, as a countermeasure against both problems. Finally, we develop an analytical model of packet-level caching with cache admission, and theoretically proves that cache admission mitigates these problems and improves cache hit probability. |
topic |
Information centric networking packet-level caching large object |
url |
https://ieeexplore.ieee.org/document/9112164/ |
work_keys_str_mv |
AT yojiyamamoto apacketlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT junjitakemasa apacketlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT yukikoizumi apacketlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT toruhasegawa apacketlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT yojiyamamoto packetlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT junjitakemasa packetlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT yukikoizumi packetlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks AT toruhasegawa packetlevelcachingalgorithmformitigatingnegativeeffectscausedbylargeobjectsinicnnetworks |
_version_ |
1724184417270759424 |