US 6,892,237 B1Grant

Method and apparatus for high-speed parsing of network messages

Issue Date:2005-05-10

•25 Claims

•7 Drawing Sheets

Abstract

A programmable pattern matching engine efficiently parses the contents of network messages for regular expressions and executes pre-defined actions or treatments on those messages that match the regular expressions. The pattern matching engine is preferably a logic circuit designed to perform its pattern matching and execution functions at high speed, e.g., at multi-gigabit per second rates. It includes, among other things, a message buffer for storing the message being evaluated, a decoder circuit for decoding and executing corresponding actions or treatments, and one or more content-addressable memories (CAMs) that are programmed to store the regular expressions used to search the message. The CAM may be associated with a second memory device, such as a random access memory (RAM), as necessary, that is programmed to contain the respective actions or treatments to be applied to messages matching the corresponding CAM entries. The RAM provides its output to the decoder circuit, which, in response, decodes and executes the specified action or treatment.

Metadata

Assignee

Cisco Technology, Inc.

Inventors

Silvano Gai
Thomas J. Edsall

Application Information

Application Number:US 09/535,810

Filing Date:2000-03-28

Priority Date:2000-03-28

Art Unit:2143

Patent Drawings (7 sheets)

Description

Background of the Invention

[0001] 1. Field of the Invention

[0002] The present invention relates generally to the field of computer networks, and more specifically, to a mechanism for performing pattern matching on network messages at high speed.

[0003] 2. Background Information

[0004] Enterprises, including businesses, governments and educational institutions, rely on computer networks to share and exchange information. A computer network typically comprises a plurality of entities interconnected by a communications media. An entity may consist of any device, such as a host or end station, that sources (i.e., transmits) and/or receives network messages over the communications media. A common type of computer network is a local area network (“LAN”) which typically refers to a privately owned network within a single building or campus. In many instances, several LANs may be interconnected by point-to-point links, microwave transceivers, satellite hook-ups, etc. to form a wide area network (“WAN”) or subnet that may span an entire city, country or continent. One or more intermediate network devices are often used to couple LANs together and allow the corresponding entities to exchange information. A bridge, for example, may be used to provide a “bridging” function between two or more LANs. Alternatively, a switch may be utilized to provide a “switching” function for transferring information between a plurality of LANs at higher speed.

[0005] Typically, the bridge or switch is a computer that includes a plurality of ports, which may be coupled to the LANs. The switching function includes receiving data at a source port that originated from a sending entity, and transferring that data to at least one destination port for forwarding to a receiving entity. Conventional bridges and switches operate at the data link layer (i.e., Layer 2) of the communications protocol stack utilized by the network, such as the Transmission Control Protocol/Internet Protocol (TCP/IP) Reference Model.

[0006] Another intermediate network device is called a router. A router is often used to interconnect LANs executing different LAN standards and/or to provide higher level functionality than bridges or switches. To perform these tasks, a router, which also is a computer having a plurality of ports, typically examines the destination address and source address of messages passing through the router. Routers typically operate at the network layer (i.e., Layer 3) of the communications protocol stack utilized by the network, such as the Internet Protocol (IP). Furthermore, if the LAN standards associated with the source entity and the destination entity are different (e.g., Ethernet versus Token Ring), the router may also re-write (e.g., alter the format of) the packet so that it may be received by the destination entity. Routers also execute one or more routing protocols or algorithms, which are used to determine the paths along which network messages are sent.

[0007] Computer networks are frequently being used to carry traffic supporting a diverse range of applications, such as file transfer, electronic mail, World Wide Web (WWW) and Internet applications, voice over IP (VoIP) and video applications, as well as traffic associated with mission-critical and other enterprise-specific applications. Accordingly, network managers are seeking ways to identify specific traffic flows within their networks so that more important traffic (e.g., traffic associated with mission-critical applications) can be identified and given higher priority to the network's resources as compared with other less critical traffic (such as file transfers and email). In addition, as computer networks get larger, there is also a need to balance the load going to various servers, such as web-servers, electronic mail servers, database servers and firewalls, so that no single device is overwhelmed by a burst in requests. Popular Web sites, for example, typically employ multiple web servers in a load-balancing scheme. If one server starts to get swamped, requests are forwarded to another server with available capacity.

[0008] Layer 4 switches or routers have been specifically developed to perform such services. In a Layer 4 switch, the device examines both the network and transport layer headers of network messages to identify the flow to which the messages belong. Such flows are often identified by examining five network/transport layer parameters (i.e., IP source address, IP destination address, source port, destination port and transport layer protocol). By examining these five parameters, a layer 4 switch can often identify the specific entities that are communicating and the particular upper layer (e.g., Layer 7) application being used by those entities. In particular, a defined set of well-known port numbers has been established at Request for Comments (RFC) 1700 for certain common applications. For example, port number 80 corresponds to the hypertext transport protocol (HTTP), which is commonly used with WWW applications, while port number 21 corresponds to the file transfer protocol (FTP).

[0009] The parsing of data packets so as to identify these network/transport layer parameters is typically performed in software by a dedicated module or library. The Internetwork Operating System (IOS™) from Cisco Systems, Inc. of San Jose, Calif. for example, includes software modules or libraries for performing such packet parsing functions. A processor, such as a central processing unit (CPU), at the network device executes the corresponding program instructions. These modules or libraries may be written in any number of well-known programming languages. The Perl programming language, in particular, is often selected because of its highly developed pattern matching capabilities. In Perl, the patterns that are being searched for are generally referred to as regular expressions. A regular expression can simply be a word, a phrase or a string of characters. More complex regular expressions include metacharacters that provide certain rules for performing the match. The period (“.”), which is similar to a wildcard, is a common metacharacter. It matches exactly one character, regardless of what the character is. Another metacharacter is the plus (“+”) symbol which indicates that the character immediately to its left may be repeated one or more times. If the data being searched conforms to the rules of a particular regular expression, then the regular expression is said to match that string. For example, the regular expression “gauss” would match data containing gauss, gaussian, degauss, etc.

[0010] Software modules and libraries can similarly be written to search for regular expressions beyond the five network/transport layer parameters described above. In particular, some enterprises wish to identify network messages that are associated with applications that have not been assigned a well-known port number. Alternatively, an enterprise may be interested in identifying messages that are directed to a specific web page of a given web site. An enterprise may also wish to identify messages that are directed to or carry a particular uniform resource locator (URL). To identify such messages, an intermediate network device must examine more than just the five network/transport layer parameters described above. That is, the actual data portions of the message(s) must be parsed for specific patterns, such as selected URLs.

[0011] It is known to incorporate software modules or libraries that have been programmed to perform such search requests into servers. However, the evaluation of individual packets through software is an impractical solution for intermediate network devices, many of which receive and process far greater volumes of traffic than servers, due to the increasing size and complexity of modern networks. That is, today's computer networks can generate hundreds if not thousands of diverse traffic flows at any given time. The use of advanced network equipment, such as fiber optic transmission links and high-speed transmission protocols, such as “Gigabit” Ethernet, which is intended to support transmission speeds up to 1000 Mbps (i.e., 1 Gbps), further increase the speeds of these traffic flows. Furthermore, regardless of the processing power of the device's CPU (e.g., 16, 32 or even 64 bit), regular expression matching can only be performed 1 byte at a time, due to programming constraints.

[0012] Thus, the current software solutions for performing regular expression matching are becoming less efficient at performing their message processing tasks as transmission rates reach such high speeds. Accordingly, a need has arisen for performing regular expression matching at the high transmission speeds of current and future computer network equipment.

Summary of the Invention

[0013] Briefly, the invention relates to a programmable pattern matching engine for efficiently parsing the contents of network messages for pre-defined regular expressions and for executing actions on messages that match those expressions. The pattern matching engine is preferably a logic circuit designed to perform its pattern matching and execution functions at high speed, e.g., at multi-gigabit per second rates. The pattern matching engine preferably includes, among other things, a regular expression storage device for storing the pre-defined regular expressions and the actions that are to be applied to messages matching those regular expressions, a message buffer for storing the current message being evaluated, and a decoder circuit for inputting the network message or portions thereof to, and for decoding and executing identified actions returned by the regular expression storage device. In a novel manner, the regular expression storage device includes one or more content-addressable memories (CAMs) that contain at least the pre-defined regular expressions. The corresponding actions may either be stored along with the regular expressions within the CAM or they may be stored within a second memory device, such as a random access memory (RAM), that is associated with the CAM. Association between the CAM and RAM is achieved by having each CAM entry identify and thus correspond to the specific RAM entry that contains the action to be applied to messages matching the regular expression contained in the respective CAM entry. The pattern matching engine, moreover, is configured such that the RAM provides its output to the decoder circuit, which decodes and executes the action contained therein.

[0014] In the illustrative embodiment, the pattern matching engine further includes a barrel shifter operating under the control of the decoder circuit and coupled to both the message buffer and the CAM. The barrel shifter essentially provides a moveable window for revealing a selected portion of the message currently stored in the message buffer. In operation, the decoder circuit operates the barrel shifter so as to input selected message portions to the CAM. The CAM compares each inputted message portion to all of its entries at the same time and identifies the first matching entry. The matching CAM entry identifies a corresponding RAM entry the contents of which are provided to the decoder circuit. The decoder circuit decodes the action returned by the RAM and applies that action to the message. The entries of the RAM, for example, may contain actions or instructions to continue searching the message, in which case the decoder circuit may direct the barrel shifter to input a new message portion to the CAM. The actions or instructions may alternatively direct the decoder to send the message to, e.g., a particular interface or port for forwarding or to a central processing unit (CPU) for additional processing. Other actions or instructions may cause the decoder to increment a counter, call and apply a particular subroutine, copy information regarding the message into a third memory device, etc. The programmable pattern matching engine of the present invention, including the CAM and its associated RAM, is preferably implemented through one or more integrated hardware components that efficiently interoperate so as to process network messages at high rates of speed, including multi-gigabit per second transmission rates.

Brief Description of the Drawings

[0015] The invention description below refers to the accompanying drawings, of which:

[0016] FIG. 1 is a highly schematic block diagram of a computer network;

[0017] FIG. 2 is a partial functional block diagram of an intermediate network device including a pattern matching engine in accordance with the present invention;

[0018] FIG. 3 is a highly schematic block diagram of the pattern matching engine of FIG. 2;

[0019] FIGS. 4 and 5 are representative data structures for use with the pattern matching engine of the present invention; and

[0020] FIGS. 6 and 7 are highly schematic, partial representations of the memory structures of the pattern matching engine.

Detailed Description of an Illustrative Embodiment

[0021] FIG. 1 is a highly schematic block diagram of a computer network 100 comprising a plurality of stations that are attached to and thus interconnected by a network of communications media. The stations are typically computers, which may include hosts 102-106 (H1-H3), servers 108-112, and intermediate network devices, such as switches S1-S5. Hosts H1-H3 may be personal computers or workstations. Each station of network 100 typically comprises a plurality of interconnected elements including a processor, a memory and a network adapter. The memory, moreover, may comprise storage locations addressable by the processor and the network adapter for storing software programs and data structures. The processor may comprise processing elements or logic for executing the software programs and manipulating the data structures. An operating system, typically resident in memory and executed by the processor, functionally organizes the station by invoking network operations in support of software processes executing on the station.

[0022] The communications media of network 100 preferably include one or more local area networks (LANs), such as LAN 114 to which hosts H1-H3 are attached, and LAN 116 to which servers 108-112 are attached. LANs 114 and 116 preferably support communication between attached stations by means of a LAN standard, such as the Token Ring or Ethernet LAN standards, which are defined by the Institute of Electrical and Electronics Engineers (IEEE) at IEEE standards 802.3 and 802.5, respectively.

[0023] Switches S1-S5 are preferably interconnected by a series of point-to-point links 118a-e and arranged as a network cloud 120, which interconnects the hosts H1-H3 on LAN 114 with the servers 108-112 on LAN 116. More specifically, switch S1 is attached to LAN 114 and switch S3 is attached to LAN 116. Thus, outside access to LAN 116, which may be considered a private network, must pass through one or more switches S1-S5 of network cloud 120. Servers 108-112 on LAN 116 are preferably configured to provide one or more services. For example, servers 108 and 110 may be configured as web-hosting servers, while server 112 may be configured as an electronic mail or database server.

[0024] Communication among the stations of network 100 is typically effected by generating and exchanging network messages between the communicating stations. That is, a source station may generate one or more discrete packets or segments in accordance with the higher layer protocols of a communications stack and encapsulate those packets or segments in one or more data frames whose format is defined by the LAN standard for the particular communications media to which the source station is attached.

