Two-dimensional packet classification algorithm using a quad-tree

1 / 17

# Two-dimensional packet classification algorithm using a quad-tree - PowerPoint PPT Presentation

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

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Two-dimensional packet classification algorithm using a quad-tree ' - amanda

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

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

Geometric algorithms

Space decomposition

Crossing filter

Building procedure

Search procedure

Update procedure

Performance

2

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

Algorithms based on heuristics
• HiCuts (Hierarchial Intelligent Cuttings)
• Tuple-space search
Geometric algorithms

Rule Table

• Cross-production algorithm

Cross-product Table

A: Search space size=2k*2k

F: Filter (Rule) size=2i*2j

Rule table

Rule in 2D space by

Src. & Dst. Prefix

Rule in 2D space by Src. & Dst. Prefix

Rules with smaller rule number have higher priorities

• Delete
• Remove rule except child pointer & linked list pointer
• Need rebuilt in a regular interval
• Insert
• Compare priority
• Crossing filter condition
Performance

ACL: Accesss control lists

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses

Performance

FW: Firewalls

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses

Performance

IPC: IP chains

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses