Skip to main content

A Memory Efficient Algorithm for Packet Classification

  • Conference paper
Book cover Wireless Algorithms, Systems, and Applications (WASA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4138))

Abstract

In order to provide more value added services, the Internet needs to classify packets into flows for different treatment. High performance packet classification algorithms for large classifiers and edge classifiers are highly demanded.

In this paper, we will describe a new algorithm for packet classification that makes use of bits distribution features. It is a high level classification method. It always takes the bits from every dimension into account, instead of constraining the search process in some of the dimensions at every stage. The experiments provide the evidence that it has outstanding performance even for large edge classifiers. It is also scalable to IPv6.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gupta, P., McKeown, N.: Packet classification using hierarchical intelligent cuttings. In: Proc. of Hot Interconnects (1999)

    Google Scholar 

  2. Gupta, P., McKeown, N.: Packet Classification on Multiple Fields. In: Proc. of Sigcomm, Computer Communication Review (1999)

    Google Scholar 

  3. Baboescu, F., Singh, S., Varghese, G.: Packet classification for core routers: Is there an alternative to CAMs? In: Proc.of INFOCOM (2003)

    Google Scholar 

  4. Singh, S., Baboescu, F., Varghese, G., Wang, J.: Packet Classification Using Multidimensional Cutting. In: Proc. of ACM Sigcomm (2003)

    Google Scholar 

  5. Woo, T.: A modular approach to packet classification: Algorithms and results. In: Proc. of INFOCOM (2000)

    Google Scholar 

  6. Stiliadis, D., Lakshman, T.V.: High-speed policy-based packet forwarding using efficient multi-dimensional range matching. In: Proc. of ACM Sigcomm (1998)

    Google Scholar 

  7. Lunteren, J.V., Engbersen, T.: Fast and Scalable Packet Classification. IEEE Journal on Selected Areas in Communications (May 2003)

    Google Scholar 

  8. Srinivasan, V., Suri, S., Varghese, G., Waldvogel, M.: Fast and Scalable Layer for Switching. In: Proc. of ACM Sigcomm (September 1998)

    Google Scholar 

  9. Feldman, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: Proc. of INFOCOM (2000)

    Google Scholar 

  10. Xu, Z.: Efficient Table Algorithms for the Next Generation IP Networks, Ph.D Thesis (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, Z., Sun, J., Zhang, J. (2006). A Memory Efficient Algorithm for Packet Classification. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_13

Download citation

  • DOI: https://doi.org/10.1007/11814856_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37189-2

  • Online ISBN: 978-3-540-37190-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics