Fast packet classification using bloom filters

@article{Dharmapurikar2006FastPC,
  title={Fast packet classification using bloom filters},
  author={Sarang Dharmapurikar and Haoyu Song and Jonathan S. Turner and John W. Lockwood},
  journal={2006 Symposium on Architecture For Networking And Communications Systems},
  year={2006},
  pages={61-70}
}
Ternary content addressable memory (TCAM), although widely used for general packet classification, is an expensive and high power-consuming device. Algorithmic solutions which rely on commodity memory chips are relatively inexpensive and power-efficient but have not been able to match the generality and performance of TCAMs. Therefore, the development of fast and power-efficient algorithmic packet classification techniques continues to be a research subject. In this paper we propose a new… 

Figures and Tables from this paper

Real Time Packet Classification and Analysis based on Bloom Filter for Longest Prefix Matching
TLDR
A new packet classification that simultaneously supports high scalability and fast classification performance by using Bloom Filter and performance analysis results show that the proposed algorithm enables network and security systems to support heavy traffic in the most effective manner.
An efficient tuple pruning scheme for packet classification using on-chip filtering and indexing
TLDR
A new tuple pruning based packet classification algorithm is proposed that can achieve much reduced off- chip access per-lookup even at high load by adopting a better compact structure on-chip and Cuckoo hash off-chip.
Memory Aware Packet Matching Architecture for High-Speed Networks
TLDR
This paper proposes a novel parallel hardware architecture for hash-based exact match classification of multiple packets per clock cycle with reduced memory replication requirements and shows that the proposed approach can use memory very efficiently and scales exceptionally well with increased record capacities.
Fast and scalable packet classification using perfect hash functions
TLDR
A new hardware-based algorithm for packet classification based on problem decomposition and aimed at the highest network speeds is proposed, with a unique property of the algorithm is the constant time complexity in terms of external memory accesses.
Energy-Efficient Multi-Pipeline Architecture for Terabit Packet Classification
TLDR
This paper optimize the HyperCuts algorithm, which is considered among the most scalable packet classification algorithms, and build a decision tree with a bounded height, and proposes a partitioning-based multi-pipeline architecture for energy-efficient packet classification.
Efficient packet classification on FPGAs also targeting at manageable memory consumption
TLDR
A novel FPGA-oriented method for packet classification that can deal with rules involving multiple fields that first groups the rules based on their number of important fields, then attempts to match two fields at a time and finally combines the constituent results to identify longer matches.
Power-efficient range-match-based packet classification on FPGA
  • Yun Qu, V. Prasanna
  • Computer Science
    2015 25th International Conference on Field Programmable Logic and Applications (FPL)
  • 2015
TLDR
A high-performance and power-efficient packet classification engine on FPGA that consumes 30% of the power without sacrificing the throughput and can achieve 250 Million Packets Per Second (MPPS) throughput.
A FPGA-based Parallel Architecture for Scalable High-Speed Packet Classification
  • Weirong Jiang, V. Prasanna
  • Computer Science
    2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors
  • 2009
TLDR
This paper exploits the modern FPGA technology and presents a partitioning-based parallel architecture for scalable and high-speed packet classification by proposing a coarse-grained independent sets algorithm and then combining it seamlessly with the cross-producting scheme.
Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification
TLDR
An algorithm using Bloom filters along with the binary search on levels to multiple disjoint tries is proposed for ACL, FW, IPC sets with about 1000, 5000, and 10000 rules, and performance evaluation result shows that the search performance is improved by 21 to 33 percent by adding Bloom filters.
A High-Speed and Memory Efficient Pipeline Architecture for Packet Classification
TLDR
A set pruning trie based pipelined architecture called Set Pruning Multi-Bit Trie (SPMT) is proposed for multi-field packet classification and two rule grouping schemes to reduce rule duplications in SPMT are proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
SSA: a power and memory efficient scheme to multi-match packet classification
TLDR
The main idea of SSA is that it splits filters into multiple groups and performs separate TCAM lookups into these groups, resulting in low TCAM memory usage and low power consumption.
Efficient multi-match packet classification with TCAM
  • Fang Yu, R. Katz
  • Computer Science
    Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects
  • 2004
TLDR
This work presents a solution based on ternary content addressable memory (TCAM), which produces multi-match classification results with only one TCAM lookup and one SRAM lookup per packet - about ten times fewer memory lookups than a pure software approach.
Algorithms for advanced packet classification with ternary CAMs
TLDR
A novel algorithm is described, called Multi-match Using Discriminators (MUD), that finds multiple matches without storing any per-search state information in the TCAM, thus making it suitable for multi-threaded environments.
Packet classification using tuple space search
TLDR
The Pruned Tuple Space search is the only scheme known to us that allows fast updates and fast search times, and an optimal algorithm is described, called Rectangle Search, for two-dimensional filters.
Scalable packet classification using distributed crossproducing of field labels
  • David E. Taylor, J. Turner
  • Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
Distributed crossproducing of field labels (DCFL) is introduced, a novel combination of new and existing packet classification techniques that leverages key observations of the structure of real filter sets and takes advantage of the capabilities of modern hardware technology.
ClassBench: a packet classification benchmark
TLDR
This work presents ClassBench, a suite of tools for benchmarking packet classification algorithms and devices, and seeks to eliminate the significant access barriers to realistic test vectors for researchers and initiate a broader discussion to guide the refinement of the tools and codification of a formal benchmarking methodology.
ClassBench: A Packet Classification Benchmark
TLDR
This work presents ClassBench, a suite of tools for benchmarking packet classification algorithms and devices and seeks to eliminate the significant access barriers to realistic test vectors for researchers and initiate a broader discussion to guide the refinement of the tools and codification of a formal benchmarking methodology.
Efficient multimatch packet classification and lookup with TCAM
TLDR
The proposed TCAM-based scheme produces multimatch classification results with about 10 times fewer memory lookups than a pure software approach, and the scheme for removing negation in rule sets saves up to 95 percent of the TCAM space used by a straightforward implementation.
Fast hash table lookup using extended bloom filter: an aid to network processing
TLDR
This work presents a novel hash table data structure and lookup algorithm which improves the performance over a naive hash table by reducing the number of memory accesses needed for the most time-consuming lookups, which allows designers to achieve higher lookup performance for a given memory bandwidth.
Longest prefix matching using bloom filters
TLDR
This work introduces the first algorithm that is aware of to employ Bloom filters for longest prefix matching (LPM), and shows that use of this algorithm for Internet Protocol (IP) routing lookups results in a search engine providing better performance and scalability than TCAM-based approaches.
...
1
2
3
...