Research on Content Naming Granularity in Information-Centric Networking

doi:10.11871/jfdc.issn.2096-742X.2020.03.002

Abstract

Abstract:

[Objective] The content naming granularity in information-centric networking (ICN) is an important influencing factor on network efficiency, especially the efficiency of routing table lookups. This work investigates the interplay between routing table lookup efficiency and content naming granularity. [Methods] Firstly, the number of network names is analyzed with respect to the content naming granularity, whereby the number of network requests and the size of routing tables are obtained under different naming methods. Then, the impact of content naming granularity on routing table lookup efficiency is further investigated. [Results] This study found that the smaller the content naming granularity, the larger the number of names and requests, and the routing table size may become larger depending on the naming method, which in turn leads to a reduction in table lookup efficiency. [Limitations] The results of this study are mainly based on the literature review, data analysis, and local testing, which means it currently lacks of support of real network testing. [Conclusions] This paper explores the impact of content naming granularity to the efficiency of ICN progressively and analyzes the main influencing factors and their interplay, which lays a theoretical foundation for further research on content naming granularity.

Key words: information-centric networking, future Internet, content naming, naming granularity, table lookup efficiency

Zhang Kangning,Zhang Shan,Luo Hongbin. Research on Content Naming Granularity in Information-Centric Networking[J]. Frontiers of Data and Computing, 2020, 2(3): 18-31.

Figures/Tables 10

Fig.1

Fig.2

Fig.3

Fig.4

Fig.5

Fig.6

Fig.7

Fig.8

Fig.9

Fig.10

References 15

[1]	夏春梅, 徐明伟. 信息中心网络研究综述[J]. 计算机科学与探索, 2013,7(6):481-493. doi: 10.3778/j.issn.1673-9418.1303025
[2]	吴超, 张尧学, 周悦芝, et al. 信息中心网络发展研究综述[J]. 计算机学报, 2015,1(3):455-471.
[3]	JACOBSONV , SMETTERSD K, THORNTONJ D, et al. Networking Named Content[J]. Communications of the -ACM, 2012,55(1):117-124.
[4]	ZHANGL , AFANASYEVA , BURKEJ , et al. Named Data Networking[J]. Computer communication review, 2014,44(3):66-73. doi: 10.1145/2656877.2656887
[5]	CHERITOND , GRITTERM . TRIAD: a new next-generation Internet architecture[R]. Stanford: Computer Science Department, Stanford University, 2000.
[6]	KOPONENT , CHAWLAM , CHUNB G, et al. A Data-Oriented (and Beyond) Network Architecture[J]. -SIGCOMM, 2007,37(4):181-192.
[7]	THOMASY , XYLOMENOSG . Towards improving the efficiency of ICN packet-caches[C] . International Conference on Heterogeneous Networking for Quality. IEEE, 2014.
[8]	曾宇晶. 信息中心网络服务缓存方法研究[D]. 北京交通大学, 2016.
[9]	MITZENMACHER M. Dynamic Models for File Sizes and Double Pareto Distributions[J]. Internet Mathematics, 2004,1(3):305-333.
[10]	THOMPSONK , MILLERG J, WILDERR . Wide-Area Internet Traffic Patterns and Characteristics[J]. IEEE Network, 1997,11(6):10-23.
[11]	BUSARIM , WILLIAMSONC . Simulation evaluation of a heterogeneous Web proxy caching hierarchy[C]. Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on. IEEE Computer Society, 2001.
[12]	BLEFARIMELAZZIN , DETTIA , POMPOSINIM , et al. Route discovery and caching: A way to improve the scalability of Information-Centric Networking.[C]. Global Communications Conference. IEEE, 2013.
[13]	ICANN. AS65000 BGP Routing Table Analysis Report [R/OL] .[2020-03-21]. https://bgp.potaroo.net/as2.0/bgp-active.html.
[14]	TANY , ZHUS . Efficient Name Lookup Scheme Based on Hash and Character Trie in Named Data Networking[C]. Web Information System & Application Conference. IEEE, 2016.
[15]	汪漪. 内容中心网络路由查找关键技术研究[D]. 清华大学, 2013.