Routers can likewise function as firewalls and perform variety of operations on the incoming and outgoing packets. On the off chance that when every one of the packets share common header attributes, it is named as a packet flow. With a specific end goal to classify a packet, routers perform a query on a classifier table utilizing at least one fields from the packet header to classify the packet into its relating flow. A classifier is a set of rules which distinguish each flow and the fitting actions to be taken for any packet having belonging to that flow. The paper analyzes the problem of packet classification and different proposed systems for the same.

Packet classification, dimensions, fields, flows, prefixes

[1] T.Y.C. Woo, “A modular approach to packet classification algortithms”, Bell Laboratories, Lucent Technologies.
[2] P. Gupta and N. McKeown, “Packet Classification using Hierarchical Intelligent Cuttings”, IEEE Micro, pp 34-41, vol. 20, no.1 , January/February2000.
[3] D.Medhi, K.Ramasamy, “Network Routing Algorithms Protocols and Architectures”, Morgan Kauffman Series on Networking, pp. 567-579; pp. 704 March 2007.
[4] Kim, K.C. Claffy, M. Formenkov, D. Barman, M. Faloutsos, and K. Lee, “Internet traffic demysitfied : Myths, caveats, and best practices,” ACM Conext, 2008.
[5] S. Sahni, K.S. Kim, and H. Lu, ”Data structures for onedimensional packet classification using most specificrule matching,” Proc. Parallel Architectures, Algorithms and Networks (I-SPAN ’02), pp. 1-12, May 2002, doi:10.1109/ISPAN.2002.1004254.
[6] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, ”Fast and scalable layer four switching,” Proc. ACM Conf. Applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’99), pp. 191-202, Sep. 1999, doi:10.1145/285237.285282.
[7] D.E. Taylor and J.S. Turner, ”Scalable Packet Classification using Distributed Crossproducting of Field Labels,” Proc. IEEE Conf. Computer and Communications Societies (INFOCOM ’05), pp 269-280, Mar. 2005, doi:10.1109/INFCOM.2005.1497898
[8] J. Xu, M. Singhal, and J. Degroat, ”A novel cache architecture to support layer-four packet classification at memory access speeds,” Proc. IEEE Conf. Computer and Communications Societies (INFOCOM ’00), pp. 1445-1454, Mar. 2000, doi:10.1109/INFCOM.2000.832542.
[9] D. Rovniagin and A. Wool, ”The Geometric Efficient Matching Algorithm for Firewalls,”, IEEE Trans. Dependable and Secure Computing, vol. 8, iss. 1, Jan./Feb. 2011, pp. 147-159, doi:10.1109/TDSC.2009.28.
[10] V. Srinivasan, S. Suri, and G. Varghese, ”Packet classification using tuple space search,” Proc. ACM Conf. Applications, technologies, architectures, and protocols for computer communication (SIGCOMM ’99), pp. 135-146, Aug. 1999, doi:10.1145/316188.316216.
[11] L. Choi, H. Kim, S. Kim, and M.H. Kim, ”Scalable Packet Classification Through Rulebase Partitioning Using the Maximum Entropy Hashing,” IEEE/ACM Trans. Networking, vol 17, iss. 6, Dec. 2009, doi:10.1109/TNET.2009.2018618.