Fast diagonal packet classification on tuple space - dealing with conflict free filters

Quality of service (QoS) is an imperative feature by must newly emerging applications. The first step to provide QoS is to distinguish packets into different data flows, called packet classification. There are many algorithms in multi-dimensional packet classification. Among those algorithms, we can see the tradeoffs between lookup speeds, memory consumption, and update time. In this paper, we proposed a fast algorithm for two-dimensional lookup in tuple space to deal with conflict-free filters. It can achieve O(log w) lookup time while maintaining O(nlog w) memory consumption.