Packet classification is an important component of new Internet routers to support various services such as quality of service guarantee and virtual private network. Basically, packet classification can be considered as a process looking for the best matching filter in a filter set for several fields selected from packet header. Various data structures and search algorithms have been proposed for such multi-field packet classification. In particular, the Nested binary tuple space search algorithm presented in  was designed for two-field conflict free filter sets. The time complexity of the Nested binary search algorithm is (⌈log(w + 1)⌉)2, where W is the length of the fields. To ensure that the filter set is conflict free, the authors assumed that conflicts are resolved by adding resolution filters. In this paper, we propose a novel search algorithm which can find the best matching filter in 2⌈log(W + 1)⌉ probes. Although more resolution filters are added, empirical results for random filter sets show that our scheme requires less memory than the Nested binary search algorithm because no primary markers (and the secondary markers of primary markers) are needed.
|Number of pages||5|
|State||Published - 1 Dec 2002|
|Event||GLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan|
Duration: 17 Nov 2002 → 21 Nov 2002
|Conference||GLOBECOM'02 - IEEE Global Telecommunications Conference|
|Period||17/11/02 → 21/11/02|