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

Hayoung Byun,Hyesook Lim

doi:10.3390/app9020329

Abstract

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.

Highlights

On the Internet, massive multimedia contents are being widely transferred, and the use of mobile applications is becoming increasingly popular
For the implementation of the level-priority trie (LPT) and the hash table shown in Figure 2, we propose using two functional Bloom filters: a level Bloom filter (l-BF) and a port Bloom filter (p-BF)
A new Bloom filter-based algorithm is proposed for the forwarding information base (FIB) lookup

Summary

Introduction

On the Internet, massive multimedia contents are being widely transferred, and the use of mobile applications is becoming increasingly popular. The amount of Internet traffic requiring high speed data transfer is increasing exponentially. Since the Internet is based on a host-based communication infrastructure and forwards packets using IP addresses, transmission bottlenecks can occur if multiple users repeatedly request the same contents to a single host. Internet architecture [1,2,3]. The NDN is an Internet architecture used to distribute content requests to different nodes in a network that had previously been concentrated on content sources. The NDN architecture effectively reduces network traffic by storing contents in network nodes such as routers, and repetitively providing the contents requested by different users

Objectives

Findings

Discussion

Conclusion