[0025] In the preferred embodiment, these higher layer protocols correspond to the well-known Transmission Control Protocol/Internet Protocol (TCP/IP) Reference Model which is described in A. Tanenbaum Computer Networks (3rd ed. 1996) at pp. 35-38, among other places. Those skilled in the art will recognize that the present invention may work advantageously with other types of communication standards, such as the Internet Packet Exchange (IPX) protocol, etc.

[0026] A network manager responsible for servers 108-112 may wish to identify the particular types of traffic attempting to contact and obtain services from these servers so that appropriate treatments may be applied to that traffic. For example, the network administrator may wish to block outside access to certain web sites and/or web pages hosted by web server 108. Alternatively, the network manager may wish to identify attempts to contact specific web pages at servers 108 and 110 (e.g., electronic commerce pages) so that this traffic may receive higher priority within network cloud 120. The identity of such web pages may be specified by the particular uniform resource locators (URLs) contained in the network messages sent to web servers 108 and 110. Similarly, the network manager may wish to identify the particular application attempting to contact or connect to database server 112 so that traffic corresponding to mission-critical applications (e.g., processing customer invoices) can be given higher priority, while less important applications (e.g., bulk file transfers) can be given lower priority.

[0027] As described above, identifying such traffic flows was conventionally performed in software by servers or, in limited circumstances, by network devices. That is, a pattern matching software program would be written, typically in the Perl programming language, to search for a desired regular expression. Network messages received by an intermediate network device, such as a switch, would be passed to the processor which would execute the software program. The processor and memory architectures employed by most network devices often required that the network messages be evaluated one byte at a time. With the increases in transmission speeds through gigabit Ethernet and other high-speed communication standards and the longer network layer station addresses defined by IP version 6 (IPv6), software solutions for parsing network messages are becoming less efficient. As described below, the present invention is directed to a programmable pattern matching engine, preferably implemented as a logic circuit, that is designed to parse the contents of network messages for pre-defined regular expressions and to execute corresponding actions on those messages at high speeds, e.g., at multi-gigabit per second rates.

[0028] FIG. 2 is a schematic, partial block diagram of switch S1, designated generally as switch 200. The switch S1 is preferably configured as a layer 4/7 switch having a software routing component and hardware components distributed among a plurality of line cards (LC0-3) that are interconnected by a switch fabric 220. One of the line cards, denoted LC0, is a switch management card (SMC) that includes an internal router (R) of the switch. The internal router may be embodied as a routing process executing in the internetwork layer (layer 3) or transport layer (layer 4) of a conventional protocol stack.

[0029] Each line card comprises a plurality of ports P (e.g., P0-P2), a local target logic (LTL) memory and an up/down link (UDlink) interface circuit interconnected by a local bus 210. Each line card further contains a microprocessor (μp) in communicating relation with all of its “peer” microprocessors in switch 200 over a management bus (not shown). Some of the line cards may comprise self-contained “mini-switches” that are capable of rendering forwarding decision operations for data frame traffic switched by the fabric 320; that is, forwarding decisions implemented by the switch fabric may be provided by some line cards. Each of these cards includes an encoded address recognition logic (EARL) circuit coupled to the UDlink and microprocessor. The EARL executes all forwarding decisions for its associated line card(s), while the LTL implements those forwarding decisions by selecting ports as destinations for receiving data (in the form of frames or packets) transferred over the local bus. To that end, the EARL contains forwarding engine circuitry (FE) and at least one forwarding table (FwdT) configured to produce a unique destination port index value.

[0030] The switch fabric 220 is preferably a switching matrix employed to control the transfer of data among the line cards of the switch 200. The UDlink provides an interface between the local bus 210 on each line card and the switch fabric 220. Inputs to the LTL logic are received over the local bus 210, which is driven by the UDlink. By employing the UDlink in this manner, a line card (e.g., LC0-2) may include both an EARL circuit and a UDlink or it may share the EARL contained on another line card. In this latter case, a common bus 230 enables a line card without a forwarding engine (e.g., LC3) to use the forwarding engine (e.g., EARL 0) on another line card, such as the SMC. For those line cards without a forwarding engine, the UDlink also provides a connection to the common bus 230.

[0031] The format of data between each line card and the switch fabric is generally similar to that employed over the local bus. For example, the format of data transferred from each line card to the switch fabric (hereinafter referred to as a “fabric frame”) includes bit mask information instructing the switch fabric 220 where to forward the frame and other information, such as cost of service (COS) information, used by the switch. This information, which is also included on fabric frames traversing the local bus 20, is embedded within a header of each frame.

[0032] Suitable intermediate network device platforms for use with the present invention include the commercially available Catalyst 5000 and 6000 series of switches from Cisco Systems, Inc., along with the intermediate network device disclosed in copending and commonly assigned U.S. patent application Ser. No. 09/469,062 titled, Method and Apparatus for Updating and Synchronizing Forwarding Tables in a Distributed Network Switch by Thomas J. Edsall et al.

[0033] The layer 4/7 switch S1(200) preferably functions as a border gateway to private LAN 116 (FIG. 1). In addition, switch S1 may function as a firewall and a load balancer that analyzes higher layer headers (e.g., layer 4 header) and data (e.g., layer 7 application data) of network messages received at the switch 200. In the former case, a firewall engine of switch S1 analyzes the network messages to counter attacks by potential intruders/hackers, whereas in the latter case, a load balancer function analyzes the messages to identify one or more regular expression, and to direct matching messages to an appropriate server 108-112. Typically, a switch that is configured to perform such higher layer functions implements the regular expression matching processing in software, such as one or more software modules or libraries written in the Perl programming language. As described above, however, such software-based processing can be inefficient and may result in a bottleneck within the switch. The present invention provides a fast packet parsing and pattern matching engine for use in an intermediate network device, such as switch S1, to efficiently perform packet analysis and flow treatment functions. In particular, the engine can parse extension headers (e.g., Ipv6 extension headers) and textual messages (e.g., HTML headers), rapidly match regular expressions, and pass relevant fields (e.g., URLs) to other switch components.

[0034] To these ends, the common bus 230 of switch 200 further enables the line cards LC0-LC3 to interact with a high-speed message processing card 250 by exchanging data over the bus 230. Message processing card 250 preferably includes, inter alia, a data management engine 252, an IP re-assembly engine 254, a traffic shaper 256, a packet buffer 258, and a pattern matching engine 260. The traffic shaper 256, IP re-assembly engine 254, packet buffer 258 and pattern matching engine 260 are each coupled to the data management engine 252, and control information may be exchanged with engine 260 and the other components of switch 200 through a plurality of predefined type-length-value (TLV) messages.

[0035] FIG. 3 is a highly schematic block diagram of the pattern matching engine 260 of switch 200 (S1) of FIG. 2. The pattern matching engine 260 preferably includes a decoder circuit 302 for decoding and executing message-related instructions, and a regular expression storage device 324 having a content-addressable memory (CAM) 304 that can be programmed, as described below, to store at least the regular expression patterns used in searching network messages. The pattern matching engine 260 further includes a message buffer 306 for storing a network message to be evaluated, and a barrel shifter 308 that is connected to the message buffer 306 and operatively controlled by the decoder circuit 302 as illustrated by control arrow 312. The barrel shifter 308 is configured to reveal a selected segment or portion of the message stored in buffer 306 as directed by the decoder circuit 302. Decoder circuit 302 essentially “slides” the barrel shifter 306 along the message buffer 306 as illustrated by double arrow 313 so as to reveal the selected window. The barrel shifter 308 is further coupled to the CAM 304 so as to load the retrieved message portion into a message space 310 of a CAM input 314 that, in turn, is inputted to the CAM 304 as indicated by arrow 316. The CAM input 314 further includes a tag space 318 that is loaded with a tag value as described below by the decoder circuit 302.

[0036] In the illustrative embodiment, the regular expression storage device 324 further includes a second memory structure or device 320, such as a random access memory (RAM), that is associated with CAM 304 and programmed, as described below, to contain the actions or treatments that are to be applied to network messages matching the regular expressions contained within the CAM 304. In particular, both the CAM 304 and the RAM 320 include a plurality of respective entries or rows. Each entry or row of the CAM 304, moreover, includes a pointer that particularly identifies a corresponding entry (i.e., a location) of the RAM 320 as indicated by arrow 322. That is, there is a one-to-one correspondence between CAM entries and RAM entries. The RAM 320, moreover, is configured to provide an output (i.e., the contents of the row or entry identified by the matching CAM entry) to the decoder circuit 302 as indicated by arrow 326. The combination of the CAM 304 and RAM 320 forms the preferred high-speed regular expression storage device 324 of the present invention. To improve performance, pattern matching engine 260 preferably includes multiple (e.g., ten) instances of decoder circuits, message buffers, etc. each processing a different message and each configured to submit inputs to and receive outputs from the CAM 304 and RAM 320. This arrangement allows messages to be processed in pipeline fashion reducing overall message processing time.

[0037] The decoder circuit 302 may be further coupled and thus have access to a subroutine stack 328, a counter memory 330 and a message field memory 332. Depending on the action identified by the output from RAM 320, the decoder circuit 302 may interoperate with and thus utilize the facilities offered by one or more of the subroutine stack 328, the counter memory 330 and the message field memory 332. Engine 260 may also include a pre-parser 334 which receives as an input the network message from packet buffer 258 (FIG. 2) as indicated by arrow 336. The pre-parser 334 is preferably a logic circuit that is configured and arranged to extract one or more commonly evaluated fields from the network message in order to speed up the operations of the pattern matching engine 260. The pre-parser 334 preferably prepends these extracted fields to the network message and passes the combination (i.e., network message and appended fields) to the message buffer 306 for storage therein as indicated by arrow 338.

[0038] The CAM 304 is preferably a ternary content addressable memory (TCAM) so that the cells (not shown) of each entry or row may be associated with or assigned one of three possible values, “0”, “1” or “don't care”. A preferred TCAM has 512 K rows of 288 bit length each. To implement the “don't care” value, the TCAM 406 may be segregated into blocks of cells (each cell being either asserted or de-asserted) and a corresponding mask applied to determine whether the particular cells of its block are “care” or “don't care”. The TCAM 406 and RAM 320 may be static or dynamic.

[0039] Those skilled in the art will recognize that other combinations of hardware components in addition to those specifically described herein may be advantageously utilized to achieve the objectives of the present invention. For example, if TCAMs of sufficient width were reasonably or commercially available, then the associated RAM 320 might be rendered unnecessary. That is, a sufficiently wide TCAM could store both the regular expressions and the corresponding actions or treatments. In that case, the regular expression storage device 324 would simply comprise one or more large TCAMs whose output (i.e., the matching action) would be provided directly to the decoder circuit 302.

[0040] The pattern matching engine 260 is preferably formed from one or more Application Specific Integrated Circuits (ASICs) or Field Programmable Gate Arrays (FPGAs). Suitable TCAMs for use with the present invention are commercially available from NetLogic Microsystems, Inc. of Mountain View, Calif. and Music Semiconductors of Hackettstown, N.J. RAM 320 may be programmed through one or more conventional write operations, while the TCAM 304 may be programmed through a dedicated port (e.g., a Parallel Input/Output port) (not shown). It should be understood that some high-level software may be utilized to generate the data or information used to program the TCAM 304 and RAM 320.

[0041] Operation of the pattern matching engine 260 of the present invention preferably proceeds as follows. Suppose host H1 (FIG. 1) at LAN 114 generates one or more network messages for contacting a website hosted at server 108 at LAN 116. The network communications facilities at host H1 encapsulates the network message into one or more TCP segments and passes it down the communications stack for transmission on LAN 114. In particular the TCP segment is encapsulated into one or more IP packets and the IP packets, in turn, are encapsulated into one or more Ethernet frames which may be driven onto LAN 114 by host H1. Assuming port P2 (FIG. 2) of line card LC3 is attached to LAN 114, then these frames are received at LC3. LC3 transfers the frames to its UDLINK 3 via local bus 210 in a conventional manner, and the UDLINK 3 drives them onto common bus 230. The frames are received at the other line cards (i.e., LC0-LC2) and also at the message processing card 250. Assuming forwarding engine FE1 at line card LC1 concludes that the frames should be processed by the message processing card 250, the line cards LC0-LC2 simply discard them. At the message processing card 250, the frames are handed to the IP re-assembly engine 254 which, in turn, recovers the corresponding network message (i.e., the IP packet and/or the TCP segment) from the plurality of Ethernet frames and stores the message in the packet buffer 258.

