Performance Analysis of Cache Based on Popularity and Class in Named Data Network

被引:3
作者
Yovita, Leanna Vidya [1 ]
Syambas, Nana Rachmana [1 ]
Edward, Ian Joseph Matheus [1 ]
Kamiyama, Noriaki [2 ]
机构
[1] Inst Teknol Bandung, Sch Elect Engn & Informat, Kota Bandung 40132, Indonesia
[2] Fukuoka Univ, Dept Elect Engn & Comp Sci, Fukuoka 8140180, Japan
来源
FUTURE INTERNET | 2020年 / 12卷 / 12期
关键词
Named Data Network; caching; popularity; content class; priority;
D O I
10.3390/fi12120227
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The communication network is growing with some unique characteristics, such as consumers repeatedly request the same content to the server, similarity in local demand trend, and dynamic changes to requests within a specific period. Therefore, a different network paradigm is needed to replace the IP network, namely Named Data Network (NDN). The content store, which acts as a crucial component in the NDN nodes is a limited resource. In addition, a cache mechanism is needed to optimize the router's content store by exploiting the different content services characters in the network. This paper proposes a new caching algorithm called Cache Based on Popularity and Class (CAPIC) with dynamic mechanism, and the detail explanation about the static method also presented. The goal of Static-CAPIC was to enhance the total cache hit ratio on the network by pre-determining the cache proportion for each content class. However, this technique is not appropriate to control the cache hit ratio for priority class. Therefore, the Dynamic-CAPIC is used to provide flexibility to change the cache proportion based on the frequency of requests in real-time. The formula involves considering the consumers' request all the time. It gives a higher cache hit ratio for the priority content class. This method outperforms Static-CAPIC, and the LCD+sharing scheme in the total network cache hit ratio parameter and channels it to the priority class.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 26 条
[1]  
Cantor L., 2020, PHENOMENA REPORT TEC
[2]  
Carofiglio G., 2011, Communications (ICC), 2011 IEEE International Conference on, P1, DOI [10.1109/icc.2011.5962739., DOI 10.1109/ICC.2011.5962739]
[3]  
Che H, 2001, IEEE INFOCOM SER, P1416, DOI 10.1109/INFCOM.2001.916637
[4]  
Cho K, 2012, IEEE CONF COMPUT, P316, DOI 10.1109/INFCOMW.2012.6193512
[5]   A Survey on Content-Oriented Networking for Efficient Content Delivery [J].
Choi, Jaeyoung ;
Han, Jinyoung ;
Cho, Eunsang ;
Kwon, Ted 'Taekyoung' ;
Choi, Yanghee .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (03) :121-127
[6]   On Allocating Cache Resources to Content Providers [J].
Chu, Weibo ;
Dehghan, Mostafa ;
Towsley, Don ;
Zhang, Zhi-Li .
PROCEEDINGS OF THE 2016 3RD ACM CONFERENCE ON INFORMATION-CENTRIC NETWORKING (ACM-ICN '16), 2016, :154-159
[7]  
Fricker C, 2012, IEEE CONF COMPUT, P310, DOI 10.1109/INFCOMW.2012.6193511
[8]   Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems [J].
Hefeeda, Mohamed ;
Saleh, Osama .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (06) :1447-1460
[9]   Networking Named Content [J].
Jacobson, Van ;
Smetters, Diana K. ;
Thornton, James D. ;
Plass, Michael ;
Briggs, Nick ;
Braynard, Rebecca .
COMMUNICATIONS OF THE ACM, 2012, 55 (01) :117-124
[10]   Information-centric mobile caching network frameworks and caching optimization: a survey [J].
Jin, Hao ;
Xu, Dan ;
Zhao, Chenglin ;
Liang, Dong .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2017,