A non-collision hash trie-tree based fast IP classification algorithm

Authors:
Xu Ke;Wu Jianping;Yu Zhongchao;Xu Mingwei
Affiliations:
Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 5
Cited 1

Fast and scalable layer four switching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Interdomain Access Control with Policy Routing

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
UNIX Network Programming, Vol. 1

UNIX Network Programming, Vol. 1
Billing users and pricing for TCP

IEEE Journal on Selected Areas in Communications

ERFC: an enhanced recursive flow classification algorithm

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the development of network applications, routers must support such functions as firewalls, provision of QoS, traffic billing, etc. All these functions need the classification of IP packets, according to how different the packets are processed subsequently, which is determined. In this article, a novel IP classification algorithm is proposed based on the Grid of Tries algorithm. The new algorithm not only eliminates original limitations in the case of multiple fields but also shows better performance in regard to both time and space. It has better overall performance than many other algorithms.