[0042] The pattern matching engine 260 retrieves the network message from the packet buffer 258 and provides it to pre-parser 334 (FIG. 3) via arrow 336. The pre-parser 334 scans the message and pulls out commonly evaluated fields. For example, the pre-parser 334 may pull out the following information: IP source address, IP destination address, TCP/UDP source port, TCP/UDP destination port, transport layer protocol type (typically TCP or UDP), IP type of service (TOS), virtual LAN (ULAN) identifier (to the extent the message is associated with a VLAN), TCP acknowledgement (ACK) flag, TCP synchronize (SYN) flag, TCP end-of-transmission (FIN) flag, TCP reset (RST) flag, an index to the port at which the message was received (e.g., port P2 of line card LC3), TCP/UDP padding (if any), and the underlying layer 2 (i.e., Ethernet) frame.

[0043] This information (i.e., the commonly evaluated fields and the layer 2 frame) are then stored in the message buffer 306 by the pre-parser 334 via arrow 338. The contents of the message buffer 306 then undergo one or more look-ups into the CAM 304 under the control of the decoder circuit 302. Specifically, the decoder circuit 302 directs the barrel shifter 308 to reveal and load a selected segment or portion of the contents of the message buffer 306 and place it in the message portion space 310 of CAM input 314. In the illustrated embodiment, the barrel shifter 308 is configured to reveal and load 32 byte segments and to slide along the message buffer in 1 byte increments. The decoder circuit 302 selects the desired 32 byte segment from message buffer 306 by providing the barrel shifter 308 with an offset value via command line 312. An offset of 0, for example, results in bytes 0-31 being loaded into message portion space 310 of CAM input 314, whereas an offset of “1” results in bytes 1-32 being loaded and an offset of “2” would result in bytes 2-33 being loaded, etc.

[0044] Initially, the decoder circuit 302 provides an offset of 0 to the barrel shifter 308 resulting in bytes 0-31 from the message buffer 306 being loaded into the message portion space 310 of CAM input 314. The decoder circuit 302 is also programmed to load an initial tag value into the tag space 318 of CAM input 314.

[0045] For TCP/IP traffic, all TCP/UDP segments corresponding to the same stream, as identified by the contents of their Ethernet and IP headers, are passed to the pattern matching engine 260 for parsing. When the end of the current segment being evaluated is reached, the pattern matching engine 260 preferably saves the current state so that it may be reloaded when the next segment is received.

[0046] FIG. 4 is a block diagram of the CAM input 314, which generally includes a tag space 318 and a message data space 310. The tag space 318 includes a tag field 402 that contains the tag value used by the decoder circuit 302 in selecting a desired “logical” CAM within CAM 304, thereby extending the capabilities and improving the performance of the pattern matching engine 260. The tag space 318 also includes other fields that are similarly loaded by the decoder circuit 302. In particular, the tag space 311 includes an end (E) flag 404 that is asserted by the decoder circuit 302 when the message space 310 contains the last 32 byte section of information from the message buffer 306, otherwise the decoder circuit 302 leaves the E flag 404 de-asserted. A valid field 406 indicates the number of bytes in the message space 310 that are valid. A reserved (RES.) field 408 is presently unused.

[0047] Once the CAM input 314 is loaded, it is provided to the CAM 304 as indicated by arrow 316. CAM 304, in a conventional manner, compares the CAM input 314 with each of its entries all at the same time and identifies the first entry matching the input 314. As described above, each entry of the CAM 304 identifies and thus corresponds to an associated entry in RAM 320 that contains the action or treatment to be applied to the message matching the respective CAM entry. Thus, assuming there is a matching entry for this CAM input 314, the matching entry identifies a corresponding location in RAM 320 as indicated by arrow 322. In response, RAM 320 provides the contents of this location to the decoder circuit 302 as indicated by arrow 326.

[0048] FIG. 5 is a block diagram of the preferred format of an output 500 from RAM 320 (FIG. 3), e.g., the identified row or entry of the RAM 320 as provided to the decoder circuit 302. RAM output 500 has two parts; a first part 502 that pertains to the current TCAM look-up, and a second part 504 that pertains to the next TCAM look-up, if any. The first part 502 preferably includes a one-bit done (D) flag 506, which indicates that the message being evaluated requires no further processing by engine 260, a six-bit operation code (op code) field 508 that specifies the particular action to be taken or the treatment to be applied to this message, a six-bit valid byte (VB) field 510, a one-bit end check (BC) field 512, and a 65-bit instruction-specific data area 514 that contains data for executing the action or treatment specified by the op code of field 508. The second part 504 may similarly be configured to have a plurality of fields. For example, second area 504 may include an eight-bit off set field 516 and an associated one-bit relative (R) flag 518, which the decoder circuit 302 uses to slide the barrel shifter 308 along the message buffer 306 and thus input a new portion of the message to the TCAM 304. Second area 504 may further include a tag field 520, which itself may be divided into a presently un-used one-bit flag (F) field 522, a second one-bit relative (R) flag 524 that is associated with an eighteen-bit tag value field 526.

[0049] It should be understood that areas 502 and 504 may include additional or other fields. For example, the second area 504 may also include a look-up source field, which may be used to designate some other source besides the message buffer 306 for the next TCAM look-up. Other such sources may include control (e.g., TLV) information, other, non-message related, data received by the engine 260 or output data from the RAM 320.

[0050] Those skilled in the art will recognize that various op codes may be defined in order to carry out any number of desired actions or treatments. In the preferred embodiment, the following op codes are defined and utilized.

CONT

[0051] A first action is to continue searching the current message stored at message buffer 306. Here, the done flag 506 is de-asserted, indicating that the decoder circuit 302 is to continue processing the message, and the op code 508 is set to a pre-selected value (e.g., “0”) which the decoder circuit 302 is programmed to recognize as the continue action. The offset field 516 contains the specific offset (e.g., in bytes) that the decoder circuit 302 is to employ in sliding the barrel 308 shifter along the message buffer 306 so as to retrieve the next message segment. The first R flag 518 indicates whether the offset from field 516 is relative (e.g., the flag is asserted) or absolute (e.g., the flag is de-asserted). A relative offset means that the decoder circuit 302 simply slides the barrel shifter 308 from its current position by whatever value is contained in the offset field 516 (e.g., 3 bytes). An absolute offset is independent of the barrel shifter's current position end means that the decoder circuit 302 is to slide the barrel shifter 308 along buffer 306 so that it is located a specific distance into the message. For example, if the first R flag 518 were de-asserted and the associated offset field 516 contained the value “3”, then the decoder circuit 302 would move the barrel shifter 308 so that the respective window defined by barrel shifter 308 started at the third byte of the message within buffer 306.

[0052] For a continue action, the tag value field 526 preferably contains the tag to be inserted in the tag space 318 of the next CAM input 314 by the decoder circuit 302. If the second R flag 524 is asserted (relative mode), then the decoder circuit 302 adds the value contained in the tag value field 526 to the tag value of the previous CAM input 314 in order to obtain a new tag for the next CAM input 314. If the second R flag is de-asserted (absolute mode), then decoder circuit 302 simply copies the contents of the tag value 526 into to the tag space 318 of the next CAM input 314. In sum, the continue action, directs the decoder circuit 302 to formulate a new CAM input 314 with a new message segment and possibly a new tag. The continue action is typically used when a long regular expression is broken up into multiple CAM entries (e.g., searching for IPv6addresses).

SEND

[0053] Engine 260 supports one or more send actions for use in forwarding matching messages. A send action may be used upon matching the last portion of an IPv6 address in order to send the respective message to a particular interface or port for forwarding. In the preferred embodiment, there are two types of send actions: a network (NTWK) send and a CPU send. A network send means the message is sent to a given port or interface for forwarding. A CPU send means the message is sent to a processor for additional processing. The particular CPU may be a main CPU (not shown) at the switch 200 or it may be one of the microprocessors (up) at a particular line card LC0-LC3.

[0054] For a NTWK send, the done flag 506 is asserted indicating that engine 260 is done processing the message, and the op code 508 is set to a pre-selected value (e.g., “1”) which the decoder circuit 302 is programmed to recognize as a NTWK send action. The instruction-specific information area 514 includes a re-write pointer sub-field and a shaper identifier (SID) sub-field. The re-write pointer identifies a particular re-write rule that may be used by the respective EARL in re-writing the message before it is forwarded. The re-write rule, for example, may direct the EARL to re-write the message so as to be compatible with a different layer 2 standard (e.g., Token Ring). The pattern matching engine 260 preferably forwards the message along with the specified re-write rule to the appropriate EARL for implementing the network send action. The message is also shaped by traffic shaper in accordance with the returned SID.

[0055] For a CPU send, the done flag 506 is similarly asserted. The op code 508 is set TCP another pre-selected value (e.g., “2”) which the decoder circuit 302 recognizes as a CPU send action. The instruction-specific information area 514 includes a program pointer sub-field which identifies a program or process located in the CPU's associated memory. The message and program identifier are then forwarded to the CPU, which executes the identified program and takes the resulting action. A CPU send action may be used, for example, to perform stateful inspections of messages that have been identified by engine 260 as belonging to the H.225 protocol. The H.225 protocol governs the control session for setting up a real-time multimedia session in a packet-based network in accordance with the well-known H.323 protocol from the International Telecommunications Union (ITU). The CPU may process the message and learn the parameters (e.g., TCP source and destination ports, etc.) of the up-coming multimedia session, and, in response, insert new entries in the CAM 304 in order to match the subsequent H.323 messages.

CNT

[0056] A counter action is used to increment one or more counters maintained at the counter memory 330 (FIG. 3). Here, the D flag 506 may be asserted or de-asserted depending on whether or not additional processing will take place, and the op code 508 may be set to “3”. The instruction-specific information space 514 includes a counter number sub-field and a value sub-field. The counter number identifies a particular counter within counter memory 330 and the value specifies the amount by which the identified counter should be incremented (or decremented). The decoder circuit 302 preferably uses a pre-defined command or action to carry out the counter action. The counter action (CNT) is typically used to record traffic flow statistics. For example, various services provided by servers 108-112 (FIG. 1).

[0057] If the D flag of the CNT action is de-asserted, then the decoder circuit 302 also causes a new CAM input 314 to be generated by directing the barrel shifter 308 to load a new message segment into message space 310 in accordance with the values in the first R flag 518 and offset field 516. The decoder circuit 302 loads a new value into the tag space 318 of this new CAM input 314 as specified by the values in the second R flag 524 and the tag value field 526 of the CNT action.

CALL

[0058] A call action, in combination with a return (RET) action, as described below, is used by engine 260 to implement a particular subroutine. Subroutines are preferably used to perform pattern matching tasks that are repeatedly encountered, such as skipping over white or blank spaces in messages, skipping over “//” in URLs, etc. For example, upon matching some preliminary regular expression, it may be that the following portion of the message, which may be of variable length, contains white spaces or blanks. In order to skip over these white spaces or blanks and resume searching on the next piece of data within the message, engine 260 uses a subroutine. First, upon matching the portion of the message at which the white spaces or blank portion begins, the corresponding action returned by RAM 320 is a CALL. The CALL action has the D flag is de-asserted indicating that processing of the respective message is not yet complete. The op code may be set to “4” to reflect a CALL action. The instruction-specific information space 514 preferably contains a return tag field, that specifies the tag to be used by the decoder circuit 302 after executing the desired subroutine, and a subroutine tag field that specifies the logical CAM within CAM 304 that has been configured to execute the selected subroutine (e.g., skipping over blank spaces). The return tag is preferably pushed onto the subroutine stack 328 by the decoder circuit 302, and the subroutine tag is used by the decoder circuit 302 to load the tag space 318 of the next CAM input 314. The decoder circuit 302 similarly utilizes the offset 516 of the CALL action to direct the barrel shifter 308 to retrieve the appropriate segment (i.e., window) of the message and load it into the message space 310 of the next CAM input 314. The corresponding entries of the selected logical CAM are programmed to execute the desired subroutine (e.g., skip over the white spaces or blanks). It should be understood that while the pattern matching engine 260 is working through the subroutine, one or more CONT actions may be executed (i.e., the subroutine itself may include one or more CONT instructions). The action specified by the last matching CAM entry for the subroutine is preferably a return (RET) action.

RET

