Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Silva, Andrey; Araujo, Ivanes Lian Costa; Linder, Neiva; Klautau, Aldebaro

doi:10.14209/jcis.2019.22

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further comparisons with other caching algorithms, such as the Name Popularity Algorithm [25] and CaDaCa [26], are needed. It is possible that the PFP-based algorithms could enhance or be enhanced with these additional caching techniques in a hybrid strategy.…”

Section: Summary Conclusion and Future Workmentioning

confidence: 99%

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

Baugh,

Guo

2023

Network

View full text Add to dashboard Cite

Information-Centric Networking (ICN) is a new paradigm of network architecture 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 the 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 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.

show abstract

Section: Summary Conclusion and Future Workmentioning

confidence: 99%

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

Baugh,

Guo

2023

Network

View full text Add to dashboard Cite

show abstract

“…Further comparisons with other caching algorithms, such as the Name Popularity Algorithm [21] and CaDaCa [22] are needed. It is possible that the PFP-based algorithms could enhance or be enhanced by, these additional caching techniques in a hybrid strategy.…”

Section: Summary Conclusion and Future Workmentioning

confidence: 99%

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

Baugh¹,

Guo²

2023

Preprint

View full text Add to dashboard Cite

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.

show abstract

Name Popularity Algorithm: A Cache Replacement Strategy for NDN Networks

Cited by 2 publications

References 19 publications

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

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

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

Contact Info

Product

Resources

About