View : 120 Download: 0

A new bloom filter architecture for FIB lookup in named data networking

Title
A new bloom filter architecture for FIB lookup in named data networking
Authors
Byun H.Lim H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2019
Journal Title
Applied Sciences (Switzerland)
ISSN
2076-3417JCR Link
Citation
Applied Sciences (Switzerland) vol. 9, no. 2
Keywords
Bloom filterFunctional Bloom filterNamed data networkingPriority trie
Publisher
MDPI AG
Indexed
SCIE; SCOPUS scopus
Document Type
Article
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. © 2019 by the authors.
DOI
10.3390/app9020329
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE