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 <italic>packet-level caching</italic> which is called <italic>looped replacement</italic>. 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 <italic>cache admission</italic>, 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.