1 / 18

Fast Packet Classification Using Bloom filters

Fast Packet Classification Using Bloom filters. Author: Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood Publisher: Architecture for networking and communications systems, Proceedings of the 2006 ACM/IEEE symposium Presenter: Yu-Ping Chiang Date: 2008/11/5. Outline.

mabli
Download Presentation

Fast Packet Classification Using Bloom filters

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Fast Packet Classification Using Bloom filters Author: Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood Publisher: Architecture for networking and communications systems, Proceedings of the 2006 ACM/IEEE symposium Presenter: Yu-Ping Chiang Date: 2008/11/5

  2. Outline • Related Work • Naive Crossproduct Algorithm • Multi-subset Crossproduct Algorithm • Nested Level Tuple Space Search (NLTSS) • NLT Merging and Crossproduct (NLTMC) • Performance • Memory Requirement • Throughput

  3. Naive Crossproduct Algorithm • Pseudo rule • A match for a prefix also match it’s shorter prefix. • Too much overhead.

  4. Naive Crossproduct Algorithm

  5. Multi-subset Crossproduct Algo.

  6. Outline • Related Work • Naive Crossproduct Algorithm • Multi-subset Crossproduct Algorithm • Nested Level Tuple Space Search (NLTSS) • NLT Merging and Crossproduct (NLTMC) • Performance • Memory Requirement • Throughput

  7. 0 1 1 1 1 1 2 1 Nested Level Tuple Space Search • Definition: • Nested Level: • # of marked ancestors of a marked node. • Always assume root is marked.

  8. Nested Level Tuple Space Search • Definition: • Nested Level Trie: • remove unmarked nodes • connecting marked node to nearest ancestor

  9. Nested Level Tuple Space Search • Definition: • Nested Level Tuple (NLT):

  10. Nested Level Tuple Space Search • Do not need crossproduct rules. • Number of NLTs is number of subsets.

  11. Nested Level Tuple Space Search • Definition: • NLT bitmap • Set if prefix or it’s sub-prefix belongs to a rule contained in this NLT. • PL/NL bit-map • 32 bits • Set at a position indicates that the prefix of corresponding length is in the rule set.

  12. Nested Level Tuple Space Search

  13. Outline • Related Work • Naive Crossproduct Algorithm • Multi-subset Crossproduct Algorithm • Nested Level Tuple Space Search (NLTSS) • NLT Merging and Crossproduct (NLTMC) • Performance • Memory Requirement • Throughput

  14. NLT Merging and Crossproduct • Bounded set numbers • Algorithm • Sort NLTs by the number of rules in them. • Pick most dense g NLTs. (g is limit # of subsets.) • Merge remaining NTL (rules) with one of fixed g NTLs. • Choose “closest” NLT • Ex: distance of [4,3,1,2,1] and [4,1,0,2,1] = |3-1| + |1-0| = 3 • If there’s a pseudo-rule threshold, try to insert rule. If exceeds threshold, don’t insert it.

  15. Outline • Related Work • Naive Crossproduct Algorithm • Multi-subset Crossproduct Algorithm • Nested Level Tuple Space Search (NLTSS) • NLT Merging and Crossproduct (NLTMC) • Performance • Memory Requirement • Throughput

  16. Memory Requirement • On-chip bits per rule: • . • For NLTSS, • Off-chip bits per item: • . • For NLTSS, • Average memory consumption • NLTSS: 32 bytes • NLTMCL: 45 bytes

  17. Throughput • Pipeline • 1st stage: LPM • 2nd stage: rule lookup • . • . • . • . Clock rate Rule lookup stage LPM stage,144 bits/rule, Burst length: 72 bits

More Related