Grid of Segment Trees for Packet Classification

—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should be classified into flows according to a set of pre-defined rules. Grid-of-tries (GoT) is one of the traditional algorithmic schemes for solving 2dimensional packet classification problem. The advantage of GoT is that it uses the switch pointers to avoid backtracking operation during the search process. However, the primary data structure of GoT is base on binary tries. The traversal of binary tries decreases the performance of GoT due to the heights of binary tries are usually high. In this paper, we propose a scheme called GST (Grid of Segment Trees). GST modifies the original GoT by replacing the binary tries with segment trees. The heights of segment trees are much shorter than those of binary tries. As a result, the proposed GST can inherit the advantages of GoT and segment trees to achieve better performa...

• Type: Conference
• Year: 2010
• Where: AINA
• Authors: Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
• Keywords: AINA 2010, Binary Tries, Classification Problem, Computer Networks, Segment Tree