A new bloom filter architecture for FIB lookup in named data networking
- 주제(키워드) Bloom filter , Functional Bloom filter , Named data networking , Priority trie
- 등재 SCIE, SCOPUS
- OA유형 gold, Green Submitted
- 발행기관 MDPI AG
- 발행년도 2019
- URI http://www.dcollection.net/handler/ewha/000000160715
- 본문언어 영어
- Published As http://dx.doi.org/10.3390/app9020329
- 저작권 이화여자대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
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.
more