Tuple Pruning Using Bloom Filters for Packet Classification
Authors:
- 20 May 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 30 (3) , 48-59
Abstract
Tuple pruning for packet classification provides fast search and a low implementation complexity. The tuple pruning algorithm reduces the search space to a subset of tuples determined by individual field lookups that cause off-chip memory accesses. The authors propose a tuple-pruning algorithm that reduces the search space through Bloom filter queries, which do not require off-chip memory accesses.Keywords
This publication has 13 references indexed in Scilit:
- On Designing Fast Nonuniformly Distributed IP Address Lookup Hashing AlgorithmsIEEE/ACM Transactions on Networking, 2009
- ClassBench: A Packet Classification BenchmarkIEEE/ACM Transactions on Networking, 2007
- Two-dimensional packet classification algorithm using a quad-treeComputer Communications, 2007
- Packet classification using coarse-grained tuple spaces2006
- Fast packet classification using bloom filters2006
- Scalable Packet Classification for Enabling Internet Differentiated ServicesIEEE Transactions on Multimedia, 2006
- Longest prefix matching using bloom filtersIEEE/ACM Transactions on Networking, 2006
- Fast hash table lookup using extended bloom filter2005
- Efficient Multimatch Packet Classification and Lookup with TCAMIEEE Micro, 2005
- Fast and scalable layer four switchingACM SIGCOMM Computer Communication Review, 1998