Packet classification using a bloom filter in a leaf-pushing area-based quad-trie
- 주제(키워드) area-based quad-trie , Bloom filter , leaf-pushing , packet classification
- 등재 SCOPUS
- 발행기관 Institute of Electrical and Electronics Engineers Inc.
- 발행년도 2015
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000118368
- 본문언어 영어
- Published As http://dx.doi.org/10.1109/ANCS.2015.7110131
초록/요약
Packet classification is one of the most essential functions that Internet routers should perform at wire-speed for every incoming packet. An area-based quad-trie (AQT) for packet classification has an issue in search performance since many rule nodes can be encountered in a search procedure. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to improve the search performance of the leaf-pushing AQT further. The proposed algorithm builds a leaf-pushing AQT using a Bloom filter and a hash table stored in on-chip memories. The level of a rule node and a pointer to a rule database are identified by sequentially querying the Bloom filter and by accessing the hash table, respectively. © 2015 IEEE.
more