skip to main content
article

Algorithms for advanced packet classification with ternary CAMs

Published:22 August 2005Publication History
Skip Abstract Section

Abstract

Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching Access Control Lists (ACLs). In this paper, we propose algorithms for addressing two important problems that are encountered while using TCAMs: reducing range expansion and multi-match classification.Our first algorithm addresses the problem of expansion of rules with range fields to represent range rules in TCAMs, a single range rule is mapped to multiple TCAM entries, which reduces the utilization of TCAMs. We propose a new scheme called Database Independent Range PreEncoding (DIRPE) that, in comparison to earlier approaches, reduces the worst-case number of TCAM entries a single rule maps on to. DIRPE works without prior knowledge of the database, scales when a large number of ranges is present, and has good incremental update properties.Our second algorithm addresses the problem of finding multiple matches in a TCAM. When searched, TCAMs return the first matching entry; however, new applications require either the first few or all matching entries. We describe a novel algorithm, called Multi-match Using Discriminators (MUD), that finds multiple matches without storing any per-search state information in the TCAM, thus making it suitable for multi-threaded environments. MUD does not increase the number of TCAM entries needed, and hence scales to large databases.Our algorithms do not require any modifications to existing TCAMs and are hence relatively easy to deploy. We evaluate the algorithms using real-life and random databases.

References

  1. F. Baboescu, S. Singh, and G. Varghese. Packet Classification for Core Routers: Is there an Alternative to CAMs? In Proc. of IEEE INFOCOM, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. Beale. Snort 2.1 Intrusion Detection, Second Edn. Syngress, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Bolaria and L. Gwennap. A Guide to Search Engines and Networking Memory. http://www.linleygroup.com/Reports/memory_guide.html, April 2004.Google ScholarGoogle Scholar
  4. Computer Associates. eTrust Intrusion Detection System. http://www3.ca.com.Google ScholarGoogle Scholar
  5. Cypress Semiconductor Corp. Content addressable memory. http://www.cypress.com/.Google ScholarGoogle Scholar
  6. Dell'oro. Layer3 Switch Router Market. July 2004.Google ScholarGoogle Scholar
  7. W. Eatherton. Full Tree Bit Map: Hardware/Software IP Lookup Algorithms with Incremental Updates. EE Masters Thesis, Washington University, April 1999.Google ScholarGoogle Scholar
  8. P. Gupta and N. McKeown. Packet Classification on Multiple Fields. In Proc. of ACM SIGCOMM, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Integrated Device Technology, Inc. Content addressable memory. http://www.idt.com/.Google ScholarGoogle Scholar
  10. Intel Corp. Intel IXP2800 Network Processor. http://www.intel.com/design/network/products/npfamily/ixp2800.htm.Google ScholarGoogle Scholar
  11. H. Liu. Efficient Mapping of Range Classifier into Ternary-CAM. In Proc. of Hot Interconnects, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Netlogic Microsystems. Content addressable memory. http://www.netlogicmicro.com/.Google ScholarGoogle Scholar
  13. S. Nilsson and G. Karlsson. Fast Address Look-Up for Internet Routers. Proceedings of IEEE Broadband Communications'98, Stuttgart, Germany, April 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. L. Qiu, G. Varghese, and S. Suri. Fast Firewall Implementations for Software and Hardware-based Routers. In Proc. of ICNP, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Singh, F. Baboescu, G. Varghese, and J. Wang. Packet Classification using Multidimensional Cutting. In Proc. of ACM SIGCOMM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. E. Spitznagel, D. Taylor, and J. Turner. Packet Classification Using Extended TCAMs. In Proc. of ICNP, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. V. Srinivasan and G. Varghese. Faster IP Lookups using Controlled Prefix Expansion. ACM TOCS, February 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel. Fast and Scalable Layer Four Switching. In Proc. of ACM SIGCOMM, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. D. E. Taylor. Survey and Taxonomy of Packet Classification Techniques. Technical Report WUCSE-2004-24, Washington Univ., St. Louis, May 2004.Google ScholarGoogle Scholar
  20. D. E. Taylor and J. Turner. Scalable Packet Classification using Distributed Crossproducting of Field Labels. Technical Report WUCSE-2004-38, Washington Univ., St. Louis, 2004.Google ScholarGoogle Scholar
  21. P. Tsuchiya. A Search Algorithm for Table Entries with Non-contiguous Wildcarding. Unpublished document, 1992.Google ScholarGoogle Scholar
  22. J. van Lunteren and T. Engbersen. Fast and Scalable Packet Classification. IEEE JSAC, 21:560--571, May 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. G. Varghese. Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann Publishers, Inc., 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. T. Y. C. Woo. A Modular Approach to Packet Classification: Algorithms and Results. In Proc. of IEEE INFOCOM, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  25. F. Yu and R. H. Katz. Efficient Multi-Match Packet Classification with TCAM. In Proc. of HotI, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Algorithms for advanced packet classification with ternary CAMs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 35, Issue 4
      Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
      October 2005
      324 pages
      ISSN:0146-4833
      DOI:10.1145/1090191
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
        August 2005
        350 pages
        ISBN:1595930094
        DOI:10.1145/1080091

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 August 2005

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader