O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
Parallel tree search: An algorithmic approach for multi-field packet classification
Computer Communications
Packet classification using diagonal-based tuple space search
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable packet classification through rulebase partitioning using the maximum entropy hashing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The increased capacity of networks and nodes might enable us to keep pace with the growing traffic load, but the change of paradigm in IP networks towards a QoS-aware and multimedia-friendly infrastructure creates new bottlenecks in the communication path. An example of such a bottleneck is dynamic packet classification, which is fundamental to supporting any sort of QoS and value-added services. Typically, high update rates in packet classification designs have been sacrificed to achieve better search times or to reduce storage capacity requirements. By carefully analyzing current proposals, we unveil three previously neglected key design criteria for general classifiers to successfully achieve high update rates at wire speed: filter localization, nonstructural dependencies, and dynamic precomputation. We also analyze their impact in current algorithms