Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Enhancing Cache Robustness in Information-Centric Networks: Per-Face Popularity Approaches

Version 1 : Received: 31 July 2023 / Approved: 31 July 2023 / Online: 1 August 2023 (03:48:00 CEST)

A peer-reviewed article of this Preprint also exists.

Baugh, J.; Guo, J. Enhancing Cache Robustness in Information-Centric Networks: Per-Face Popularity Approaches. Network 2023, 3, 502-521. Baugh, J.; Guo, J. Enhancing Cache Robustness in Information-Centric Networks: Per-Face Popularity Approaches. Network 2023, 3, 502-521.

Abstract

Information-Centric Networking (ICN) is a new paradigm of network architectures that focuses on content, rather than hosts, as first-class citizens of the network. As part of these architectures, in-network storage devices are essential to provide end users with close copies of popular content, to reduce latency and improve overall experience for the user, but also to reduce network congestion and load on the content producers. To be effective, in-network storage devices, such as content storage routers should maintain copies of the most popular content objects. Adversaries that wish to reduce this effectiveness can launch cache pollution attacks to eliminate the benefit of the in-network storage device caches. Therefore, it is crucial to protect these devices and ensure the highest hit rate possible. This paper demonstrates per-face popularity approaches to reducing the effects of cache pollution and improving hit rates by normalizing assessed popularity across all faces of content storage routers. The mechanisms that were developed prevent the consumers, whether legitimate or malicious, on any single face or small number of faces from overwhelmingly influencing the content objects that remain in the cache. The results demonstrate that per-face approaches generally have much better hit rates than currently used cache replacement techniques.

Keywords

Named Data Networking; Information Centric Networking; NDN; ICN; cache pollution; hit rate; popularity; cache robustness

Subject

Computer Science and Mathematics, Computer Networks and Communications

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.