电子学报2017，Vol.45Issue(10)：2313-2322,10.DOI:10.3969/j.issn.0372-2112.2017.10.001
命名数据网络下基于K-medoids的簇内Hash路由机制
K-medoids Based Intra-Cluster Hash Routing for Named Data Networking
摘要
Abstract
Named Data Networking (NDN) is a new content-centric architecture.Its original Leave Copy Everywhere (LCE) strategy has many shortcomings,for instance,massive cache redundancy and poor utilization of neighbors' cache,which waste cache space and lower cache efficiency.We proposed a routing scheme named K-Medoids Hash Routing (KM-HR) combining on-path non-cooperation and off-path cooperation schemes.K-medoids algorithm is used to select some content routers as medoids in hierarchical clusters.And for different popularity of contents,we choose Hash routing or the shortest path routing separately.KMHR locates and insures the uniqueness of contents with high popularity in the cluster,which significantly reduces cache redundancy and improves cache efficiency.Based on the real world network topology,simulation results show that KMHR has the shortest request time,optimal routing gain and fewer cached contents.关键词
命名数据网络/层次簇/K-medoids算法/Hash路由Key words
named data networking/hierarchical cluster/K-medoids algorithm/Hash routing分类
信息技术与安全科学引用本文复制引用
鄢欢,高德云,苏伟..命名数据网络下基于K-medoids的簇内Hash路由机制[J].电子学报,2017,45(10):2313-2322,10.基金项目
国家973重点基础研究发展规划(No.2013CB329100) （No.2013CB329100）
国家自然科学基金重点项目(No.61232017) （No.61232017）
