Sum-Up Counting Bloom Filter-Based Name Lookup Method for Named Data Networking

2018 ◽  
Vol 11 (2) ◽  
pp. 176-180
Author(s):  
Tingting Wu ◽  
Lang Zhang ◽  
Jianyun Lei ◽  
Rui Hou ◽  
Zhongshan Song
Keyword(s):  
Bloom Filter ◽  
Named Data Networking ◽  
Name Lookup ◽  
Counting Bloom Filter ◽  
Data Networking

scholarly journals Route Prefix Caching Using Bloom Filters in Named Data Networking

2020 ◽  
Vol 10 (7) ◽  
pp. 2226
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Jinsoo Kim ◽  
Moon Sun Shin
Keyword(s):  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Named Data Networking ◽  
Next Generation Internet ◽  
Complex Process ◽  
Caching Scheme ◽  
Name Lookup ◽  
Cache Miss ◽  
Data Networking

This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure. The name lookup is a crucial function of the NDN router, which delivers a packet based on its name rather than IP address. It carries out a complex process to find the longest matching prefix for the content name. Even the size of a name prefix is variable and unbounded; thus, the name lookup is to be more complicated and time-consuming. The name lookup can be sped up by using route prefix caching, but it may cause a problem when non-leaf prefixes are cached. The proposed prefix caching scheme can cache non-leaf prefixes, as well as leaf prefixes, without incurring any problem. For this purpose, a Bloom filter is kept for each prefix. The Bloom filter, which is widely used for checking membership, is utilized to indicate the branch information of a non-leaf prefix. The experimental result shows that the proposed caching scheme achieves a much higher hit ratio than other caching schemes. Furthermore, how much the parameters of the Bloom filter affect the cache miss count is quantitatively evaluated. The best performance can be achieved with merely 8-bit Bloom filters and two hash functions.

Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking

2014 ◽  
Vol 18 (1) ◽  
pp. 102-105 ◽  
Author(s):  
Wei Quan ◽  
Changqiao Xu ◽  
Jianfeng Guan ◽  
Hongke Zhang ◽  
Luigi Alfredo Grieco
Keyword(s):  
Bloom Filter ◽  
Named Data Networking ◽  
Name Lookup ◽  
Data Networking

Spatial bloom filter in named data networking

2020 ◽  
Author(s):  
Filippo Berto ◽  
Luca Calderoni ◽  
Mauro Conti ◽  
Eleonora Losiouk
Keyword(s):  
Bloom Filter ◽  
Named Data Networking ◽  
Data Networking

scholarly journals Name Lookup in Named Data Networking: A Review

Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 85 ◽  
Author(s):  
Al-qutwani Majed ◽  
Xingwei Wang ◽  
Bo Yi
Keyword(s):  
Alternative Model ◽  
Named Data Networking ◽  
Memory Consumption ◽  
Implementation Cost ◽  
Time Efficiency ◽  
Time Processing ◽  
Name Lookup ◽  
Future Work ◽  
Open Issues ◽  
Data Networking

Named data networking (NDN) is an alternative model to the current traditional IP-based Internet by improving content distribution in a network with content name. In NDN, content is sent/received based on its name rather than its address. Forwarding is still considered the bottleneck of NDN despite the effort in naming, routing, mobility, and security. NDN requires per-packet update that is preceded by a one-name lookup operation, which results in heavy time processing. The content names consume a large amount of memory, which causes the fast growth of NDN tables. To review the current solutions for NDN name lookup, this paper explores the existing NDN approaches and architectures by using a novel classification method. Furthermore, name lookup approaches were analyzed and compared in a novel manner. This survey highlighted the issues that affect name lookup performance in NDN, such as scalability, memory consumption, time efficiency, latency, and validity. We pointed out directions for future work and open issues to improve NDN name lookup in minimizing implementation cost and enhancing performance.

scholarly journals A New Bloom Filter Architecture for FIB Lookup in Named Data Networking

2019 ◽  
Vol 9 (2) ◽  
pp. 329 ◽  
Author(s):  
Hayoung Byun ◽  
Hyesook Lim
Keyword(s):  
Network Traffic ◽  
High Speed ◽  
Bloom Filter ◽  
Future Internet ◽  
Bloom Filters ◽  
Named Data Networking ◽  
Future Internet Architecture ◽  
Massive Growth ◽  
Filter Architecture ◽  
Data Networking

Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively handling this ever-increasing network traffic. In order to realize the NDN, high-speed lookup algorithms for a forwarding information base (FIB) are crucial. This paper proposes a level-priority trie (LPT) and a 2-phase Bloom filter architecture implementing the LPT. The proposed Bloom filters are sufficiently small to be implemented with on-chip memories (less than 3 MB) for FIB tables with up to 100,000 name prefixes. Hence, the proposed structure enables high-speed FIB lookup. The performance evaluation result shows that FIB lookups for more than 99.99% of inputs are achieved without needing to access the database stored in an off-chip memory.

A partial name prefix merging and shortening for name lookup in named data networking

2017 ◽  
Vol 34 (7) ◽  
pp. 2300-2310
Author(s):  
Jenq-Muh Hsu ◽  
Jui-Yang Chang ◽  
Chih-Hung Wang
Keyword(s):  
Design Methodology ◽  
Experimental Results ◽  
Access Time ◽  
Named Data Networking ◽  
Content Type ◽  
Memory Space ◽  
Fixed Length ◽  
Content Centric Network ◽  
Name Lookup ◽  
Data Networking

Purpose Named Data Networking (NDN) is a content-centric network differing from the traditional IP-based network. It adopts the name prefix to identify, query and route the information content instead of IP-based addressing and routing. NDN provides a convenient way to access the content without knowing the originated location of the requested information. However, the length of name prefix varies. It is not like the fixed-length IP addresses that makes handling queries or searching the requested information in NDN easier. An efficient name lookup mechanism of name prefix will efficiently increase the performance of prefix identifying, name searching and content retrieving. Therefore, this paper aims to propose a partial name prefix merging and shortening scheme for enhancing the efficiency of name lookup in NDN. Design/methodology/approach To reduce the work involved in name prefix identifying, querying, storing and routing, this work adopts a cyclic redundancy check-based encoding scheme to shorten the variable length of the name prefix into a proper and fixed length of encoded numerical information. In fact, the structure of a name prefix is presented in a combination of word segments with the slash symbol. The shortening procedure of name prefix can also be applied to adjacent word segments forming fixed-length encoded data for further efficiently matching the name prefix for name lookup in NDN. Findings The experimental results show that the shorter length of encoded name prefix can effectively reduce the access time of name lookup and increasingly retrieve the corresponding named content in NDN. Through partial merging and shortening of name prefix, the length of encoded prefix name may be larger than the whole encoding of name prefix. It retains the information differences from different parts of various name prefixes. Thus, it can avoid collision problems with the same encoded information from various name prefixes. Originality/value From the experimental results, it is observed that partial merging and shortening of name prefix is useful for name look up in NDN. It can increase the efficiency of name prefix matching and retrieving in NDN. It can also save memory space to store the name prefix in an NDN node.

Sign in / Sign up

Export Citation Format

Share Document