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. In this paper, we investigate the impact of built-in markers and associated pre-computation mechanisms on such an algorithm. We found that, if the nested binary search algorithm employs unified markers and identical pre-computation manner for them, the search process may result in a "no match" while there exist matching filters. The incorrect decision is caused by conflicts between some markers and filters. This problem can be resolved by adding resolution filters. We present in this paper a necessary and sufficient condition to determine whether or not markers generated by a filter conflict with another filter. Besides, we further 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.
|頁（從 - 到）||325-331|
|期刊||IEEE International Conference on Communications|
|出版狀態||Published - 18 七月 2003|
|事件||2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States|
持續時間: 11 五月 2003 → 15 五月 2003