Design of in-network caching scheme in CCN based on grey relational analysis  

作　　者：CUI Xian-dong HUANG Tao LIU Jiang LI Li CHEN Jian-ya LIU Yun-jie 

机构地区：[1]State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications [2]Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications [3]Future Network Industry Innovation Center of China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2014年第2期1-8,共8页中国邮电高校学报（英文版）

基　　金：supported by the National Basic Research Programs of China(2012CB315801,2011CB302901);the Fundamental Research Funds for the Central Universities(2013RC0113,2012RC0120)

摘　　要：In-network caching is one of the most important issues in content centric networking （CCN）, which may extremely influence the performance of the caching system. Although much work has been done for in-network caching scheme design in CCN, most of them have not addressed the multiple network attribute parameters jointly during caching algorithm design. Hence, to fill this gap, a new in-network caching based on grey relational analysis （GRA） is proposed. The authors firstly define two newly metric parameters named request influence degree （RID） and cache replacement rate, respectively. The RID indicates the importance of one node along the content delivery path from the view of the interest packets arriving The cache replacement rate is used to denote the caching load of the node. Then combining hops a request traveling from the users and the node traffic, four network attribute parameters are considered during the in-network caching algorithm design. Based on these four network parameters, a GRA based in-network caching algorithm is proposed, which can significantly improve the performance of CCN. Finally, extensive simulation based on ndnSIM is demonstrated that the GRA-based caching scheme can achieve the lower load in the source server and the less average hops than the existing the betweeness （Betw） scheme and the ALWAYS scheme.In-network caching is one of the most important issues in content centric networking （CCN）, which may extremely influence the performance of the caching system. Although much work has been done for in-network caching scheme design in CCN, most of them have not addressed the multiple network attribute parameters jointly during caching algorithm design. Hence, to fill this gap, a new in-network caching based on grey relational analysis （GRA） is proposed. The authors firstly define two newly metric parameters named request influence degree （RID） and cache replacement rate, respectively. The RID indicates the importance of one node along the content delivery path from the view of the interest packets arriving The cache replacement rate is used to denote the caching load of the node. Then combining hops a request traveling from the users and the node traffic, four network attribute parameters are considered during the in-network caching algorithm design. Based on these four network parameters, a GRA based in-network caching algorithm is proposed, which can significantly improve the performance of CCN. Finally, extensive simulation based on ndnSIM is demonstrated that the GRA-based caching scheme can achieve the lower load in the source server and the less average hops than the existing the betweeness （Betw） scheme and the ALWAYS scheme.

关 键 词：CCN in-network caching request influence degree cache replacement rate grey relational analysis 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]