1 / 17

Two-dimensional packet classification algorithm using a quad-tree

Two-dimensional packet classification algorithm using a quad-tree. Author: Hyesook Lim,Min Young Kang and Changhoo Yim Publisher: Computer Communications , 2007 Presenter: Chun-Yi Li Date: 2008/12/10. Outline. Related Works Trie-based algorithms Algorithms based on heuristics

amanda
Télécharger la présentation

Two-dimensional packet classification algorithm using a quad-tree

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. Two-dimensional packet classification algorithm using a quad-tree Author:Hyesook Lim,Min Young Kang and Changhoo Yim Publisher:Computer Communications, 2007 Presenter: Chun-Yi Li Date: 2008/12/10

  2. Outline Related Works Trie-based algorithms Algorithms based on heuristics Geometric algorithms Area-based quad-tree (AQT) Space decomposition Crossing filter Priority-based quad-tree (PQT) Building procedure Search procedure Update procedure Performance 2

  3. Search Path (000,010) 0 1 F1-trie 0 0 1 1 0 0 R4 0 1 R5 R6 R3 R2 R1 Trie-based algorithms • H-trie (Hierarchical trie) • Require back-tracking F2-tries

  4. Algorithms based on heuristics • HiCuts (Hierarchial Intelligent Cuttings) • Tuple-space search

  5. Geometric algorithms Rule Table • Cross-production algorithm Cross-product Table

  6. Area-based quad-tree (AQT)Space decomposition

  7. Area-based quad-tree (AQT)Crossing filter A: Search space size=2k*2k F: Filter (Rule) size=2i*2j

  8. Area-based quad-tree (AQT)Crossing filter

  9. Priority-based quad-tree (PQT)Building procedure Rule table Rule in 2D space by Src. & Dst. Prefix

  10. Priority-based quad-tree (PQT)Building procedure Rule in 2D space by Src. & Dst. Prefix The quad-tree by AQT

  11. Priority-based quad-tree (PQT)Building procedure The quad-tree by PQT The quad-tree by AQT Rules with smaller rule number have higher priorities

  12. Priority-based quad-tree (PQT)Building procedure The quad-tree by PQT

  13. Priorty-based quad-tree (PQT)Search procedure

  14. Priority-based quad-tree (PQT)Update procedure • Delete • Remove rule except child pointer & linked list pointer • Need rebuilt in a regular interval • Insert • Compare priority • Crossing filter condition

  15. Performance ACL: Accesss control lists M : Memory requirement Twst : Number of memory accesses in worst-case Tavg : Average number of memory accesses

  16. Performance FW: Firewalls M : Memory requirement Twst : Number of memory accesses in worst-case Tavg : Average number of memory accesses

  17. Performance IPC: IP chains M : Memory requirement Twst : Number of memory accesses in worst-case Tavg : Average number of memory accesses

More Related