Skip to main content
Log in

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

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript


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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


  1. Weiss W. QoS with differentiated services.Technical Journal, 1998, 3(4): 48–62.

    Google Scholar 

  2. Bellovin S, Cheswick W. Network firewalls.IEEE Communications Magazine, 1994, 32(9): 50–57.

    Article  Google Scholar 

  3. Jyh-haw Y, Randy C, Richard N W. Interdomain access control with policy routing. InProceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, Oct., 1997, pp. 46–52.

  4. Richard Edell, Nick McKeown, Pravin Varaiya. Billing users and pricing for TCP.IEEE Journal on Selected Areas in Communications, Sept., 1995, 13(7): 1162–1175.

    Article  Google Scholar 

  5. Xu Ke, Xiong Yong-qiang, Wu Jian-ping. Analysis of broadband IP router architecture.Journal of Software, 2000, 11(2): 179–186.

    Google Scholar 

  6. Gupta P, McKeown N. Packet classification on multiple fields.ACM Computer Communication Review, 1999, 29(4): 146–160.

    Article  Google Scholar 

  7. Bailey M L, Gopal B, Pagels M A, Peterson L L. PATHFINDER: A pattern-based packet classifier. InProceedings of the 1st Symposium on Operating System Design and Implementation. Usenix Association, 1994, pp. 95–104.

  8. Srinivasn V, Varghese G, Suri Set al. Fast scalable level four switching.ACM Computer Communication Review, 1998, 28(4): 191–205.

    Article  Google Scholar 

  9. Woo T Y C. A modular approach to packet classification: Algorithms and results, InProceedings of IEEE Infocom’2000 2000.

  10. Stevens W R. UNIX Networking Programming (2nd Edition). Prentice Hall, Inc. 1998, Vol.1.

  11. Merit Inc. IPMA Statistics.

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Xu Ke.

Additional information

This work is supported by the National “863” High-Tech Programme of China (No.863-306-ZD-07-01) and the National Natural Science Foundation of China (No.90104002).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, K., Wu, J., Yu, Z. et al. A non-collision hash trie-tree based fast IP classification algorithm. J. Comput. Sci. & Technol. 17, 219–226 (2002).

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: