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.

[1]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[2]  Nick McKeown,et al.  Packet classification on multiple fields , 1999, SIGCOMM '99.

[3]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[4]  George Varghese,et al.  Fast packet classification for two-dimensional conflict-free filters , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[6]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.