文章基本信息

标题：Steerable Name Lookup based on Classified Prefixes and Scalable One Memory Access Bloom Filter for Named Data Networking
本地全文：下载
作者：Sheng Huang ; Jianghua Xu ; Xiaofei Yang 等
期刊名称：International Journal of Future Generation Communication and Networking
印刷版ISSN：2233-7857
出版年度：2016
卷号：9
期号：7
页码：87-100
DOI：10.14257/ijfgcn.2016.9.7.09
出版社：SERSC
摘要：Name Data Networking (NDN) is an entirely new network architecture, in which data packet forwarding rely on content names instead of fixed-length IP addresses. Under the new naming system, content names are hierarchical structure and have variable length, these pivotal features bring new challenges to meet line speed at large scale. In this paper, we propose Steerable Name Lookup based on Classified Prefixes and Scalable One Memory Access Bloom Filter for Named Data Networking (SNLBF) that prefixes are classified by the number of components and the length of prefix to reduce the size of collection and reduce the expansion rate of the Bloom filter by relieving the rate of collection growth. Then prefixes with different length and component numbers are mapped into different Bloom filter. In order to reduce unnecessary probes, we design the number of component steerable structure (NCS). One memory access Bloom filter and scalable Bloom filter are combined to solve scalability of name lookup engine and speed up name lookup. Because H 3 in scalable Bloom filter is no longer applicable, we design new hash modular arithmetic. Our evaluation results show that SNLBF can achieve high lookup speed and exhibit good scalability to large-scale prefixes table.
关键词：Name ; Data Networking (NDN) Scalable Bloom filter(SBF) One Memory ; Access;The number of component steerable structure(NCS)