150 likes | 290 Vues
This paper presents a novel two-dimensional packet classification algorithm leveraging a Priority-Based Quad-Tree (PQT) structure. It outlines the area-based quad-tree concept and details the updated PQT procedures for insertion, deletion, and querying based on priority and crossing filters. The performance evaluation metrics demonstrate improved space decomposition and efficiency in packet classification tasks, highlighting the advantages of the proposed approach over traditional methods. The research is significant for advancements in network traffic management.
E N D
Two-dimensional packet classification algorithm using a quad-tree Authors: Hyesook Lim,Min Young Kang and Changhoo Yim Publisher: computer communications Present: Kia-Tso Chang Date: September 27 2007
outline • Area-based quad-tree (AQT) • Proposed priority-based quad-tree (PQT) • Update procedure • Performance evaluation
space decomposition he she his hers
space decomposition 0 * 1 0 0 * 1 0 1 0 1 0 1 1 1 1 * 00* R0 (1010* , 01*) R1 (* , 11*) 01* 10* 11*
Crossing filter (CF) R1 R0
update • Delete • Insert • By priority • By crossing filter