Journal of Computer Science and Technology

, Volume 17, Issue 2, pp 219–226 | Cite as

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

  • Xu Ke 
  • Wu Jianping 
  • Yu Zhongchao 
  • Xu Mingwei 


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.


IP classification hash Trie-tree 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Weiss W. QoS with differentiated services.Technical Journal, 1998, 3(4): 48–62.Google Scholar
  2. [2]
    Bellovin S, Cheswick W. Network firewalls.IEEE Communications Magazine, 1994, 32(9): 50–57.CrossRefGoogle Scholar
  3. [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.Google Scholar
  4. [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.CrossRefGoogle Scholar
  5. [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. [6]
    Gupta P, McKeown N. Packet classification on multiple fields.ACM Computer Communication Review, 1999, 29(4): 146–160.CrossRefGoogle Scholar
  7. [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.Google Scholar
  8. [8]
    Srinivasn V, Varghese G, Suri Set al. Fast scalable level four switching.ACM Computer Communication Review, 1998, 28(4): 191–205.CrossRefGoogle Scholar
  9. [9]
    Woo T Y C. A modular approach to packet classification: Algorithms and results, InProceedings of IEEE Infocom’2000 2000.Google Scholar
  10. [10]
    Stevens W R. UNIX Networking Programming (2nd Edition). Prentice Hall, Inc. 1998, Vol.1.Google Scholar
  11. [11]
    Merit Inc. IPMA Statistics. Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2002

Authors and Affiliations

  • Xu Ke 
    • 1
  • Wu Jianping 
    • 1
  • Yu Zhongchao 
    • 1
  • Xu Mingwei 
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingP. R. China

Personalised recommendations