FRFC: fast table building algorithm for recursive flow classification

Authors:
Wooguil Pak;Saewoong Bahk
Affiliations:
Jangwee Research Institute for National Defence, Ajou University, Korea;Department of Electrical Engineering and Computer Science, INMC, Seoul National University, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 2
Cited 0

Packet classification on multiple fields

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using multidimensional cutting

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Policy lookup is a very essential function in packet forwarding and network security. As it is becoming a main cause of bottleneck in many network systems, this letter introduces a new policy lookup algorithm called FRFC (Fast table building for Recursive Flow Classification). Although it is based on RFC which shows the best policy lookup speed but the worst policy table update speed, it achieves high performance in table update as well as policy lookup. FRFC divides the whole rule set into smaller sub-rule sets and by doing so, it speeds up the table building time by 50 times compared to RFC when the considered rule set size is 10,000. With the rule set size increasing, the performance gap becomes larger.