two-dimensional packet classification algorithm using a quad-tree author: hyesook lim,min young kang...
TRANSCRIPT
Two-dimensional packet classification algorithm using a quad-tree
Author: Hyesook Lim,Min Young Kang and Changhoo YimPublisher: 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
Trie-based algorithms H-trie (Hierarchical trie)
Require back-tracking
Rule F1 F2
R1 00* 00*
R2 0* 01*
R3 1* 0*
R4 00* 0*
R5 0* 1*
R6 * 1*
Search Path(000,010)
1
1 1 0
10
0
0
0R3R6
R5
R2
R4
R1
0
F1-trie
F2-tries
Algorithms based on heuristics
HiCuts (Hierarchial Intelligent Cuttings) Tuple-space search
Rule (Prefix1,Prefix2) Tuple
R1 (00*,00*) (2,2)
R2 (0**,01*) (1,2)
R3 (1**,0**) (1,1)
R4 (00*,0**) (2,1)
R5 (0**,1**) (1,1)
R6 (***,1**) (0,1)
Tuple Rule set
(0,1) {R6}
(1,1) {R3,R5}
(1,2) {R2}
(2,1) {R4}
(2,2) {R1}
Geometric algorithms Cross-production algorithm
Cross-product Table
Rule Table
Area-based quad-tree (AQT)Space decomposition
Area-based quad-tree (AQT)Crossing filter
A: Search space size=2k*2k
F: Filter (Rule) size=2i*2j
Area-based quad-tree (AQT)Crossing filter
Priority-based quad-tree (PQT)Building procedure
Rule in 2D space by Src. & Dst. Prefix
Rule table
Priority-based quad-tree (PQT)Building procedure
The quad-tree by AQTRule in 2D space by Src. & Dst. Prefix
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
Priority-based quad-tree (PQT)Building procedure
The quad-tree by PQT
Priorty-based quad-tree (PQT)Search procedure
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
Performance
M : Memory requirementTwst : Number of memory accesses in worst-caseTavg : Average number of memory accesses
ACL: Accesss control lists
Performance
M : Memory requirementTwst : Number of memory accesses in worst-caseTavg : Average number of memory accesses
FW: Firewalls
Performance
M : Memory requirementTwst : Number of memory accesses in worst-caseTavg : Average number of memory accesses
IPC: IP chains