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

• Main Authors: Hayoung Byun, Hyesook Lim
• Format: Article
• Language: English
• Published: MDPI AG 2019-01-01
• Series: Applied Sciences
• Subjects: Bloom filter; named data networking; functional Bloom filter; priority trie
• Online Access: http://www.mdpi.com/2076-3417/9/2/329

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.