Efficient Lookup Schemes Based on Splitting Name for NDN

Qingtao Wu,
Jinrong Yan,
Mingchuan Zhang,
Junlong Zhu,
Ruijuan Zheng,

Abstract


Named Data Networking (NDN) is a novel networking architecture which retrieves the content by using its variable-length names. Name-based forwarding is a typical feature of NDN. Therefore, it has necessitated the design of fast forwarding lookup algorithms. In this paper, we propose an efficient name lookup scheme called SNBS (Split the Name into Basis and Suffix). In this scheme, we decompose Basis into many components. Each component of Basis is stored in a Counting Bloom Filter (CBF). In addition, we also introduce a correlation verification method to ensure inherent correlation of all components of Basis. Furthermore, Suffix is processed by tree bitmap. By simulation, we show that our proposed lookup scheme can improve the lookup rate. Moreover, our scheme also reduces the bound of false positive probability.


Citation Format:
Qingtao Wu, Jinrong Yan, Mingchuan Zhang, Junlong Zhu, Ruijuan Zheng, "Efficient Lookup Schemes Based on Splitting Name for NDN," Journal of Internet Technology, vol. 20, no. 1 , pp. 195-203, Jan. 2019.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.





Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Library and Information Center, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd. Shoufeng, Hualien 97401, Taiwan, R.O.C.
Tel: +886-3-931-7017  E-mail: jit.editorial@gmail.com