A Memory Efficient Algorithm for Packet Classification (original) (raw)

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.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

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

  1. School of Electronic and Information Engineering, Beihang Univeristy,
    Zhen Xu & Jun Zhang
  2. Chinese Academy of Space Technology,
    Jun Sun

Authors

  1. Zhen Xu
  2. Jun Sun
  3. Jun Zhang

Editor information

Editors and Affiliations

  1. Department of Computer Science, The George Washington University, 801 22nd Street NW, Suite 704., 20052, Washington DC, USA
    Xiuzhen Cheng
  2. School of Information Science and Technology, Sun Yat-sen University, 510275, Guangzhou, China
    Wei Li
  3. Computer Science Department, University of Pittsburgh, PA 15260, Pittsburgh, USA
    Taieb Znati

Rights and permissions

© 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

Keywords

Publish with us