文章基本信息

标题：Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network
本地全文：下载
作者：Leanna Vidya Yovita ; Nana Rachmana Syambas ; Ian Joseph Matheus Edward 等
期刊名称：Future Internet
电子版ISSN：1999-5903
出版年度：2022
卷号：14
期号：3
页码：84
DOI：10.3390/fi14030084
语种：English
出版社：MDPI Publishing
摘要：Today, the internet requires many additional mechanisms or protocols to support various ever-growing applications. As a future internet architecture candidate, the Named Data Network (NDN) offers a solution that naturally fulfills this need. One of the critical components in NDN is cache. Caching in NDN solves bandwidth usage, server load, and service time. Some research about caching has been conducted, but improvements can be made. In this research, we derived the utility function of multiclass content to obtain the relationship between the class’s weight and cache hit ratio. Then, we formulated it into the Weighted-CAPIC caching algorithm. Our research shows that Weighted-CAPIC provides a higher cache hit ratio for the priority class and the whole system. This performance is supported while the algorithm still provides the same path-stretch value as Dynamic-CAPIC. The Weighted-CAPIC is suitable to used in mobile nodes due to its ability to work individually without having to coordinate with other nodes.