【作者】 张萌； 饶迎； 罗洪斌； 张宏科；

【Author】 Meng Zhang;Ying Rao;Hongbin Luo;Hongke Zhang;School of Electronic and Information Engineering,Beijing Jiaotong University;

【机构】 北京交通大学电子信息工程学院；

【摘要】 随着以内容为中心的新型网络架构的提出,网络缓存作为新型网络架构的重要元素,逐渐成为了研究热点。网络缓存能够有效优化网络性能,提高服务质量。但是由于缓存内容的不稳定性,传统的缓存方案需要迫切提高缓存效率。为了解决这个问题,我们在本文中提出了基于节点度的概率缓存机制(Degree-BasedProbabilistic Caching Scheme,DBPC)。其主要思想为,每个路由器缓存根据节点度数来计算缓存概率。我们通过仿真结果来讨论和比较DBPC和其他的缓存优化方案。根据结果证明在已提出的缓存优化方案中,DBPC有更优的缓存性能。更多还原

【Abstract】 Since the proposal of the information-centric networks,the in-network caching which acts as an important element of the novel architecture has become one of the hottest research topics.In-network caching can optimize the network performance and improve the quality of service effectively.However,due to the instability of the cached content,there exists an urgent need for the traditional caching solutions to enhance the caching efficiency.To grapple with this problem,we propose a Degree-Based Probabilistic Caching Scheme in this paper.The main goal is that each router calculates the caching probability according to the node degree.By discussing and comparing our scheme with the other caching schemes according to the simulation results,we conclude that DBPC can improve the caching performance.更多还原