Back to Search
Start Over
A New Bloom Filter Architecture for FIB Lookup in Named Data Networking.
- Source :
- Applied Sciences (2076-3417); Jan2019, Vol. 9 Issue 2, p329, 18p
- Publication Year :
- 2019
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- INTERNET traffic
INFORMATION retrieval
DATA structures
Subjects
Details
- Language :
- English
- ISSN :
- 20763417
- Volume :
- 9
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Applied Sciences (2076-3417)
- Publication Type :
- Academic Journal
- Accession number :
- 134330008
- Full Text :
- https://doi.org/10.3390/app9020329