Tuple pruning using bloom filters for packet classification

Hyesook Lim, So Yeon Kim

Research output: Contribution to journalArticlepeer-review

35 Scopus citations


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.

Original languageEnglish
Article number5467010
Pages (from-to)48-58
Number of pages11
JournalIEEE Micro
Issue number3
StatePublished - May 2010

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) through a grant funded by the Korean government (2010-0000483) and by the Korean Ministry of Knowledge Economy under the HNRC-ITRC support program supervised by the NIPA (NIPA-2010-C1090-1011-0010).


  • Bloom filter
  • hardware
  • packet classification
  • tuple pruning
  • tuple space search


Dive into the research topics of 'Tuple pruning using bloom filters for packet classification'. Together they form a unique fingerprint.

Cite this