A non-collision hash trie-tree based fast IP classification algorithm
- 69 Downloads
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.
KeywordsIP classification hash Trie-tree
Unable to display preview. Download preview PDF.
- Weiss W. QoS with differentiated services.Technical Journal, 1998, 3(4): 48–62.Google Scholar
- 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
- Xu Ke, Xiong Yong-qiang, Wu Jian-ping. Analysis of broadband IP router architecture.Journal of Software, 2000, 11(2): 179–186.Google Scholar
- 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
- Woo T Y C. A modular approach to packet classification: Algorithms and results, InProceedings of IEEE Infocom’2000 2000.Google Scholar
- Stevens W R. UNIX Networking Programming (2nd Edition). Prentice Hall, Inc. 1998, Vol.1.Google Scholar
- Merit Inc. IPMA Statistics. http://nic.merit.edu/ipma.Google Scholar