Two dimensional packet classification algorithm using a quad tree
Download
1 / 17

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


  • 97 Views
  • Uploaded on

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

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

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


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

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
Outline quad-tree

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


Trie based algorithms

Search Path quad-tree

(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
Algorithms based on heuristics quad-tree

  • HiCuts (Hierarchial Intelligent Cuttings)

  • Tuple-space search


Geometric algorithms
Geometric algorithms quad-tree

Rule Table

  • Cross-production algorithm

Cross-product Table


Area based quad tree aqt space decomposition
Area-based quad-tree (AQT) quad-tree Space decomposition


Area based quad tree aqt crossing filter
Area-based quad-tree (AQT) quad-tree Crossing filter

A: Search space size=2k*2k

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


Area based quad tree aqt crossing filter1
Area-based quad-tree (AQT) quad-tree Crossing filter


Priority based quad tree pqt building procedure
Priority-based quad-tree (PQT) quad-tree Building procedure

Rule table

Rule in 2D space by

Src. & Dst. Prefix


Priority based quad tree pqt building procedure1
Priority-based quad-tree (PQT) quad-tree Building procedure

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

The quad-tree by AQT


Priority based quad tree pqt building procedure2
Priority-based quad-tree (PQT) quad-tree Building procedure

The quad-tree by PQT

The quad-tree by AQT

Rules with smaller rule number have higher priorities


Priority based quad tree pqt building procedure3
Priority-based quad-tree (PQT) quad-tree Building procedure

The quad-tree by PQT


Priorty based quad tree pqt search procedure
Priorty-based quad-tree (PQT) quad-tree Search procedure


Priority based quad tree pqt update procedure
Priority-based quad-tree (PQT) quad-tree Update procedure

  • Delete

    • Remove rule except child pointer & linked list pointer

    • Need rebuilt in a regular interval

  • Insert

    • Compare priority

    • Crossing filter condition


Performance
Performance quad-tree

ACL: Accesss control lists

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses


Performance1
Performance quad-tree

FW: Firewalls

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses


Performance2
Performance quad-tree

IPC: IP chains

M : Memory requirement

Twst : Number of memory accesses in worst-case

Tavg : Average number of memory accesses


ad