Mobility

Grid of Segment Trees for Packet Classification

Download Now Free registration required

Executive Summary

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 2- dimensional 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, the authors propose a scheme called GST (Grid of Segment Trees).

  • Format: PDF
  • Size: 313.85 KB