[0059] With the RET action, the D flag is preferably de-asserted indicating that processing of the respective message is not yet complete. The op code may be set to “5” to reflect a RET action. In response to the RET action, the decoder circuit 302“pops” the return tag value from the top of the subroutine stack memory 328. The decoder circuit 302 then uses this return tag, along with the offset 516 specified in the RET action to generate a new CAM input 314 so as to continue processing the message. For example, after locating last white space, the RET action may contain a value in the offset field 516 that identifies where in the message data resumes. The decoder circuit 302 can then use this offset to slide the barrel shifter 308 directly to this point and resume searching from that point forward.

MARK

[0060] A mark action is typically used in combination with a memory copy action to store particular locations in a message at which significant data is found. The mark action preferably has the D flag 506 de-asserted, has an op code of “6” and includes an offset adjustment sub-field within the instruction-specific information space 514. The offset adjustment sub-field is used to identify the position to be marked, which may be different from the regular expression being searched. In response to the mark action, the decoder circuit 302 preferably adds the value contained in the offset adjustment sub-field to the current offset value (i.e., the offset used to place the barrel shifter 308 in its current position) and stores the result in an internal register (not shown). This internal register is then typically read in response to a memory copy action, described below, in order to copy a section of the message from the marked position to the position that is matched by the memory copy action.

[0061] Since the D flag 506 is not asserted, the decoder circuit 302 also continues searching the message. That is, decoder circuit 302 formulates a new CAM input 314 by directing the barrel shifter 308 to load a new message segment into message space 310 in accordance with the values in the first R flag 518 and offset field 516 of the MARK action, and loads a new value into the tag space 318 in accordance with the values in the second R flag 524 and the tag value field 526 of the MARK action.

MEMCPY

[0062] A memory copy (MEMCPY) action is preferably used to store a field descriptor in the message field memory 332. The MEMCPY action preferably has the D flag 506 de-asserted, has an op code of “7” and includes sub-fields for offset adjustment, field name and descriptor index within the instruction-specific information space 514. In response to the MEMCPY action, the decoder circuit 302 preferably enters an array in the message field memory 332. The decoder circuit 302 preferably copies the value from its internal register (generated in response to the MARK action as described above) into the array, which represents a start field pointer. It also adds the offset adjustment contained in the MEMCPY action to the current offset and stores this result in the array as well, which represents an end field pointer. Decoder circuit 302 also stores the field name and descriptor index as specified by the MEMCPY action in the array. The decoder circuit 302 may also generate a length for the array and similarly store this value.

OFS

[0063] An offset (OFS) action is used by the decoder circuit 302 to skip over segments of the message that have variable lengths (e.g., the options areas of IP packets and/or TCP/UDP segments). Basically, the decoder circuit 302 uses information contained with the OFS action to compute a new offset for directing the barrel shifter 308 to a new location along the message buffer 306. The OFS action preferably has the D flag 506 de-asserted, an op code of “8” and an offset position (OP) field in place of the offset field 516. Within the instruction-specific information space 514, the OFS action includes sub-fields for offset length (OL), offset granularity (OG) and an offset constant (OC). The decoder circuit 302 computes the new offset from this information as follows. The OL sub-field specifies the length of the OP field (e.g., 4, 8, 16 or 32 bits). The value of the OP field may be specified in units of bytes, 16-bit words, 32-bit words or 64-bit words. The OG sub-field converts the value from the OP field into bits. The OC is used to account for situations in which the variable length field does not immediately follows the offset field. Thus, the offset is computed by the decoder circuit 302 as follows:
OP*OG+OC

[0064] Other Actions

[0065] It should be understood that additional or other actions may be defined and stored within the RAM 320. For example, an action that un-binds a TCP session (UBND) could be defined. In response to this action, the decoder circuit 302 would direct the CPU or other component responsible for the subject TCP session to break it. Alternatively, an action for populating the fields of a traffic flow table (FTBL) could be defined and stored within RAM 320. In response to the FTBL action, the decoder circuit 302 might specify a particular treatment to be applied to a given traffic flow and cause that treatment to be stored in a table, thereby avoiding the need to process future messages corresponding to this flow in the pattern matching engine 260.

[0066] Other possible actions include a generate TLV action, which causes the engine 260 to generate a particular TLV message for some other switch component. A compare action causes the decoder circuit 302 to perform some comparison (e.g., a comparison against a value in a specified register).

[0067] The VB and EC fields 510, 512 of the RAM output 500 (FIG. 5) are preferably used to perform efficient, partial look-ups within TCAM 304, and to correctly identify the end of strings. For example, the value of the VB is preferably set to the minimum number of valid bytes (i.e., not padding) inserted into the message data portion 310 of the current TCAM input 314 or look-up in order to treat a match as a “true” hit. For example, if the message data portion 310 of the current TCAM look-up contains 22 bytes of valid data (the rest being padding) and the number of valid bytes from the VB field 510 of the matching RAM output 500 is 20, then decoder circuit 302 knows it has a “true” hit and proceeds to execute the action specified by the corresponding op code from field 508. If the number of valid bytes of the current TCAM input 314 or look-up was less than 22 bytes, then the decoder circuit 302 looks to see if the EC field 512 is asserted. If the EC bit is not asserted, the decoder circuit 302 simply saves the values from the offset 516, relative 518 and tag 520 fields and waits to receive additional data (e.g., another TCP/UDP segment). When the new data (e.g., segment) is received, the decoder circuit 302 retrieves the offset, relative and tag values and uses them to generate the next TCAM input 314.

[0068] If the number of valid bytes of the current TCAM input 314 is less than the value specified in the VB field 510 and the EC field 512 is asserted, then the decoder circuit 302 first saves the tag and offset from the current TCAM input 314 as well as the new op code, tag and offset from the RAM output 500. It then performs another look-up in the TCAM 304 using the same data from the message data portion 310 of the current TCAM look-up, but using a new subroutine tag in order to search the contents of the message data portion 310 for an end delimiter. The particular subroutine tag may be specified in a separate field, e.g., a subroutine tag index (STI) field (not shown), in the RAM output 500. If a match is found (i.e., the end delimiter is located), a return (RET) action is preferably specified in the op code field 508 of the matching RAM output 500. In response to the RET action, the decoder circuit 302 retrieves the previously stored op code, tag and offset values from the prior RAM output 500 and executes the action specified by that op code. If a match is not found, then the decoder circuit 302 simply waits for the receipt of more data (e.g., another TCP/UDP segment) and uses the previously saved offset, relative and tag values from the last RAM output 500 in order to generate the next TCAM input 314.

[0069] As shown, the pattern matching engine 260 of the present invention can parse network messages at high speeds (e.g., multi-Gigabit rates). By selectively programming the CAM entries of the storage device 324, engine 260 can search for regular expressions occurring anywhere within the selected network messages, including both the header (e.g., TCP, IP, and/or data link headers) and the payload (e.g., the data portion) and take responsive actions. A switch incorporating the pattern matching engine 260 can thus make forwarding decisions based on selected parameters or criteria from layer 2 (i.e., the data link layer) through layer 7 (i.e., the application layer).

[0070] A Pattern Matching Example

[0071] Suppose that a network administrator wishes to identify network messages that begin with the string “123456” and to re-write and forward such messages in accordance with some pre-defined re-write rule (e.g., rule 35). Suppose further that the network administrator also wishes to identify messages having a “55” before a “65” anywhere within the message, and to execute some pre-defined software routine (e.g., program number 2) on such messages. Finally, for all messages which do not satisfy either of these two requirements, suppose that the network manager wishes to execute another pre-defined software routine (e.g., program number 1) on such messages.

