K-medoids Based Intra-Cluster Hash Routing for Named Data Networking

被引：0
|
作者：
Yan H. [1 ]
Gao D.-Y. [1 ]
Su W. [1 ]
机构：
[1] College of Electronics and Information Engineering, Beijing Jiaotong University, Beijing
来源：
| 1600年 / Chinese Institute of Electronics卷 / 45期
关键词：
Hash routing; Hierarchical cluster; K-medoids algorithm; Named data networking;
D O I：
10.3969/j.issn.0372-2112.2017.10.001
中图分类号：
学科分类号：
摘要：
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 (KMHR) 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. © 2017, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码：2313 / 2322
页数：9
相关论文
共 19 条
  • [1] Cisco Visual Networking Index (VNI): forecast and methodology, 2014-2019, (2015)
  • [2] Xylomenos G., Ververidis C., Siris V., Et al., A survey of information-centric networking research, IEEE Communications Surveys & Tutorials, 16, 2, pp. 1024-1049, (2013)
  • [3] Jacobson V., Smetters D., Thornton J., Et al., Networking named content, Proc. of 2009 ACM CoNEXT Conference, pp. 1-12, (2009)
  • [4] Yi C., Abraham J., Afanasyev A., Et al., On the role of routing in named data networking, Proc. of the 1st International Conference on Information-Centric Networking, pp. 27-36, (2014)
  • [5] Laoutaris N., Che H., Stavrakakis I., The lcd interconnection of LRU caches and its analysis, Performance Evaluation, 63, 7, pp. 609-634, (2006)
  • [6] Psaras I., Chai W.K., Pavlou G., Probabilistic in-network caching for information-centric networks, Proc. of the 2nd ACM SIGCOMM workshop on ICN, pp. 55-60, (2012)
  • [7] Chai W., He D., Psaras I., Et al., Cache less for more in information-centric networks, Proc. of the 11th International IFIP TC 6 Networking Conference, pp. 27-40, (2012)
  • [8] Eum S., Nakauchi K., Murata M., Et al., Catt: Potential based routing with content caching for icn, Proc. of the 2nd ACM SIGCOMM workshop on ICN, pp. 49-54, (2012)
  • [9] Choi H., Yoo J., Chung T., Et al., CoRC: Coordinated routing and caching for named data networking, Proc. of the 10th ACM/IEEE symposium on Architectures for networking and communications systems, pp. 161-172, (2014)
  • [10] Li Z., Simon G., Time-shifted tv in content centric networks: The case for cooperative in-network caching, Proc. of IEEE International Conference on Communications, pp. 1-6, (2011)
12