TY - GEN
T1 - Markers-based space decomposition algorithm
T2 - 2006 Workshop on High Performance Switching and Routing, HPSR 2006
AU - Jelassi, Ons
AU - Paul, Olivier
PY - 2006/1/1
Y1 - 2006/1/1
N2 - Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developped at Washington university. We show how this algorithm performs improved search times without any limitation in terms of incremental updates.
AB - Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developped at Washington university. We show how this algorithm performs improved search times without any limitation in terms of incremental updates.
UR - https://www.scopus.com/pages/publications/41549126025
U2 - 10.1109/hpsr.2006.1709679
DO - 10.1109/hpsr.2006.1709679
M3 - Conference contribution
AN - SCOPUS:41549126025
SN - 0780395697
SN - 9780780395695
T3 - 2006 Workshop on High Performance Switching and Routing, HPSR 2006
SP - 43
EP - 48
BT - 2006 Workshop on High Performance Switching and Routing, HPSR 2006
PB - IEEE Computer Society
Y2 - 7 June 2006 through 9 June 2006
ER -