NDN에서의 이름 검색을 위한 레벨 우선순위 트라이를 사용한 이중 블룸필터

Network traffic has rapidly been increasing in recent years because of massive growth in mobile applications and video streaming services. Named data networking(NDN) technology was proposed as one of the future Internet architectures to handle effectively the ever-increasing network traffic. In order to realize NDN, a high-speed lookup architecture for a forwarding information base (FIB) is essential. This paper proposes a level-priority trie (LPT) and a 2-stage Bloom filter architecture implementing the LPT. The proposed 2-stage Bloom filter architecture is implemented with internal memories only and completes the name lookup without accessing an external memory. Hence, the proposed structure achieves high-speed name lookup performance for the FIB.