Skip to main content

Advertisement

Springer Nature Link
Log in

Optimization study of a packet classification algorithm

Étude de l’optimisation d’un Algorithme de Classement de Paquet

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Abstract

Packet classification is a central function in filtering systems such as firewalls or intrusion detection mechanisms. Several mechanisms for fast packet classification have been proposed. But, existing algorithms are not always scalable to large filters databases in terms of search time and memory storage requirements.

In this paper, we present a novel multifields packet classification algorithm based on an existing algorithm called Pacars and we show its advantages compared to previously proposed algorithms. We give performance measurements using a publicly available benchmark developed at Washington University. We show how our algorithm offers improved search times without any limitation in terms of incremental updates.

Résumé

Le classement de paquets est une fonction centrale pour assurer le filtrage dans les paresfeux ou les mécanismes de détection d’intrusion. Plusieurs mécanismes visant à fournir un classement de paquets dans les plus brefs délais ont été proposés. Cependant, ces algorithmes existants ne donnent pas toujours de résultats satisfaisants en terme de temps de recherche ou de mémoire de stockage lorsque les bases de règles de classement augmentent en taille.

Dans cet article, nous présentons un nouvel algorithme de classement de paquets multichamps basé sur un algorithme existant très performant appelé Pacars et nous montrons ses avantages par rapport aux travaux précédents. Nous présentons nos mesures de performances en utilisant un jeu de tests développé à l’université de Washington. Nous montrons que notre algorithme donne de meilleurs temps de recherche tout en prenant en compte les mises à jour incrémentales dans la base de règles de classement.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hackock R., Karagiannis G., Loughney J., Van den bosch S., Next Steps in Signalling (NSIS): Framework, RFC 4080, IETF, 2005.

    Google Scholar 

  2. Rafalow S., Jason J., Vyncke E., IPSEC configuration policy information model, RFC 3585, IETF, 2003.

    Google Scholar 

  3. Waldvogel M., Varghese G., Turner J., Plattner B., Scalable high speed prefix-matching, ACM Transactions on computer Science, vol. 19, pp. 440–482, 2001.

    Google Scholar 

  4. Knuth D.E., Sorting and Searching, vol.3 of The Art of Computer Programming, Addison-Wesley, 1973.

    Google Scholar 

  5. Dharmapurikar S., Praveen K., Taylor D.E., Longest Prefix Matching Using Bloom Filters, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2003.

    Google Scholar 

  6. Stevens W.R., Wright G. R., TCP/IP illustré, Vuibert Informatique, 1998.

    Google Scholar 

  7. Van luteren J., Searching Very Large Routing Tables in Wide Embedded Memory, in proc. of Global Telecommunications Conference, vol. 3, pp 1615–1619, IEEE Globecom, 2001.

    Google Scholar 

  8. Zane F., Narlikar G., Basu A., Coolcams: power-efficient TCAMS for forwarding engines, in proc. of IEEE Infocom, vol. 1, pp. 42–52, 2003

    Google Scholar 

  9. Srinivasan V., Varghese G., Suri S., Waldvogel M., Fast and Scalable Layer Four Switching, in proc. of ACM Sigcomm, pp. 191–202, 1998.

    Google Scholar 

  10. Baboescu F., Singh S., Varghese G., Packet classification for core routers: Is there an alternative to CAMS, IEEE Infocom, 2003.

    Google Scholar 

  11. Chao H. J., Next Generation Routers, in proc. of IEEE, vol. 90 issue 9) pp 1518–1558, 2002.

    Google Scholar 

  12. Gupta P., Mckeown N., Algorithms for Packet Classification, IEEE Network, vol. 15:2, pp. 24–32, 2001.

    Google Scholar 

  13. Gupta P., Algorithms for routing lookups and packet classification, Ph D dissertation, University of Standford, 2000

    Google Scholar 

  14. Gupta P., Mckeown N., Packet Classification Using Hierarchical Intelligent Cuttings, in proc. of Hot Interconnects VII, 1999

    Google Scholar 

  15. Singh S., Baboescu F., Varghese G., Wang J., Packet Classification Using Multidimensional Cutting, in proc. of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 213–224, ACM SigComm, 2003

    Google Scholar 

  16. Woo T. Y. C., A modular Approach to Packet Classification: Algorithms and Results, in proc. of IEEE Infocom, pp. 1213–1222, 2000.

    Google Scholar 

  17. Feldmann A., Muthukrishnan S., Tradeoffs for Packet Classification, in proc. of IEEE Infocom, vol. 3, pp. 1193–1202, 2000.

    Google Scholar 

  18. Lakshman T. V., Stiliadis D., High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching, in proc. of ACM Sigcomm, pp. 203–214, 1999.

    Google Scholar 

  19. Baboescu F., Varghese G., Scalable Packet Classification, in proc. of acm Sigcomm, pp. 199–210, 2001.

    Google Scholar 

  20. Van luteren J., Engbersen T., Fast and Scalable Packet Classification, IEEE Journal on Selected Areas in Communications, vol. 21, pp. 560–571, 2003.

    Google Scholar 

  21. Taylor D.E., Turner J.S., Scalable Packet Classification using Distributed Crossproducting of Field Labels, 24th Annual Joint Conference of the IEEE Computer and Communications Societies, in proc. of IEEE Infocom, vol. 1, pp. 269–280, 2005.

    Google Scholar 

  22. Srinivasan V., Suri S., Varghese G., Packet Classification using Tuple Space Search, in proc. of ACM SigComm, pp. 135–146, 1999.

    Google Scholar 

  23. Srinivasan V., A Packet Classification and Filter Management System, in proc. of IEEE Infocom, pp. 1464–1473, 2001.

    Google Scholar 

  24. Buddhikot M., Suri S., Waldvogel M., Space Decomposition Techniques for Fast Layer-4 Switching, in proc. of IFIP Workshop on Protocols for High Speed Network, PHSN IV, pp. 25–41, 1999.

    Google Scholar 

  25. Suri S., Varghese G., Warkhede P.R., Multiway Range Trees: Scalable IP Lookup with Fast Updates, IEEE Globecom, 2001.

    Google Scholar 

  26. Taylor D.E., Turner J. S., ClassBench: A Packet Classification Benchmark, 24th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Infocom, vol. 3, pp. 2068–2079, 2005.

    Google Scholar 

  27. Sahasranaman V., Buddhikot M. M., Comparative Evaluation of Software Implementations of Layer-4 Packet Classification Schemes, 9th International Conference on Network Protocols, pp. 220–228, 2001.

    Chapter  Google Scholar 

  28. Lim H., Kang M. Y., Yim C., Two-dimensional Packet Classification Algorithm Using a Quad-tree, Computer Communications, vol. 30 pp. 1396–1405, 2007.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GET/INT, 9 rue Charles Fourier, 91011, Evry cedex, France

    Ons Jelassi & Olivier Paul

Authors
  1. Ons Jelassi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Olivier Paul
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ons Jelassi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jelassi, O., Paul, O. Optimization study of a packet classification algorithm. Ann. Telecommun. 62, 1388–1400 (2007). https://doi.org/10.1007/BF03253325

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03253325

Keywords

Mots-clés