CPNDD:Content Placement Approach in Content Centric Networking

被引:4
作者
Kumar, Sumit [1 ]
Tiwari, Rajeev [2 ]
Obaidat, Mohammad S. [3 ]
Kumar, Neeraj [4 ]
Hsiao, Kuei-Fang [5 ]
机构
[1] Univ Petr & Energy Studies, Dept Syst, Sch Comp Sci, Dehra Dun, Uttarakhand, India
[2] Univ Petr & Energy Studies, Sch Comp Sci, Dehra Dun, Uttarakhand, India
[3] Univ Sci & Technol TextitBeijing, Beijing, Peoples R China
[4] Thapar Univ, Dept Comp Sci, Patiala, Punjab, India
[5] Ming Chuan Univ, Dept Informat Management, Dept Comp Sci, Taoyuan, Taiwan
来源
ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2020年
关键词
CCN; caching; content placement; FIB; CS; PIT; CPNDD; INFORMATION; POPULARITY;
D O I
10.1109/icc40277.2020.9149025
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Content Centric Networks (CCN) has been evolved as a promising internet architecture that focuses on content centric approach for content requests rather than host centric approach. CCN provide in-network caching and content distribution capability improves Quality-of-Service by reducing intermediatory hop count and server load, which condequently reduces bandwidth requirements. Existing work in CCN emphasis on minimizing content caching operations and maximizing network hit ratio. In this paper, we have investigated the effect of in-network caching based on content provider distance and node centrality parameters over network hit ratio. A novel content placement approach named CPNDD (Content Placement based on Normalized Node Degree and Distance), has been proposed that collectively implement both parameters to intelligently select caching location in the network to maximize gain in hit ratio. The weightage of both parameters has been computed using extensive simulation on abilene network topology. We have compared our scheme with several peer caching algorithms in CCN. Simulation results are obtained for different cache size, exponent value of zipf distribution and number of requests. The results demonstrate that CPNDD increases in-network hit ratio gain upto 40% as comparison to existing algorithms.
引用
收藏
页数:6
相关论文
共 16 条
[1]  
[Anonymous], PERFORMANCE EVALUATI
[2]  
Arianfar S., 2010, P 2 WORKSH REARCH IN
[3]  
Cho K, 2012, IEEE CONF COMPUT, P316, DOI 10.1109/INFCOMW.2012.6193512
[4]   A Survey of Caching Policies and Forwarding Mechanisms in Information-Centric Networking [J].
Ioannou, Andriana ;
Weber, Stefan .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (04) :2847-2886
[5]  
Jacobson V., 2009, P 2009 WORKSH REARC
[6]  
Jacobson V, 2009, P 5 INT C EM NETW EX, P112
[7]  
Psaras I, 2012, P 2 ED ICN WORKSH IN, P5560
[8]   In-Network Cache Management and Resource Allocation for Information-Centric Networks [J].
Psaras, Ioannis ;
Chai, Wei Koong ;
Pavlou, George .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (11) :2920-2931
[9]  
Rossi D., 2011, Technical Report
[10]  
Rossi D, 2012, IEEE CONF COMPUT, P280, DOI 10.1109/INFCOMW.2012.6193506