Abstract
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.
Original language | English |
---|---|
Title of host publication | ANCS 2015 - 11th 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 183-184 |
Number of pages | 2 |
ISBN (Electronic) | 9781467366335 |
DOIs | |
State | Published - 18 May 2015 |
Event | 11th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2015 - Oakland, United States Duration: 7 May 2015 → 8 May 2015 |
Publication series
Name | ANCS 2015 - 11th 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems |
---|
Conference
Conference | 11th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2015 |
---|---|
Country/Territory | United States |
City | Oakland |
Period | 7/05/15 → 8/05/15 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
Keywords
- area-based quad-trie
- Bloom filter
- leaf-pushing
- packet classification