High-speed packet classification using binary search on length

Authors:
Hyesook Lim;Ju Hyoung Mun
Affiliations:
Ewha Womans University, Seoul, Korea;Samsung Electronics, Suwon-city, Korea
Venue:
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Year:
2007

Citing 8
Cited 7

Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using tuple space search

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Classifying Packets with Hierarchical Intelligent Cuttings

IEEE Micro
Space Decomposition Techniques for Fast Layer-4 Switching

PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
Packet classification using multidimensional cutting

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Two-dimensional packet classification algorithm using a quad-tree

Computer Communications
Algorithms for packet classification

IEEE Network: The Magazine of Global Internetworking

Power efficient packet classification using cascaded bloom filter and off-the-shelf ternary CAM for WDM networks

Computer Communications
Hierarchical packet classification using a Bloom filter and rule-priority tries

Computer Communications
400 Gb/s Programmable Packet Parsing on a Single FPGA

Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
PCIU: hardware implementations of an efficient packet classification algorithm with an incremental update capability

International Journal of Reconfigurable Computing
A new hierarchical packet classification algorithm

Computer Networks: The International Journal of Computer and Telecommunications Networking
Managing hybrid packet filter's specifications

International Journal of Security and Networks
An impulse-c hardware accelerator for packet classification based on fine/coarse grain optimization

International Journal of Reconfigurable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packet classification is one of the major challenges for next generation routers since it involves complicated multi-dimensional search as well as it should be performed in wire-speed for all incoming packets. Area-based quad-trie is an excellent algorithm in the sense that it constructs a two-dimensional trie using source and destination prefix fields for packet classification. However, it does not achieve good search performance since search is linearly performed for prefix length. In this paper, we propose a new packet classification algorithm which applies binary search on prefix length to the area-based quad-trie. In order to avoid the pre-computation required in the binary search on length, the proposed algorithm constructs multiple disjoint tries depending on relative levels in rule hierarchy. We also propose two new optimization techniques considering rule priorities. For different types of rule sets having about 5000 rules, performance evaluation result shows that the average number of memory accesses is 18 to 67 and the memory consumption is 22 to 41 bytes per rule.