Analysis on caching large content for information centric networking

Yamamoto Yoji, Junji Takemasa, Yuki Koizumi, Tōru Hasegawa · 2018

Increase in the size of content due to the emergence of bandwidthintensive applications leads to a problematic phenomenon, looped replacement, of packet-level caching of information centric networking. This paper analytically investigates how looped replacement occurs. The analyses imply that cache admission is one of countermeasures against looped replacement. Through simulation, we confirm cache admission suppress looped replacement through simulation.

Read the paper · More papers on PaperTik