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. 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

3. Trie-based algorithms  H-trie (Hierarchical trie) Require back-tracking RuleF1F2 R1R1 00* R2R2 0*01* R3R3 1*0* R4R4 00*0* R5R5 1* R6R6 * Search Path (000,010) 1 110 10 0 0 0 R3R3 R6R6 R5R5 R2R2 R4R4 R1R1 0 F1-trie F2-tries

4. Algorithms based on heuristics  HiCuts (Hierarchial Intelligent Cuttings)  Tuple-space search Rule(Prefix 1,Prefix 2 )Tuple R1R1 (00*,00*)(2,2) R2R2 (0**,01*)(1,2) R3R3 (1**,0**)(1,1) R4R4 (00*,0**)(2,1) R5R5 (0**,1**)(1,1) R6R6 (***,1**)(0,1) TupleRule set (0,1){R 6 } (1,1){R 3,R 5 } (1,2){R 2 } (2,1){R 4 } (2,2){R 1 }

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

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

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

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

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

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

11. Priority-based quad-tree (PQT) Building procedure The quad-tree by AQT The quad-tree by PQT 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 M : Memory requirement T wst : Number of memory accesses in worst-case T avg : Average number of memory accesses ACL: Accesss control lists

16. Performance M : Memory requirement T wst : Number of memory accesses in worst-case T avg : Average number of memory accesses FW: Firewalls

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