A Packet-Level Caching Algorithm for Mitigating Negative Effects Caused by Large Objects in ICN Networks

Abstract

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 packetlevel caching with cache admission, and theoretically proves that cache admission mitigates these problems and improves cache hit probability.

Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks

“…There are many works in the literature that address this concept. Particularly, the cache placement and replacement strategies are widely emphasized [ 50 , 51 ]. They are based on an important factor called “ the popularity of content ” that is measured by the number of Interests (i.e., requests) sent.…”