[0072] FIG. 6 is a highly schematic representation of CAM 304 and RAM 320 whose entries have been programmed to carry out the above-defined actions. Both CAM 304 and RAM 320 have a plurality of corresponding entries or rows which are organized into a plurality of fields by means of a number of common columns. CAM 304, for example, includes an end column 602 for matching against the end flag 404 (FIG. 4) of CAM inputs 314, a tag column 604 for matching against the tag field 402 of CAM inputs 314 and a series of data columns 606-612 for matching against the information contained in the message data space 310 of CAM inputs 314. RAM 320 similarly includes a tag column 614 for storing the tag portion 520 of RAM outputs 500, an offset column 616 for storing the offsets 516 of RAM outputs 500, an op code column 618 for storing the op codes 508 of RAM outputs 500, a done column 620 for storing the done flag 506 of RAM outputs 500, and a column 622 for storing the instruction-specific information of RAM outputs 500. By virtue of the values stored in the entries of the tag column 604 (i.e., 0-2, and “X” for don't care), CAM 304, which is a ternary content addressable memory, may be considered to include four “logical” CAMs 624-630.

[0073] When a message is first received and stored in message buffer 306 (FIG. 3), the decoder circuit 302 preferably provides the barrel shifter 308 with an offset of “0”, thereby causing the barrel shifter 308 to load the first M bytes of the message into message space 310 of CAM input 314, where M corresponds to the width or window of the barrel shifter 308. The decoder circuit 302 also loads an initial value (e.g., “0”) into the tag space 318 of the CAM input 314 and applies this input to CAM 304. Only the first logical CAM 624 has tag values of “0”, however, and thus this CAM input can only match against the three entries corresponding to logical CAM 624. If the message data space 310 of this CAM input 314 starts with the string “123456”, then it will match the first row of the CAM 304, causing the corresponding row 500a of RAM 320 to be returned to the decoder circuit 302. As provided in the field corresponding to column 618, the op code of this RAM output 500a is “NTWK”, which the decoder circuit 302 recognizes as an instruction to forward the message. From column 622, RAM output 500a also includes the value “35” in its instruction-specific information field 514, which the decoder passes along to the EARL for implementing re-write rule 35. Since the pattern matching engine 260 is finished with this message, the done flag 506 from column 620 of RAM output 500a is asserted, thereby confirming that processing is complete.

[0074] If the message did not begin with the string “123456”, then the second row or entry of the first logical CAM 624 tests whether the message starts with a “55”. If so, there is a match and the decoder circuit 302 receives the corresponding row 500b of RAM 320 as a RAM output 500. From column 618, the op code for this RAM output 500b is CONT. In response, the decoder circuit 302 moves the barrel shifter 308 by the offset specified from column 616 (e.g., “1”), thereby causing the barrel shifter 308 to slide one byte along the message and load the corresponding window into the message space 310 of CAM input 314. From column 614, the tag value of this RAM output 500b is “2”, which the decoder circuit 302 loads into tag space 318 of the new CAM input 314.

[0075] By virtue of its tag value (e.g., “2”), this new CAM input 314 is essentially matched against logical CAM 628, which searches for “65” anywhere in the message portion 310 of the input 314. If a “65” is found as shown in the first four rows or entries of logical CAM 628, then the corresponding row or entry 500i-500l of RAM 320 is returned to the decoder circuit 302. Each of these RAM outputs 500i-500l, moreover, has the CPU as its op code (column 618), an instruction-specific data of “2” (column 622) and an asserted done flag (column 620). Accordingly, the decoder circuit 302, in response to any of these RAM outputs 500i-500l, stops processing the message and sends it to the CPU with the instruction to execute subroutine “2”.

[0076] Returning to logical CAM 624, if the first CAM input 314 did not start with “123456” or “55”, then it would still match the third row of logical CAM 624, which has the wildcard or don't care value at each data byte position. Accordingly, the corresponding row 500c of RAM 320 would be provided to the decoder circuit 302, and circuit 302, as directed by the CONT op code from column 618 of this RAM output 500c, continues searching the message. In particular, decoder circuit 302 slides the barrel shifter 308 one increment (e.g., 1 byte) along the message buffer 306, as directed by the “1” in offset column 616, so as to supply a new window to the message space 310 of the next CAM input 314. Decoder circuit 302 also loads the tag space 318 of this new CAM input 314 with the value “1”, as directed by the “1” in the tag column 616 of this RAM output 500c.

[0077] By virtue of the “1” in the tag portion 318, this next CAM input 314 is essentially matched against all of the entries or rows of logical CAM 626. It should be understood that each CAM input 314 is actually matched against all CAM entries, but by utilizing (e.g., setting) the tag space, matches can only occur to the entries of the selected logical CAM. Logical CAM 626 has been programmed to search for a “55” anywhere in the message space 314 of the respective input. If no “55” is found, the CAM input 314 will still match the last row of logical CAM 626 due to the use of the wildcard or don't care value for each data word. The corresponding row 500h of the RAM 320 directs the decoder circuit 302 to move the barrel shifter 308, but keep the tag value at “1”, essentially searching sequential windows of the message for an occurrence of “55”. When a “55” is located, the respective RAM outputs 500d-500g direct the decoder circuit 302 to move the barrel shifter 308 by an offset determined by the location at which the “55” is found and to change the tag value to “2”, thereby comparing the next segment of the message with the entries of logical CAM 628 (i.e., searching for the occurrence of a “65”).

[0078] If a “65” is located, the respective RAM outputs 500i-500l for logical CAM 628 direct the decoder circuit 302 to send the message to the CPU along with the identity of program number “2”, as indicated in the data column 622. The last entries of logical CAMs 626 and 628 both have the end flag de-asserted as indicated at column 602. Thus, a match to these entries, which causes the decoder circuit 302 to continue searching, means that the barrel shifter 308 has not yet reached the end of the message. Upon reaching the end of the message buffer 306, the decoder circuit 302 preferably asserts the end flag 404 (FIG. 4) of the respective CAM input 314. Thus, if this last message portion 310 fails to include a “55” or a “65”, it will not match the last row of either logical CAM 626 or 628 (which have their end flags de-asserted). Instead, this CAM input 314, carrying the last message portion, will only match the one entry of logical CAM 630. The respective RAM output 500n, moreover, directs the decoder circuit 302 to send the message to the CPU with an instruction to execute program number “1”.

[0079] As shown, appropriate programming of the CAM 304 and RAM 320 results in the desired actions or treatments being correctly applied to network messages. Furthermore the configuration of the pattern matching engine 260 of the present invention, including the decoder circuit and the CAM/RAM combination, allows an Ethernet frame payload (e.g., 1500 bytes) to be checked in a matter of microseconds. In particular, by having multiple instances of decoder circuits, message buffers, etc. operating on CAM 304 and RAM 320, as described above, parallel processing can be achieved significantly increasing performance.

[0080] FIG. 7 is a highly schematic partial representation of CAM 304 and RAM 320 programmed to execute a particular subroutine, namely skipping over continuous blank spaces. As described above, CAM 304 and RAM 320 have a plurality of corresponding entries or rows which are organized into a plurality of fields by means of a number of common columns, including end column 602 tag column 604 and data column 605, which includes a series of data unit (e.g., byte) sub-columns 606-612 at CAM 304, and tag column 614, offset column 616, op code column 618, done column 620, and a rewrite subroutine column 632 at RAM 320. By virtue of the values stored in the entries of the tag column 604 (i.e., 100), this portion of CAM 304 corresponds to a logical CAM 634.

[0081] Logical CAM 634 preferably operates as follows. Suppose the pattern matching engine 260 is programmed to search for a particular IP address and, upon locating that IP address, to continue searching for one or more URLs contained within the body or data portion of the message. Suppose further that following the IP address are a series of blank spaces of variable length. To quickly skip over the blank spaces and begin searching data for the URL, the pattern matching engine 260 preferably utilizes logical CAM 634. More specifically, upon locating the subject IP address, the respective RAM output 500 is a CALL action. The return tag sub-field contained in this RAM output 500 carries the tag corresponding to that portion of CAM 302 used to search for the desired URL. In accordance with the CALL operation, decoder circuit 302 pushes this return tag onto the subroutine stack 328. The decoder circuit 302 then generates a new CAM input 314 for continuing its search of the respective message. In particular, decoder circuit 302 directs the barrel shifter 308 to slide by one increment and load the corresponding window from message buffer 306 into the message space 310 of this new CAM input 314. Within the tag space 318 of this new CAM input 314, decoder circuit 302 loads the tag specified in the tag value field of the RAM output 500. Since the pattern matching engine 260 is going to be utilizing the blank space skipping logical CAM 634, this tag value is preferably set to “100”.

[0082] This new CAM input 314 is then provided to CAM 304. By virtue of its tag space 318, input 314 can only be matched to the entries of logical CAM 634. If the entire contents of the message data portion 310 of this input 314 are blank spaces, represented in hexadecimal format as “20”, then the input 314 will match for the first row of logical CAM 634. The action of the respective RAM output 500o is CONT, thereby directing the decoder circuit 302 to continue searching the message. Specifically, decoder circuit 302 slides the barrel shifter 308 by four increments to retrieve a new window for loading into message space 310 of the next CAM input 314, as specified by the contents of the offset field corresponding to column 616, and leaves the tag portion of this new input 314 set at “100”. Accordingly, this next CAM input 314 is also matched against the entries of logical CAM 634.

[0083] This process is repeated until the message data portion 310 of the CAM input 314 includes data rather than blank spaces at any location. Rather than match the first entry of logical CAM 634, which requires blank spaces at all data locations, such a CAM input will match entries 2-5 of logical CAM 634 depending on how many of the data locations carry data rather than blank spaces. As shown, the corresponding RAM outputs 500p-500s are all return (RET) actions. In response, the decoder circuit 302“pops” the return tag that was previously pushed onto the subroutine stack, and uses this return tag in the tag space 318 of the next CAM input 314. As indicated above, this tag identifies the logical CAM used to search for the desired URL. Decoder circuit 302 also directs the barrel shifter 308 to slide along the message buffer 306 and retrieve a new window for use in loading the message data space 310 of this next CAM input 314. The amount by which the barrel shifter 308 is moved is specified in the offset field of the RET-based RAM output 500, which value is shown in column 616. In order to resume searching precisely where data resumes in the network message, the amount of the offset depends on where the last blank space was located.

[0084] As shown, logical CAM 634 efficiently executes a desired subroutine, e.g., skipping blank spaces.

[0085] It should be understood that CAM 302 is configured to identify the first matching entry as opposed to all matching entries. Thus, only a single RAM output 500 is provided to the decoder circuit 302 per CAM input 314. Nevertheless, this configuration makes ordering of the CAM (and thus RAM) entries significant during the programming of those devices. In general, more specific matches or rows should be placed ahead of less specific matches or rows (i.e., rows containing more wildcard or don't care entries).

[0086] To the extent, a traffic flow utilizes dynamically agreed-upon destination and source ports, the pattern matching engine 260 can be programmed to identify such agreed-upon port numbers so that subsequent messages corresponding to this traffic flow can be treated accordingly. For example, the initial network messages exchanged to set-up a given TCP session can be searched to identify the particular dynamic ports that are selected by the respective entities. These port numbers may then be programmed into the CAM 304 so that subsequent messages corresponding to this traffic flow can be easily identified. It should be understood that multiple messages may be provided to engine 260 for pattern matching. For example, all of the initial set-up messages for a particular TCP session may provided to engine 260 for pattern matching.

[0087] The foregoing description has been directed to specific embodiments of this invention. It will be apparent, however, that other variations and modifications may be made to the described embodiments, with the attainment of some or all of their advantages. For example, although the illustrative embodiment of the pattern matching engine 260 has been described in connection with the searching of network messages (e.g., TCP/IP packets and/or data link frames), those skilled in the art will recognize that it may be used to search other data records or files. Therefore, it is an object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

Claims

1. A pattern matching engine for use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising;

a regular expression storage device for storing the pre-defined regular expressions and one or more corresponding actions that are to be applied to network messages matching the respective regular expressions, the storage device including a content-addressable memory (CAM) having a plurality of entries containing at least the pre-defined regular expressions; and

a decoder circuit coupled to the regular expression storage device, the decoder circuit configured to control an input to the CAM that includes a given network message or selected portion thereof for comparison with the regular expressions contained within the CAM, and to receive and decode an output returned from the regular expression storage device, the output identifying the action to be applied to the given network message or portion thereof,

whereby the CAM is configured such that each network message, or portion thereof input to the CAM is compared against all CAM entries at the same time, allowing high-speed pattern matching of network messages.

2. The pattern matching engine of claim 1 wherein each CAM entry further contains a tag such that all CAM entries having the same tag define a single logical CAM within the CAM, and further wherein the decoder circuit is configured to constrain the matching of a given CAM input to the CAM entries corresponding to a selected logical CAM.

3. The pattern matching engine of claim 2 further comprising a barrel shifter operatively coupled to the decoder circuit, the barrel shifter configured to provide a selected portion of a network message to the CAM input as directed by the decoder circuit.

4. The pattern matching engine of claim 3 further comprising a second decoder circuit coupled to the regular expression storage device, and a second barrel shifter operatively coupled to the second decoder circuit, wherein the second decoder circuit and second barrel shifter apply a selected portion of a second network message to the regular expression storage device in parallel fashion with the decoder circuit and barrel shifter.

5. The pattern matching engine of claim 3 wherein the CAM input comprises a message data space for storing the network message or portion thereof provided by the barrel shifter, a tag space for storing the selected tag, and an end flag indicating whether the message data space contains a last segment of the respective network message.

6. The pattern matching engine of claim 5 wherein the output returned by the regular expression storage device comprises an operation code for identifying the action to be applied to the respective network message and, to the extent further searching is to be performed on the respective network message, an offset for use in directing the barrel shifter to select a new message portion for a subsequent CAM input and a tag to be appended to the subsequent CAM input.

7. The pattern matching engine of claim 6 wherein the output further returned by the regular expression storage device further comprises a done flag, which if asserted, indicates that processing of the respective message is complete.

8. The pattern matching engine of claim 7 further comprising a pre-parser logic circuit configured to extract one or more selected fields from network messages received at the pattern matching engine and to append those selected fields to the respective network messages prior to inputting the messages to the CAM.

9. The pattern matching engine of claim 8 wherein a first action output by the regular expression storage device is a call action that comprises first and second tags, and the pattern matching engine further comprises a subroutine stack coupled to the decoder circuit for temporarily storing the second tag while the respective message is searched under the first tag.

10. The pattern matching engine of claim 8 wherein a second action output by the regular expression storage device is a counter action, and the pattern matching engine further comprises a counter memory coupled to the decoder circuit, the counter memory having one or more counters that may be selectively actuated by the decoder circuit in response to the counter action.

11. The pattern matching engine of claim 8 wherein a third action output by the regular expression storage device is a copy action, and the pattern matching engine further comprises a message field memory coupled to the decoder circuit for storing information in response to the copy action.

12. The pattern matching engine of claim 1 wherein the regular expression storage device further includes a second memory structure having a plurality of entries for storing the actions to be applied to the network messages, wherein each entry of the second memory structure is associated with a corresponding entry of the CAM and stores the action to be applied to network messages matching the regular expression of its corresponding CAM entry.

13. The pattern matching engine of claim 12 wherein the second memory structure is a random access memory (RAM).

14. The pattern matching engine of claim 13 wherein the CAM is a ternary content addressable memory (TCAM) that supports don't care values.

15. A method for searching network messages for pre-defined regular expressions in order to apply a selected action to network messages matching a given regular expression, the method comprising the steps of:

storing the pre-defined regular expressions in a content-addressable memory (CAM) having a plurality of entries;

decoding a given network message, or selected portion thereof, for comparison with the regular expressions contained within the CAM;

inputting a decoded portion of the given network message to the CAM for comparison with all of the regular expressions stored therein;

decoding an output returned from the CAM; and

identifying, in response to the decoded output, the action that corresponds to a first CAM entry matching the inputted network message or selected portion thereof, whereby input to the CAM is compared against all CAM entries at the same time, allowing high-speed pattern matching of network messages.

16. The method of claim 15 wherein the step of associating comprises the step of providing a second memory structure having a plurality of entries for storing the actions to be applied to the network messages, wherein each entry of the second memory structure is associated with a corresponding entry of the CAM and stores the action to be applied to network messages matching the regular expression of its corresponding CAM entry.

17. The method of claim 16 further comprising the step of appending a tag to the given network message or selected portion thereof that is input to the CAM, and further wherein each CAM entry contains a tag value such that all CAM entries having the same tag value define a single logical CAM within the CAM.

18. The method of claim 17 wherein the CAM is a ternary content addressable memory (TCAM) and the second memory structure is a random access memory (RAM).

19. An intermediate network device for use in processing and forwarding network messages in a computer network, the intermediate network device comprising:

a plurality of line cards, one or more of the line cards capable of being connected to portions of the computer network by respective communications media, each line card configured to receive and forward network messages;

a message processing card; and

a common bus that provides inter-communication between the plurality of line cards and the message processing card, wherein the message processing card comprises:

pattern matching engine far use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising:

whereby the CAM is configured such that each network message or portion thereof input to the CAM is compared against all CAM entries at the same time, allowing high-speed pattern matching of network messages.

20. The intermediate network device of claim 19 wherein each CAM entry of the CAM further contains a tag such that all CAM entries having the same tag define a single logical CAM within the CAM, and further wherein the decoder circuit is configured to constrain the matching of a given CAM input to the CAM entries corresponding to a selected logical CAM.

21. The intermediate network device of claim 20 wherein the pattern matching engine further comprises a barrel shifter operatively coupled to the decoder circuit, the barrel shifter configured to provide a selected portion of a network message to the CAM input as directed by the decoder circuit.

22. The intermediate network device of claim 21 wherein the pattern matching engine further comprises a second decoder circuit coupled to the regular expression storage device, and a second barrel shifter operatively coupled to the second decoder circuit, wherein the second decoder circuit and second barrel shifter apply a selected portion of a second network message to the regular expression storage device in parallel fashion with the decoder circuit and barrel shifter.

23. The intermediate network device of claim 22 wherein the CAM input comprises a message data space for storing the network message or portion thereof provided by the barrel shifter, a tag space for storing the selected tag, and an end flag indicating whether the message data space contains a last segment of the respective network message.

24. The intermediate network device of claim 23 wherein the output returned by the regular expression storage device comprises an operation code for identifying the action to be applied to the respective network message and, to the extent further searching is to be performed on the respective network message, an offset for use in directing the barrel shifter to select a new message portion for a subsequent CAM input and a tag to be appended to the subsequent CAM input.

25. A pattern matching engine for use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising:

means for storing the pre-defined regular expressions and one or more corresponding actions that are to be applied to network messages matching the respective regular expressions, the storage means including a content-addressable memory (CAM) having a plurality of entries containing at least the pre-defined regular expressions; and

means, coupled to the storage means, for decoding actions returned from the storage means, the decoding means configured to control an input to the CAM that includes a given network message or selected portion thereof for comparison with the regular expressions contained within the CAM, and to receive and decode an output returned from the storage means, the output identifying the action to be applied to the given network message or portion thereof;

Patent Citations (158)

Patent	Date	Inventor	Cited By
US4071887(A)	1978-01-01	Daly et al.	Applicant
US4404557(A)	1983-09-01	Grow	Applicant
US4495617(A)	1985-01-01	Ampulski et al.	Applicant
US4512014(A)	1985-04-01	Binz et al.	Applicant
US4530091(A)	1985-07-01	Crockett	Applicant
US4536876(A)	1985-08-01	Bahr et al.	Applicant
US4539679(A)	1985-09-01	Bux et al.	Applicant
US4543630(A)	1985-09-01	Neches	Applicant
US4549291(A)	1985-10-01	Renoulin et al.	Applicant
US4590554(A)	1986-05-01	Glazer et al.	Applicant
US4598400(A)	1986-07-01	Hillis	Applicant
US4604742(A)	1986-08-01	Hamada et al.	Applicant
US4609920(A)	1986-09-01	Segarra	Applicant
US4663748(A)	1987-05-01	Karbowiak et al.	Applicant
US4677614(A)	1987-06-01	Circo	Applicant
US4680757(A)	1987-07-01	Murakami et al.	Applicant
US4704680(A)	1987-11-01	Saxe	Applicant
US4709327(A)	1987-11-01	Hillis et al.	Applicant
US4709364(A)	1987-11-01	Hasegawa et al.	Applicant
US4713807(A)	1987-12-01	Caves et al.	Applicant
US4746920(A)	1988-05-01	Nellen et al.	Applicant
US4747130(A)	1988-05-01	Ho	Applicant
US4754395(A)	1988-06-01	Weisshaar et al.	Applicant
US4771423(A)	1988-09-01	Ohya et al.	Applicant
US4773038(A)	1988-09-01	Hillis et al.	Applicant
US4791641(A)	1988-12-01	Hillis	Applicant
US4805091(A)	1989-02-01	Thiel et al.	Applicant
US4805167(A)	1989-02-01	Leslie et al.	Applicant
US4809202(A)	1989-02-01	Wolfram	Applicant
US4814762(A)	1989-03-01	Franaszek	Applicant
US4815110(A)	1989-03-01	Benson et al.	Applicant
US4833468(A)	1989-05-01	Larson et al.	Applicant
US4864559(A)	1989-09-01	Perlman	Applicant
US4870568(A)	1989-09-01	Kahle et al.	Applicant
US4922418(A)	1990-05-01	Dolecek	Applicant
US4922486(A)	1990-05-01	Lidinsky et al.	Applicant
US4926446(A)	1990-05-01	Grover et al.	Applicant
US4930121(A)	1990-05-01	Shiobara	Applicant
US4949239(A)	1990-08-01	Gillett, Jr. et al.	Applicant
US4954988(A)	1990-09-01	Robb	Applicant
US4965717(A)	1990-10-01	Cutts, Jr. et al.	Applicant
US4993028(A)	1991-02-01	Hillis	Applicant
US5014265(A)	1991-05-01	Hahne et al.	Applicant
US5018137(A)	1991-05-01	Backes et al.	Applicant
US5027350(A)	1991-06-01	Marshall	Applicant
US5067078(A)	1991-11-01	Talgam et al.	Applicant
US5070446(A)	1991-12-01	Salem	Applicant
US5072422(A)	1991-12-01	Rachels	Examiner
US5088032(A)	1992-02-01	Bosack	Applicant
US5093801(A)	1992-03-01	White et al.	Applicant
US5111198(A)	1992-05-01	Kuszmaul	Applicant
US5113510(A)	1992-05-01	Hillis	Applicant
US5117420(A)	1992-05-01	Hillis et al.	Applicant
US5129077(A)	1992-07-01	Hillis	Applicant
US5148547(A)	1992-09-01	Kahle et al.	Applicant
US5151996(A)	1992-09-01	Hillis	Applicant
US5157663(A)	1992-10-01	Major et al.	Applicant
US5175865(A)	1992-12-01	Hillis	Applicant
US5212773(A)	1993-05-01	Hillis	Applicant
US5222216(A)	1993-06-01	Parish et al.	Applicant
US5222237(A)	1993-06-01	Hillis	Applicant
US5224099(A)	1993-06-01	Corbalis et al.	Applicant
US5247613(A)	1993-09-01	Bromley	Applicant
US5247694(A)	1993-09-01	Dahl	Applicant
US5255291(A)	1993-10-01	Holden et al.	Applicant
US5261105(A)	1993-11-01	Potter et al.	Applicant
US5265207(A)	1993-11-01	Zak et al.	Applicant
US5274631(A)	1993-12-01	Bhardwaj	Applicant
US5280470(A)	1994-01-01	Buhrke et al.	Applicant
US5289156(A)	1994-02-01	Ganmukhi	Applicant
US5295258(A)	1994-03-01	Jewett et al.	Applicant
US5301310(A)	1994-04-01	Isman et al.	Applicant
US5317726(A)	1994-05-01	Horst	Applicant
US5325487(A)	1994-06-01	Au et al.	Applicant
US5331637(A)	1994-07-01	Francis et al.	Applicant
US5349680(A)	1994-09-01	Fukuoka	Applicant
US5353283(A)	1994-10-01	Tsuchiya	Applicant
US5355492(A)	1994-10-01	Frankel et al.	Applicant
US5357612(A)	1994-10-01	Alaiwan	Applicant
US5359592(A)	1994-10-01	Corbalis et al.	Applicant
US5361256(A)	1994-11-01	Doeringer et al.	Applicant
US5361363(A)	1994-11-01	Wells et al.	Applicant
US5367692(A)	1994-11-01	Edelman	Applicant
US5388214(A)	1995-02-01	Leiserson et al.	Applicant
US5388262(A)	1995-02-01	Hillis	Applicant
US5390298(A)	1995-02-01	Kuszmaul et al.	Applicant
US5394402(A)	1995-02-01	Ross	Applicant
US5404296(A)	1995-04-01	Moorhead	Applicant
US5404562(A)	1995-04-01	Heller et al.	Applicant
US5410723(A)	1995-04-01	Schmidt et al.	Applicant
US5414704(A)	1995-05-01	Spinney	Applicant
US5428761(A)	1995-06-01	Herlihy et al.	Applicant
US5440752(A)	1995-08-01	Lentz et al.	Applicant
US5442633(A)	1995-08-01	Perkins et al.	Applicant
US5455932(A)	1995-10-01	Major et al.	Applicant
US5473607(A)	1995-12-01	Hausman et al.	Applicant
US5475856(A)	1995-12-01	Kogge	Applicant
US5485627(A)	1996-01-01	Hillis	Applicant
US5499384(A)	1996-03-01	Lentz et al.	Applicant
US5500860(A)	1996-03-01	Perlman et al.	Applicant
US5511168(A)	1996-04-01	Perlman et al.	Applicant
US5530809(A)	1996-06-01	Douglas et al.	Applicant
US5535408(A)	1996-07-01	Hillis	Applicant
US5561669(A)	1996-10-01	Lenney et al.	Applicant
US5566170(A)	1996-10-01	Bakke et al.	Applicant
US5568380(A)	1996-10-01	Brodnax et al.	Applicant
US5583996(A)	1996-12-01	Tsuchiya	Applicant
US5600644(A)	1997-02-01	Chang et al.	Applicant
US5612959(A)	1997-03-01	Takase et al.	Applicant
US5613136(A)	1997-03-01	Casavant et al.	Applicant
US5615360(A)	1997-03-01	Bezek et al.	Examiner
US5617421(A)	1997-04-01	Chin et al.	Applicant
US5617538(A)	1997-04-01	Heller	Applicant
US5621885(A)	1997-04-01	Del Vigna, Jr.	Applicant
US5627965(A)	1997-05-01	Liddell et al.	Applicant
US5633858(A)	1997-05-01	Chang et al.	Applicant
US5633866(A)	1997-05-01	Callon	Applicant
US5673423(A)	1997-09-01	Hillis	Applicant
US5684800(A)	1997-11-01	Dobbins et al.	Applicant
US5710814(A)	1998-01-01	Klemba et al.	Applicant
US5740171(A)	1998-04-01	Mazzola et al.	Applicant
US5742604(A)	1998-04-01	Edsall et al.	Applicant
US5748936(A)	1998-05-01	Karp et al.	Applicant
US5748963(A)	1998-05-01	Orr	Applicant
US5751955(A)	1998-05-01	Sonnier et al.	Applicant
US5758148(A)	1998-05-01	Lipovski	Examiner
US5764636(A)	1998-06-01	Edsall	Applicant
US5781715(A)	1998-07-01	Sheu	Applicant
US5781753(A)	1998-07-01	McFarland et al.	Applicant
US5787243(A)	1998-07-01	Stiffler	Applicant
US5787255(A)	1998-07-01	Parlan et al.	Applicant
US5796732(A)	1998-08-01	Mazzola et al.	Applicant
US5796740(A)	1998-08-01	Perlman et al.	Applicant
US5812811(A)	1998-09-01	Dubey et al.	Applicant
US5818842(A)	1998-10-01	Burwell et al.	Applicant
US5828844(A)	1998-10-01	Civanlar et al.	Applicant
US5832291(A)	1998-11-01	Rosen et al.	Applicant
US5838915(A)	1998-11-01	Klausmeier et al.	Applicant
US5842040(A)	1998-11-01	Hughes et al.	Applicant
US5852607(A)	1998-12-01	Chin	Applicant
US5860086(A)	1999-01-01	Crump et al.	Applicant
US5872963(A)	1999-02-01	Bitar et al.	Applicant
US5898686(A)	1999-04-01	Virgile	Applicant
US5909441(A)	1999-06-01	Alexander, Jr. et al.	Applicant
US5909550(A)	1999-06-01	Shankar et al.	Applicant
US5941988(A)	1999-08-01	Bhagwat et al.	Applicant
US5953512(A)	1999-09-01	Cai et al.	Applicant
US5960211(A)	1999-09-01	Schwartz et al.	Applicant
US6035422(A)	2000-03-01	Hohl et al.	Applicant
US6067569(A)	2000-05-01	Khaki et al.	Applicant
US6169999(B1)	2001-01-01	Kanno	Examiner
US6381673(B1)	2002-04-01	Srinivasan et al.	Examiner
US6389507(B1)	2002-05-01	Sherman	Examiner
US6480931(B1)	2002-11-01	Buti et al.	Examiner
US6510509(B1)	2003-01-01	Chopra et al.	Examiner
US6564289(B2)	2003-05-01	Srinivasan et al.	Examiner
US6574702(B2)	2003-06-01	Khanna et al.	Examiner
US6591331(B1)	2003-07-01	Khanna	Examiner

Non-Patent Literature (41)

Computer Architecture The Anatomy of Modern Processors, Pipeline Hazards, world wide web page http://ciips.ee.uwa.edu.au/˜morris/CA406/pipe_hazard.html, 1999, pp. 1-6.Applicant
Cisco Catalyst Workgroup Switch Version 3.0, web, http://www.cisco.com/warp/public/558/16.html, pp. 1-5.Applicant
Cisco VLAN Roadmap, web, http://www.cisco.com/warp/public/538/7.html, pp. 1-9.Applicant
IAC (SM) Newsletter Database (™) Communications Industry Researchers, Broadband Networks and Applications, copyright 1995 Information Access Company, a Thomson Corporation Company, Section No. 16, vol. E; ISSN: 1059-0544, Headline, Cisco Announces New Fast Ethernet Interface, pp. 2-3.Applicant
IAC (SM) Newsletter Database (™) Communications Industry Researchers, Broadband Networks and Applications, copyright 1995 Information Access Company, a Thomson Corporation Company, Section No. 16, vol. 3; ISSN: 1059-0544, Headline, Cisco Announces Token-Ring Switching Products, pp. 4-5.Applicant
Cisco 7000 Series Gains Fast Ethernet Interface, Becomes Only Router Family to Support Three High-Speed Network Types, web, http://www.cisco.com/warp/public/146/199.html pp. 1-2.Applicant
ISL Functional Specification, web, http://www.cisco.com/warp/public/741/4.htm, pp. 1-4.Applicant
Cisco-Catalyst 5000 Software Release 2.1 Feature Set, web, http://www.cisco.com/warp/public/729/c5000/426_pp.htm, pp. 1-9.Applicant
IEEE Standard Project P802.1Q, Draft Standard for Virtual Bridged Local Area Networks, Copyright by the Institute of Electrical and Electronics Engineers, Inc., Feb. 28, 1997, pp. 1-88.Applicant
Draft Standard P. 802 IQ/D10, IEEE Standards for Local and Metropolitan Area Networks: Virtual Bridged Local Area Networks, Copyright by the Institute of Electrical and Electronics Engineers, Inc., Mar. 22, 1997, pp. 1-212.Applicant
ISL Configurations for Cisco IOS and the Catalyst 5000, web, http://www.cisco.com/warp/public/741/8.html, pp. 1-8.Applicant
Dynamic Inter-Switch Link Protocol, 2.2 Configuration Note, pp. 2-6.Applicant
Virtual LANs, Catalyst 2820 Series and Catalyst 1900 Series Enterprise Edition Software Configuration Guide, Chapter 2, pp. 2-1-2-49.Applicant
Configuring VTP and Virtual LANs, Catalyst 5000 Series Software Configuration Guide, Chapter 13, pp. 13-1-13-24.Applicant
IEEE 1149.1 Device Architecture, http://www.asset-intertech.com/homepage/bscantutr/arch.htm, pp. 1-3, 1998.Applicant
IEEE 1149.1 Device Architecture (continued), Using the Instruction Register (IR), http://www.asset-intertech.com/homepage/bscantutr/arch2.htm#UsingIR, pp. 1-4, 1998.Applicant
The Principle of Boundary-Scan Architecture, http://www.asset-intertech.com/homepage/bscantutur/principl.htm, pp. 1-4, 1998.Applicant
IEEE 1149.1 Device Architecture (continued), The Test Access Port (TAP), http://www.asset-intertech.com/homepage/bscantutr/arch3.htm#TAP, pp. 1-3, 1998.Applicant
Digital Systems Testing and Testable Design, Miron Abramovici, et al., Computer Science Press, pp. 342-409, Copyright 1990.Applicant
World Wide Web page http://www.synopsys.com/products/analysis/primtime_ds.html, Prime Time, Jul. 12, 1999, pp. 1-7.Applicant
World Wide Web page http://www.synopsys.com/products/analysis/primetime_cs.html, Prime Time: Full-Chip, Gate-Level Static Timing Analysis, Jul. 12, 1999, pp. 1-2.Applicant
World Wide Web page http://www.synopsys.com/products/analysis/sta_wp.html, Static Timing Verification: Methodology Overview, Jul. 12, 1999, pp. 1-13.Applicant
World Wide Web page http://www.synopsys.com/products/analysis/pt_tech_bgr.html, Prime Time Full-Chip Static Timing Analyzer, Jul. 12, 1999, pp. 1-17.Applicant
Pankaj Gupta and Nick McKeown, Packet Classification on Multiple Ends.Applicant
Dawson R. Engler and M. Frans Kaashoek, DPF: Fast, Flexible Message Demultiplexing using Dynamic Code Generation, 1996, pp. 53-59.Applicant
T.V. Lakshman and D. Stiliadis, High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching, 1998, pp. 203-214.Applicant
Application Prioritization, Top Layer Networks, Inc., (c) 1999, pp. 1-8.Applicant
Application Control, Top Layer Networks, Inc., (c) 1999, pp. 1-8.Applicant
Classifying Custom Applications with 7 Layer Application Control, Top Layer Networks, Inc., (c) 1999, pp. 1-8.Applicant
Custom ASIC Design Enables 7 Layer Application Control, Top Layer Networks, Inc., (c) 1999, pp. 1-5.Applicant
Implementing Qos for Business Driven Networks, Top Layer Networks, Inc., (c) 1999, pp. 1-7.Applicant
AppSwitch Data Sheet, Top Layer Networks, Inc., (c) 1999, pp. 1-8.Applicant
The Need for Classifying Applications Using 7 Layer Application Control, Top Layer Networks, Inc., (c) 1999, pp. 1-19.Applicant
Press Release-Data Communications and Internetweek Editors Name Top Layer Networks' “App Switch” A Winner of the Best of Show Awards at Networld + Interop 99 Las Vegas, Top layer Networks, Inc., (c) 1999, pp. 1-2.Applicant
Wallace, Bob, Load Balancing, http://www.computerworld.com/home/features.nf, ComputerWorld, (c) 1999, pp. 1-4.Applicant
Foundry Networks Announces Net Generation Layer 4-7 Products, http://biz.yahoo.com/991115/ca_foundry_1.html, Business Wire, (c) 1994-1999, pp. 1-3.Applicant
Curtone, Vic, AppSwitch Does Layer 7 Switching, Network Computing, May 3, 1999, pp. 1-3.Applicant
Layer 4 Switching: Unraveling the ‘Vendorspeak’, http://www.networking.com/shared/pr . . . cle?, Cisco Engineers, May 3, 1999, pp. 1-3.Applicant
Regex, http://www.cs.utah.edu/dept/old/textinfo/regez, (c) 1992, pp. 1035.Applicant
Per15 Regular Expression Description, http://language.perl.com/all_about/regexps.html, (c) 1994-1996, pp. 1-14.Applicant
Perl Regular Expression Tutorial, http://www.meurrens.org/ip-Links/Java/regex/Perl/regex2a.html, (c) 1994-1996, pp. 1-8.Applicant

Abstract

Description

Background of the Invention

[0001] 1. Field of the Invention

[0002] The present invention relates generally to the field of computer networks, and more specifically, to a mechanism for performing pattern matching on network messages at high speed.

[0003] 2. Background Information

Summary of the Invention

Brief Description of the Drawings

[0015] The invention description below refers to the accompanying drawings, of which:

[0016] FIG. 1 is a highly schematic block diagram of a computer network;

[0017] FIG. 2 is a partial functional block diagram of an intermediate network device including a pattern matching engine in accordance with the present invention;

[0018] FIG. 3 is a highly schematic block diagram of the pattern matching engine of FIG. 2;

[0019] FIGS. 4 and 5 are representative data structures for use with the pattern matching engine of the present invention; and

[0020] FIGS. 6 and 7 are highly schematic, partial representations of the memory structures of the pattern matching engine.

Detailed Description of an Illustrative Embodiment

CONT

SEND

CNT

CALL

RET

MARK

MEMCPY

OFS

[0064] Other Actions

[0070] A Pattern Matching Example

[0084] As shown, logical CAM 634 efficiently executes a desired subroutine, e.g., skipping blank spaces.

Claims

1. A pattern matching engine for use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising;

13. The pattern matching engine of claim 12 wherein the second memory structure is a random access memory (RAM).

14. The pattern matching engine of claim 13 wherein the CAM is a ternary content addressable memory (TCAM) that supports don't care values.

storing the pre-defined regular expressions in a content-addressable memory (CAM) having a plurality of entries;

decoding a given network message, or selected portion thereof, for comparison with the regular expressions contained within the CAM;

inputting a decoded portion of the given network message to the CAM for comparison with all of the regular expressions stored therein;

decoding an output returned from the CAM; and

18. The method of claim 17 wherein the CAM is a ternary content addressable memory (TCAM) and the second memory structure is a random access memory (RAM).

19. An intermediate network device for use in processing and forwarding network messages in a computer network, the intermediate network device comprising:

a message processing card; and

a common bus that provides inter-communication between the plurality of line cards and the message processing card, wherein the message processing card comprises:

pattern matching engine far use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising:

25. A pattern matching engine for use in searching network messages for pre-defined regular expressions and for determining matches thereto, the pattern matching engine comprising:

Patent Citations (158)

Patent	Date	Inventor	Cited By
US4071887(A)	1978-01-01	Daly et al.	Applicant
US4404557(A)	1983-09-01	Grow	Applicant
US4495617(A)	1985-01-01	Ampulski et al.	Applicant
US4512014(A)	1985-04-01	Binz et al.	Applicant
US4530091(A)	1985-07-01	Crockett	Applicant
US4536876(A)	1985-08-01	Bahr et al.	Applicant
US4539679(A)	1985-09-01	Bux et al.	Applicant
US4543630(A)	1985-09-01	Neches	Applicant
US4549291(A)	1985-10-01	Renoulin et al.	Applicant
US4590554(A)	1986-05-01	Glazer et al.	Applicant
US4598400(A)	1986-07-01	Hillis	Applicant
US4604742(A)	1986-08-01	Hamada et al.	Applicant
US4609920(A)	1986-09-01	Segarra	Applicant
US4663748(A)	1987-05-01	Karbowiak et al.	Applicant
US4677614(A)	1987-06-01	Circo	Applicant
US4680757(A)	1987-07-01	Murakami et al.	Applicant
US4704680(A)	1987-11-01	Saxe	Applicant
US4709327(A)	1987-11-01	Hillis et al.	Applicant
US4709364(A)	1987-11-01	Hasegawa et al.	Applicant
US4713807(A)	1987-12-01	Caves et al.	Applicant
US4746920(A)	1988-05-01	Nellen et al.	Applicant
US4747130(A)	1988-05-01	Ho	Applicant
US4754395(A)	1988-06-01	Weisshaar et al.	Applicant
US4771423(A)	1988-09-01	Ohya et al.	Applicant
US4773038(A)	1988-09-01	Hillis et al.	Applicant
US4791641(A)	1988-12-01	Hillis	Applicant
US4805091(A)	1989-02-01	Thiel et al.	Applicant
US4805167(A)	1989-02-01	Leslie et al.	Applicant
US4809202(A)	1989-02-01	Wolfram	Applicant
US4814762(A)	1989-03-01	Franaszek	Applicant
US4815110(A)	1989-03-01	Benson et al.	Applicant
US4833468(A)	1989-05-01	Larson et al.	Applicant
US4864559(A)	1989-09-01	Perlman	Applicant
US4870568(A)	1989-09-01	Kahle et al.	Applicant
US4922418(A)	1990-05-01	Dolecek	Applicant
US4922486(A)	1990-05-01	Lidinsky et al.	Applicant
US4926446(A)	1990-05-01	Grover et al.	Applicant
US4930121(A)	1990-05-01	Shiobara	Applicant
US4949239(A)	1990-08-01	Gillett, Jr. et al.	Applicant
US4954988(A)	1990-09-01	Robb	Applicant
US4965717(A)	1990-10-01	Cutts, Jr. et al.	Applicant
US4993028(A)	1991-02-01	Hillis	Applicant
US5014265(A)	1991-05-01	Hahne et al.	Applicant
US5018137(A)	1991-05-01	Backes et al.	Applicant
US5027350(A)	1991-06-01	Marshall	Applicant
US5067078(A)	1991-11-01	Talgam et al.	Applicant
US5070446(A)	1991-12-01	Salem	Applicant
US5072422(A)	1991-12-01	Rachels	Examiner
US5088032(A)	1992-02-01	Bosack	Applicant
US5093801(A)	1992-03-01	White et al.	Applicant
US5111198(A)	1992-05-01	Kuszmaul	Applicant
US5113510(A)	1992-05-01	Hillis	Applicant
US5117420(A)	1992-05-01	Hillis et al.	Applicant
US5129077(A)	1992-07-01	Hillis	Applicant
US5148547(A)	1992-09-01	Kahle et al.	Applicant
US5151996(A)	1992-09-01	Hillis	Applicant
US5157663(A)	1992-10-01	Major et al.	Applicant
US5175865(A)	1992-12-01	Hillis	Applicant
US5212773(A)	1993-05-01	Hillis	Applicant
US5222216(A)	1993-06-01	Parish et al.	Applicant
US5222237(A)	1993-06-01	Hillis	Applicant
US5224099(A)	1993-06-01	Corbalis et al.	Applicant
US5247613(A)	1993-09-01	Bromley	Applicant
US5247694(A)	1993-09-01	Dahl	Applicant
US5255291(A)	1993-10-01	Holden et al.	Applicant
US5261105(A)	1993-11-01	Potter et al.	Applicant
US5265207(A)	1993-11-01	Zak et al.	Applicant
US5274631(A)	1993-12-01	Bhardwaj	Applicant
US5280470(A)	1994-01-01	Buhrke et al.	Applicant
US5289156(A)	1994-02-01	Ganmukhi	Applicant
US5295258(A)	1994-03-01	Jewett et al.	Applicant
US5301310(A)	1994-04-01	Isman et al.	Applicant
US5317726(A)	1994-05-01	Horst	Applicant
US5325487(A)	1994-06-01	Au et al.	Applicant
US5331637(A)	1994-07-01	Francis et al.	Applicant
US5349680(A)	1994-09-01	Fukuoka	Applicant
US5353283(A)	1994-10-01	Tsuchiya	Applicant
US5355492(A)	1994-10-01	Frankel et al.	Applicant
US5357612(A)	1994-10-01	Alaiwan	Applicant
US5359592(A)	1994-10-01	Corbalis et al.	Applicant
US5361256(A)	1994-11-01	Doeringer et al.	Applicant
US5361363(A)	1994-11-01	Wells et al.	Applicant
US5367692(A)	1994-11-01	Edelman	Applicant
US5388214(A)	1995-02-01	Leiserson et al.	Applicant
US5388262(A)	1995-02-01	Hillis	Applicant
US5390298(A)	1995-02-01	Kuszmaul et al.	Applicant
US5394402(A)	1995-02-01	Ross	Applicant
US5404296(A)	1995-04-01	Moorhead	Applicant
US5404562(A)	1995-04-01	Heller et al.	Applicant
US5410723(A)	1995-04-01	Schmidt et al.	Applicant
US5414704(A)	1995-05-01	Spinney	Applicant
US5428761(A)	1995-06-01	Herlihy et al.	Applicant
US5440752(A)	1995-08-01	Lentz et al.	Applicant
US5442633(A)	1995-08-01	Perkins et al.	Applicant
US5455932(A)	1995-10-01	Major et al.	Applicant
US5473607(A)	1995-12-01	Hausman et al.	Applicant
US5475856(A)	1995-12-01	Kogge	Applicant
US5485627(A)	1996-01-01	Hillis	Applicant
US5499384(A)	1996-03-01	Lentz et al.	Applicant
US5500860(A)	1996-03-01	Perlman et al.	Applicant
US5511168(A)	1996-04-01	Perlman et al.	Applicant
US5530809(A)	1996-06-01	Douglas et al.	Applicant
US5535408(A)	1996-07-01	Hillis	Applicant
US5561669(A)	1996-10-01	Lenney et al.	Applicant
US5566170(A)	1996-10-01	Bakke et al.	Applicant
US5568380(A)	1996-10-01	Brodnax et al.	Applicant
US5583996(A)	1996-12-01	Tsuchiya	Applicant
US5600644(A)	1997-02-01	Chang et al.	Applicant
US5612959(A)	1997-03-01	Takase et al.	Applicant
US5613136(A)	1997-03-01	Casavant et al.	Applicant
US5615360(A)	1997-03-01	Bezek et al.	Examiner
US5617421(A)	1997-04-01	Chin et al.	Applicant
US5617538(A)	1997-04-01	Heller	Applicant
US5621885(A)	1997-04-01	Del Vigna, Jr.	Applicant
US5627965(A)	1997-05-01	Liddell et al.	Applicant
US5633858(A)	1997-05-01	Chang et al.	Applicant
US5633866(A)	1997-05-01	Callon	Applicant
US5673423(A)	1997-09-01	Hillis	Applicant
US5684800(A)	1997-11-01	Dobbins et al.	Applicant
US5710814(A)	1998-01-01	Klemba et al.	Applicant
US5740171(A)	1998-04-01	Mazzola et al.	Applicant
US5742604(A)	1998-04-01	Edsall et al.	Applicant
US5748936(A)	1998-05-01	Karp et al.	Applicant
US5748963(A)	1998-05-01	Orr	Applicant
US5751955(A)	1998-05-01	Sonnier et al.	Applicant
US5758148(A)	1998-05-01	Lipovski	Examiner
US5764636(A)	1998-06-01	Edsall	Applicant
US5781715(A)	1998-07-01	Sheu	Applicant
US5781753(A)	1998-07-01	McFarland et al.	Applicant
US5787243(A)	1998-07-01	Stiffler	Applicant
US5787255(A)	1998-07-01	Parlan et al.	Applicant
US5796732(A)	1998-08-01	Mazzola et al.	Applicant
US5796740(A)	1998-08-01	Perlman et al.	Applicant
US5812811(A)	1998-09-01	Dubey et al.	Applicant
US5818842(A)	1998-10-01	Burwell et al.	Applicant
US5828844(A)	1998-10-01	Civanlar et al.	Applicant
US5832291(A)	1998-11-01	Rosen et al.	Applicant
US5838915(A)	1998-11-01	Klausmeier et al.	Applicant
US5842040(A)	1998-11-01	Hughes et al.	Applicant
US5852607(A)	1998-12-01	Chin	Applicant
US5860086(A)	1999-01-01	Crump et al.	Applicant
US5872963(A)	1999-02-01	Bitar et al.	Applicant
US5898686(A)	1999-04-01	Virgile	Applicant
US5909441(A)	1999-06-01	Alexander, Jr. et al.	Applicant
US5909550(A)	1999-06-01	Shankar et al.	Applicant
US5941988(A)	1999-08-01	Bhagwat et al.	Applicant
US5953512(A)	1999-09-01	Cai et al.	Applicant
US5960211(A)	1999-09-01	Schwartz et al.	Applicant
US6035422(A)	2000-03-01	Hohl et al.	Applicant
US6067569(A)	2000-05-01	Khaki et al.	Applicant
US6169999(B1)	2001-01-01	Kanno	Examiner
US6381673(B1)	2002-04-01	Srinivasan et al.	Examiner
US6389507(B1)	2002-05-01	Sherman	Examiner
US6480931(B1)	2002-11-01	Buti et al.	Examiner
US6510509(B1)	2003-01-01	Chopra et al.	Examiner
US6564289(B2)	2003-05-01	Srinivasan et al.	Examiner
US6574702(B2)	2003-06-01	Khanna et al.	Examiner
US6591331(B1)	2003-07-01	Khanna	Examiner

Non-Patent Literature (41)

Computer Architecture The Anatomy of Modern Processors, Pipeline Hazards, world wide web page http://ciips.ee.uwa.edu.au/˜morris/CA406/pipe_hazard.html, 1999, pp. 1-6.Applicant

Cisco Catalyst Workgroup Switch Version 3.0, web, http://www.cisco.com/warp/public/558/16.html, pp. 1-5.Applicant

Cisco VLAN Roadmap, web, http://www.cisco.com/warp/public/538/7.html, pp. 1-9.Applicant

IAC (SM) Newsletter Database (™) Communications Industry Researchers, Broadband Networks and Applications, copyright 1995 Information Access Company, a Thomson Corporation Company, Section No. 16, vol. E; ISSN: 1059-0544, Headline, Cisco Announces New Fast Ethernet Interface, pp. 2-3.Applicant

IAC (SM) Newsletter Database (™) Communications Industry Researchers, Broadband Networks and Applications, copyright 1995 Information Access Company, a Thomson Corporation Company, Section No. 16, vol. 3; ISSN: 1059-0544, Headline, Cisco Announces Token-Ring Switching Products, pp. 4-5.Applicant

Cisco 7000 Series Gains Fast Ethernet Interface, Becomes Only Router Family to Support Three High-Speed Network Types, web, http://www.cisco.com/warp/public/146/199.html pp. 1-2.Applicant

ISL Functional Specification, web, http://www.cisco.com/warp/public/741/4.htm, pp. 1-4.Applicant

Cisco-Catalyst 5000 Software Release 2.1 Feature Set, web, http://www.cisco.com/warp/public/729/c5000/426_pp.htm, pp. 1-9.Applicant

IEEE Standard Project P802.1Q, Draft Standard for Virtual Bridged Local Area Networks, Copyright by the Institute of Electrical and Electronics Engineers, Inc., Feb. 28, 1997, pp. 1-88.Applicant

Draft Standard P. 802 IQ/D10, IEEE Standards for Local and Metropolitan Area Networks: Virtual Bridged Local Area Networks, Copyright by the Institute of Electrical and Electronics Engineers, Inc., Mar. 22, 1997, pp. 1-212.Applicant

ISL Configurations for Cisco IOS and the Catalyst 5000, web, http://www.cisco.com/warp/public/741/8.html, pp. 1-8.Applicant

Dynamic Inter-Switch Link Protocol, 2.2 Configuration Note, pp. 2-6.Applicant

Virtual LANs, Catalyst 2820 Series and Catalyst 1900 Series Enterprise Edition Software Configuration Guide, Chapter 2, pp. 2-1-2-49.Applicant

Configuring VTP and Virtual LANs, Catalyst 5000 Series Software Configuration Guide, Chapter 13, pp. 13-1-13-24.Applicant

IEEE 1149.1 Device Architecture, http://www.asset-intertech.com/homepage/bscantutr/arch.htm, pp. 1-3, 1998.Applicant

IEEE 1149.1 Device Architecture (continued), Using the Instruction Register (IR), http://www.asset-intertech.com/homepage/bscantutr/arch2.htm#UsingIR, pp. 1-4, 1998.Applicant

The Principle of Boundary-Scan Architecture, http://www.asset-intertech.com/homepage/bscantutur/principl.htm, pp. 1-4, 1998.Applicant

IEEE 1149.1 Device Architecture (continued), The Test Access Port (TAP), http://www.asset-intertech.com/homepage/bscantutr/arch3.htm#TAP, pp. 1-3, 1998.Applicant

World Wide Web page http://www.synopsys.com/products/analysis/primtime_ds.html, Prime Time, Jul. 12, 1999, pp. 1-7.Applicant

World Wide Web page http://www.synopsys.com/products/analysis/primetime_cs.html, Prime Time: Full-Chip, Gate-Level Static Timing Analysis, Jul. 12, 1999, pp. 1-2.Applicant

World Wide Web page http://www.synopsys.com/products/analysis/sta_wp.html, Static Timing Verification: Methodology Overview, Jul. 12, 1999, pp. 1-13.Applicant

World Wide Web page http://www.synopsys.com/products/analysis/pt_tech_bgr.html, Prime Time Full-Chip Static Timing Analyzer, Jul. 12, 1999, pp. 1-17.Applicant

Pankaj Gupta and Nick McKeown, Packet Classification on Multiple Ends.Applicant

Dawson R. Engler and M. Frans Kaashoek, DPF: Fast, Flexible Message Demultiplexing using Dynamic Code Generation, 1996, pp. 53-59.Applicant

T.V. Lakshman and D. Stiliadis, High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching, 1998, pp. 203-214.Applicant

Press Release-Data Communications and Internetweek Editors Name Top Layer Networks' “App Switch” A Winner of the Best of Show Awards at Networld + Interop 99 Las Vegas, Top layer Networks, Inc., (c) 1999, pp. 1-2.Applicant

Curtone, Vic, AppSwitch Does Layer 7 Switching, Network Computing, May 3, 1999, pp. 1-3.Applicant

Layer 4 Switching: Unraveling the ‘Vendorspeak’, http://www.networking.com/shared/pr . . . cle?, Cisco Engineers, May 3, 1999, pp. 1-3.Applicant