Joint Incentive Mechanism for Paid Content Caching and Price Based Cache Replacement Policy in Named Data Networking

被引:26
作者
Ndikumana, Anselme [1 ]
Tran, Nguyen H. [1 ,2 ]
Tai Manh Ho [1 ,3 ]
Niyato, Dusit [1 ,4 ]
Han, Zhu [1 ,5 ]
Hong, Choong Seon [1 ]
机构
[1] Kyung Hee Univ, Dept Comp Sci & Engn, Yongin 17104, South Korea
[2] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
[3] Posts & Telecommun Inst Technol, Fac Informat Technol, Ho Chi Minh 700000, Vietnam
[4] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[5] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
基金
新加坡国家研究基金会;
关键词
Named data networking; paid content caching; ISP network; reverse auction;
D O I
10.1109/ACCESS.2018.2848231
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Internet traffic volume is continuing to increase rapidly. Named data networking (NDN) has been introduced to support this Internet traffic growth through caching contents close to consumers. While caching in NDN is beneficial to both Internet service providers (ISPs) and content providers (CPs), ISPs serve cached contents independently without any coordination with CPs. By authorizing the ISPs to cache and distribute the contents accessible on payments, it becomes impractical for CPs to control content access and payments. In this paper, we address these challenges by proposing a joint incentive mechanism and a price-based cache replacement (PBCR) policy for paid content in NDN that improves the ISP's and CPs' profits. We use an auction theory, where the ISP earns profits from caching by alleviating traffic load on transit links and participating in contents selling. Therefore, before the ISP starts selling cached contents, it needs to cache them first. Furthermore, the ISP cache capacity is limited; therefore, we propose PBCR, where the PBCR triggers the content that needs to be replaced when the cache storage is full based on both content price and link cost. The simulation results show that our proposal increases the profits of all the network players involved in paid content caching and improves cache hit ratio.
引用
收藏
页码:33702 / 33717
页数:16
相关论文
共 47 条
[1]  
Afanasyev A., 2012, NDN0005 U CAL
[2]  
[Anonymous], 2017, P GLOBECOM IEEE GLOB
[3]  
[Anonymous], JOINT COMMUNICATION
[4]  
[Anonymous], 2015, U CALIFORNIA
[5]  
[Anonymous], 2016, ACM Trans. Model. Perform. Eval. Comput. Syst. (TOMPECS)
[6]  
[Anonymous], P ACM CONEXT
[7]  
Anselme, SETTINGS ROCKETFUEL
[8]   Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures) [J].
Araldo, Andrea ;
Rossi, Dario ;
Martignon, Fabio .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (05) :1316-1330
[9]  
Arifuzzaman M., 2014, ITU KAL AC C LIV CON, P215
[10]  
Aubry E., 2015, P 1 IEEE C NETW SOFT, P1, DOI DOI 10.1109/NETSOFT.2015.7116130