|Publication number||US6871265 B1|
|Application number||US 10/079,229|
|Publication date||Mar 22, 2005|
|Filing date||Feb 20, 2002|
|Priority date||Feb 20, 2002|
|Publication number||079229, 10079229, US 6871265 B1, US 6871265B1, US-B1-6871265, US6871265 B1, US6871265B1|
|Inventors||Eyal Oren, David E. Belz, Alon Ratinsky|
|Original Assignee||Cisco Technology, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (17), Non-Patent Citations (6), Referenced by (43), Classifications (9), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention especially relates to computer and communications systems; and more particularly, the invention relates to maintaining netflow statistics using an associative memory, such as, but not limited to a content-addressable memory, to identify and maintain netflows.
The communications industry is rapidly changing to adjust to emerging technologies and ever increasing customer demand. This customer demand for new applications and increased performance of existing applications is driving communications network and system providers to employ networks and systems having greater speed and capacity (e.g., greater bandwidth). In trying to achieve these goals, a common approach taken by many communications providers is to use packet switching technology. Increasingly, public and private communications networks are being built and expanded using various packet technologies, such as Internet Protocol (IP).
A network device, such as a switch or router, typically receives, processes, and forwards or discards a packet based on one or more criteria, including the type of protocol used by the packet, addresses of the packet (e.g., source, destination, group), and type or quality of service requested. Additionally, one or more security operations are typically performed on each packet. But before these operations can be performed, a packet classification operation must typically be performed on the packet.
Packet classification as required for, inter alia, access control lists (ACLs) and forwarding decisions, is a demanding part of switch and router design. The packet classification of a received packet is increasingly becoming more difficult due to ever increasing packet rates and number of packet classifications. For example, ACLs require matching packets on a subset of fields of the packet flow label, with the semantics of a sequential search through the ACL rules. EP forwarding requires a longest prefix match.
Known approaches of packet classification include using custom application-specific integrated circuits (ASICs), custom circuitry, software or firmware controlled processors, binary and ternary content-addressable memories (CAMs). The use of programmable software or firmware have advantages as they provide some level of flexibility, which becomes especially important as new protocols and services are added to existing network. Customer typically desire to use their existing hardware (e.g., routers, switches etc.) to support these new protocols and services. However, known software and firmware implementations are relatively slow, and typically place a performance bound which may be incompatible with new requirements. Various applications that use packet classification, such as Security Access Control, Quality of Service etc., typically need to perform many matches on source and destination port numbers, protocol and/or other header fields, etc. in order to identify a corresponding netflow.
A known approach of identifying traffic flows for the purpose of prioritizing packets uses CAMs to identify and “remember” traffic flows allowing a network switch or router to identify packets belonging to that flow, at wire speed, without processor intervention. In one approach, learning new flows is automatic. Once a flow is identified, the system software assigns the proper priority to the newly identified flow. In each of the cases where learning is necessary (i.e., adding a new connection), the next free address of the device is read out so the system software can keep track of where the new additions are being placed. This way, the system software can efficiently remove these entries when they are no longer active. If aging is not used, the system software would need to keep track of the locations of every entry, and when a session ends, remove the corresponding entries. This is not a real-time issue, so software can provide adequate performance. Additionally, it is possible, even desirable to store timestamp information in the device to facilitate aging and purging of inactive flow identifiers.
For a purpose and context different from prioritizing packets, it is desirable to collect statistics about traffic flows (also referred to as “netflows”). These statistics can provide the metering base for real-time and post-processing applications including network traffic accounting, usage-based network billing, network planning, network monitoring, outbound marketing, and data mining capabilities for both service provider and enterprise customers.
However, known implementations for collecting netflow statistics use a CPU to examine each packet and a hashing function typically accessing a large data structure to identify a netflow and to maintain corresponding statistics. Such an implementation is CPU intensive, and may not be able to operate at the higher packet rates of certain systems. Needed are new methods and apparatus for collecting statistics on netflows.
Methods and apparatus are disclosed for maintaining netflow statistics using an associative memory, such as, but not limited to a content-addressable memory, to identify and maintain netflows. In one embodiment, a lookup operation in an associative memory on a set of associative memory entries based on an item to generate an associative memory result directly or after a subsequent memory read operation. This associative memory result is evaluated. In response to the associative memory result corresponding to a not found condition, an entry is added to the set of associative memory entries. In response to the associative memory result corresponding to a found condition, a statistics entry in the set of statistics is updated based on the associative memory result.
The appended claims set forth the features of the invention with particularity. The invention, together with its advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings of which:
Systems and methods are disclosed for maintaining netflow statistics using an associative memory, such as, but not limited to a content-addressable memory (CAM). Embodiments described herein include various elements and limitations, with no one element or limitation contemplated as being a critical element or limitation. Each of the claims individually recites an aspect of the invention in its entirety. Moreover, some embodiments described may include, but are not limited to, inter alia, systems, networks, integrated circuit chips, embedded processors, ASICs, methods, and computer-readable medium containing instructions. The embodiments described hereinafter embody various aspects and configurations within the scope and spirit of the invention, with the figures illustrating exemplary and non-limiting configurations.
As used herein, the term “packet” refers to packets of all types or any other units of information or data, including, but not limited to, fixed length cells and variable length packets, each of which may or may not be divisible into smaller packets or cells. The term “packet” as used herein also refers to both the packet itself or a packet indication, such as, but not limited to all or part of a packet or packet header, a data structure value, pointer or index, or any other part or identification of a packet. Moreover, these packets may contain one or more types of information, including, but not limited to, voice, data, video, and audio information. The term “item” is used herein to refer to a packet or any other unit or piece of information or data.
The term “system” is used generically herein to describe any number of components, elements, sub-systems, devices, packet switch elements, packet switches, routers, networks, computer and/or communication devices or mechanisms, or combinations of components thereof. The term “computer” is used generically herein to describe any number of computers, including, but not limited to personal computers, embedded processors and systems, control logic, ASICs, chips, workstations, mainframes, etc. The term “device” is used generically herein to describe any type of mechanism, including a computer or system or component thereof. The terms “task” and “process” are used generically herein to describe any type of running program, including, but not limited to a computer process, task, thread, executing application, operating system, user process, device driver, native code, machine or other language, etc., and can be interactive and/or non-interactive, executing locally and/or remotely, executing in foreground and/or background, executing in the user and/or operating system address spaces, a routine of a library and/or standalone application, and is not limited to any particular memory partitioning technique. The steps, connections, and processing of signals and information illustrated in the figures, including, but not limited to the block and flow diagrams, are typically performed in a different serial or parallel ordering and/or by different components and/or over different connections in various embodiments in keeping within the scope and spirit of the invention.
Moreover, the terms “network” and “communications mechanism” are used generically herein to describe one or more networks, communications mediums or communications systems, including, but not limited to the Internet, private or public telephone, cellular, wireless, satellite, cable, local area, metropolitan area and/or wide area networks, a cable, electrical connection, bus, etc., and internal communications mechanisms such as message passing, interprocess communications, shared memory, etc.
The term “storage mechanism” includes any type of memory, storage device or other mechanism for maintaining instructions or data in any format. “Computer-readable medium” is an extensible term including any memory, storage device, storage mechanism, and other storage and signaling mechanisms including interfaces and devices such as network interface cards and buffers therein, as well as any communications devices and signals received and transmitted, and other current and evolving technologies that a computerized system can interpret, receive, and/or transmit. The term “memory” includes any random access memory (RAM), read only memory (ROM), flash memory, integrated circuits, and/or other memory components or elements. The term “storage device” includes any solid state storage media, disk drives, diskettes, networked services, tape drives, and other storage devices. Memories and storage devices may store computer-executable instructions to be executed a processor and/or control logic, and data which is manipulated a processor and/or control logic. The term “data structure” is an extensible term referring to any data element, variable, data structure, data base, and/or one or more or an organizational schemes that can be applied to data to facilitate interpreting the data or performing operations on it, such as, but not limited to memory locations or devices, sets, queues, trees, heaps, lists, linked lists, arrays, tables, pointers, etc. A data structure is typically maintained in a storage mechanism. The term “associative memory” refers to all types of known or developed associative memories, including, but not limited to binary and ternary content-addressable memories, hash tables, TRIE and other data structures, etc.
The terms “first,” “second,” etc. are typically used herein to denote different units (e.g., a first element, a second element). The use of these terms herein does not necessarily connote an ordering such as one unit or event occurring or coming before the another, but rather provides a mechanism to distinguish between particular units. Moreover, the phrase “based on x” is used to indicate a minimum set of items x from which something is derived, wherein “x” is extensible and does not necessarily describe a complete list of items on which the operation is based. Additionally, the phrase “coupled to” is used to indicate some level of direct or indirect connection between two elements or devices, with the coupling device or devices modify or not modifying the coupled signal or communicated information. The term “subset” is used to indicate a group of all, less than all, or none of the elements of a set. Moreover, the term “or” is used herein to identify an alternative selection of one or more, including all, of the conjunctive items.
Methods and apparatus are disclosed for maintaining netflow statistics using an associative memory, such as, but not limited to a content-addressable memory, to identify and maintain netflows. In one embodiment, a lookup operation is performed in an associative memory on a set of associative memory entries based on an item to produce an associative memory result directly or after a subsequent memory read operation. This associative memory result is evaluated. In response to the associative memory result corresponding to a not found condition, an entry is added to the set of associative memory entries. In response to the associative memory result corresponding to a found condition, a statistics entry in the set of statistics is updated based on the associative memory result. In one embodiment, the associative memory is programmed with a set of permanent netflow entries and a set of dynamic or nonpermanent netflow entries. In one embodiment, the set of dynamic entries are maintained as a queue or ring buffer. In one embodiment, when the number of dynamic entries exceeds a threshold value, one or more of the dynamic entries and their corresponding statistics values are flushed to a netflow/statistics collector (e.g., a CPU or other hardware/software device or mechanism), which typically has a larger memory and collects all flushed entries from the associative memory and their corresponding statistics. In one embodiment, this flushing includes one or more of the oldest entries being removed from the dynamic set of entries and their corresponding statistics values extracted from the statistics mechanism for processing. In one embodiment, the oldest entry is located at the head of the queue or ring buffer. By dynamically changing the current set of statistics being collected by the statistics mechanism and the corresponding entries in an associative memory, the overall number of statistics collected can exceed the number of physical resources or entries available in the statistics mechanism and/or associative memory.
One embodiment includes a mechanism to automatically learn new flows, update their statistics, and export the data to a companion processor. One embodiment includes a ternary content-addressable memory (TCAM), which can be shared with other packet processing functions, and a programmable mechanism which creates a key from the packet header, information derived from the packet header (such as AS#), or other information (e.g., from an interface). This key is then used to perform a lookup operation in the TCAM. If there is a hit (e.g., a found condition), then byte, packet, and/or other counters, and possibly timestamp information are updated in a parallel SRAM for this entry. If there is a miss (e.g., a not found condition), then a new entry is added to the TCAM. If the number of free entries falls below a certain threshold, then an “old” entry is flushed. The TCAM is organized as a FIFO (e.g., ring buffer) of entries. Whenever an entry is flushed, or created, an information record is stored in an internal FIFO which is processed by the local CPU. The mechanism for reading this FIFO may or may not include a hardware DMA to move the data to the CPU's SDRAM, because in the most extreme case, the CPU cannot keep up with the rate of flow information being fed to it. In addition, in one embodiment, there is a background timer based task which periodically flushes out the TCAM entries so that flows that have stopped don't get missed by the CPU. Furthermore, this scheme will be repeated per packet for as many netflow tables are configured, each using its own key field.
Associative memory 110 performs a lookup operation on a receive item 107 to generate a result 113, which typically includes a hit indication (e.g., found or not found) and possibly an identification value of the successful match. Control logic 100 receives an indication of result 113, and if the item 107 was not found in the entries of associative memory 110, control logic 100 adds an entry corresponding to item 107 and initializes a corresponding location in memory 115 to identify a particular counter (e.g., a physical counter, memory location, other counting method or mechanism, etc.) within statistics mechanism 120, and possibly initializes this particular counter within counting mechanism 120 to zero, one, or some other number of counting units (e.g., packets, bytes, bits, any possible unit, etc) If, however, item 107 was matched in associative memory 110, then a read operation is performed on memory 115 based on result 113 to generate update signal 117 indicating the particular counter within statistics mechanism 120, and the particular counter being updated by some number of counting units by statistics mechanism 120.
In one embodiment, dynamic entries 420 are aged and routinely purged, such as when the number of entries within dynamic entries 420 exceeds a predetermined or dynamic threshold number of entries. Purging typically includes removing one or more entries from dynamic entries 420 and retrieved corresponding statistics values from statistics mechanism 120 by control logic 100. In one embodiment control logic 100 purges entries from and/or adds entries to permanent entries 410. In one embodiment, dynamic entries 420 are maintained by control logic 100 as a queue and/or ring buffer of entries using one or more of the following values or pointers: dynamic range first entry 421, ring buffer head pointer 422, ring buffer tail pointer 423, dynamic range last entry 424. In one embodiment, the ring buffer head pointer 422 and ring buffer tail pointer 423 identify the youngest and oldest entries in dynamic entries 420.
In one embodiment, control logic 100 (
Various embodiments of system 200 may include more or less elements. The operation of system 200 is typically controlled by processor 202 using memory 201 and storage devices 203 to perform one or more tasks or processes. Memory 201 is one type of computer-readable medium, and typically comprises random access memory (RAM), read only memory (ROM), flash memory, integrated circuits, and/or other memory components. Memory 201 typically stores computer-executable instructions to be executed by processor 202 and/or data which is manipulated by processor 202 for implementing functionality in accordance with an embodiment of the invention. Storage devices 203 are another type of computer-readable medium, and typically comprise solid state storage media, disk drives, diskettes, networked services, tape drives, and other storage devices. Storage devices 203 typically store computer-executable instructions to be executed by processor 202 and/or data which is manipulated by processor 202 for implementing functionality in accordance with an embodiment of the invention.
Processing begins with process block 600, and proceeds to process block 602. If the threshold number of entries in the dynamic set of entries is exceeded, then processing proceeds to process block 608. Otherwise, as determined in process block 604, if a timer has expired, then the timer is reset in process block 606, and processing also proceeds to process block 608. In process block 608, one or more of the entries are flushed from the dynamic set of entries which includes collecting corresponding statistics from the statistics mechanism. In one embodiment, flushing some of the dynamic entries includes retrieving their corresponding statistics values and removing their corresponding entries from a content-addressable memory (and possibly adjunct memory). In one embodiment, flushing some of the dynamic entries also includes only retrieving their corresponding statistics values to avoid of an overflow condition of a statistics element in response to, or based on a particular condition, such as but not limited to the expiration of a timer.
In process block 610, a packet is received. Next, as determined in process block 612, if there are no more netflows to generate for the received packet, then processing returns to process block 602. Otherwise, in process block 614, a netflow is generated from fields of the received packet and/or other sources.
In one embodiment, a lookup word either includes or has a corresponding indication of whether to perform the lookup in the (a) permanent entries, (b) dynamic entries, or (c) both the permanent and dynamic entries. In one embodiment, which set of entries on which to perform the lookup operation is implicit.
In process block 616, the netflow is forwarded to the associative memory. If, as determined in process block 618, the associative memory lookup operation did not result in a hit (e.g., the netflow is not in the associative memory), then processing proceeds to process block 620. If, as determined in process block 620, that an entry should be added to the set of dynamic entries (e.g., depending on the embodiment, when the lookup operation was performed on the dynamic entries, both the dynamic and permanent sets of entries, or just the permanent entries), then in process block 622, an entry corresponding to the netflow is added to the set of dynamic associative memory entries. In one embodiment, the CSRAM or other adjunct memory is also programmed with an indicator of the corresponding statistics element of the statistics mechanism. Next, in process block 624, the corresponding statistics entry of the statistic mechanism is added or initialized. Processing then returns to process block 612.
Otherwise, an associative memory hit was generated based on the netflow, and in process block 626, the associative memory result is produced directly from the value generated by the associative memory or retrieved from the CSRAM or other adjunct memory based on this value. In process block 628, the corresponding statistics entry (identified based on the associative memory result) is updated. Processing returns to process block 612.
In view of the many possible embodiments to which the principles of our invention may be applied, it will be appreciated that the embodiments and aspects thereof described herein with respect to the drawings/figures are only illustrative and should not be taken as limiting the scope of the invention. For example and as would be apparent to one skilled in the art, many of the process block operations can be re-ordered to be performed before, after, or substantially concurrent with other operations. Also, many different forms of data structures could be used in various embodiments. The invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5740175 *||Oct 3, 1995||Apr 14, 1998||National Semiconductor Corporation||Forwarding database cache for integrated switch controller|
|US5764634 *||Mar 13, 1996||Jun 9, 1998||International Business Machines Corporation||Lan switch with zero latency|
|US5842040||Jun 18, 1996||Nov 24, 1998||Storage Technology Corporation||Policy caching method and apparatus for use in a communication device based on contents of one data unit in a subset of related data units|
|US5872783 *||Jul 24, 1996||Feb 16, 1999||Cisco Systems, Inc.||Arrangement for rendering forwarding decisions for packets transferred among network switches|
|US5920886||Mar 14, 1997||Jul 6, 1999||Music Semiconductor Corporation||Accelerated hierarchical address filtering and translation using binary and ternary CAMs|
|US6018526 *||Feb 20, 1997||Jan 25, 2000||Macronix America, Inc.||Bridge device with self learning between network media and integrated circuit and method based on the same|
|US6026467 *||Oct 1, 1997||Feb 15, 2000||Lucent Technologies Inc.||Content-addressable memory implemented with a memory management unit|
|US6091725||Dec 29, 1995||Jul 18, 2000||Cisco Systems, Inc.||Method for traffic management, traffic prioritization, access control, and packet forwarding in a datagram computer network|
|US6219748||May 11, 1998||Apr 17, 2001||Netlogic Microsystems, Inc.||Method and apparatus for implementing a learn instruction in a content addressable memory device|
|US6236658 *||Nov 21, 1997||May 22, 2001||Cisco Technology, Inc.||Method and apparatus for message routing, including a content addressable memory|
|US6240485||May 11, 1998||May 29, 2001||Netlogic Microsystems, Inc.||Method and apparatus for implementing a learn instruction in a depth cascaded content addressable memory system|
|US6243667||May 28, 1996||Jun 5, 2001||Cisco Systems, Inc.||Network flow switching and flow data export|
|US6430190 *||May 3, 2001||Aug 6, 2002||Cisco Technology, Inc.||Method and apparatus for message routing, including a content addressable memory|
|US6473846 *||Jun 16, 2000||Oct 29, 2002||Aeroflex Utmc Microelectronic Systems, Inc.||Content addressable memory (CAM) engine|
|US6615260 *||Jan 11, 2000||Sep 2, 2003||Nec Corporation||Packet accounting machine|
|US6633567 *||Aug 31, 2000||Oct 14, 2003||Mosaid Technologies, Inc.||Method and apparatus for searching a filtering database with one search operation|
|US20030126358 *||Dec 28, 2001||Jul 3, 2003||Timothe Litt||Method and apparatus for implementing loop compression in a program counter trace|
|1||"Aging a Station List with a Time Stamp," Application Brief AB-N2, Rev. 1.1a Draft, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.|
|2||"Fast IPv4 and IPv4 CIDR Address Translation and Filtering Using the MUAC Routing CoProcessor (RCP)," Application Note AN-N25, Rev. 0a, Music Semiconductors, Milpitas, CA, Oct. 1, 1998, 16 pages.|
|3||"Using MUSIC Devices and RCPs for IP Flow Recognition," Application Note AN-N27, Rev. 0, Music Semiconductors, Milpitas, CA, Oct. 21, 1998, 20 pages.|
|4||"Wide Ternary Searches Using Music CAMs and RCPs," Application Note AN-N31, Rev. 0, Music Semiconductors, Milpitas, CA, Apr. 13, 1999, 8 pages.|
|5||Shah et al., Maintaining Statistics Counters in Router Line Cards, IEEE Micro, vol. 22, Issue 1, Jan.-Feb. 2002, pp. 76-81.|
|6||Steve Stas, "Enhancing LAN Bridge Designs with Associated Data," Application Note AN-N1, Rev. 1.5, Music Semiconductors, Milpitas, CA, Apr. 15, 1997, 8 pages.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6988106||Jul 9, 2003||Jan 17, 2006||Cisco Technology, Inc.||Strong and searching a hierarchy of items of particular use with IP security policies and security associations|
|US7080195||Oct 22, 2003||Jul 18, 2006||Cisco Technology, Inc.||Merging indications of matching items of multiple groups and possibly associated with skip conditions to identify winning entries of particular use for implementing access control lists|
|US7197597||Jul 22, 2003||Mar 27, 2007||Cisco Technology, Inc.||Performing lookup operations in a content addressable memory based on hashed values of particular use in maintaining statistics for packet flows|
|US7219195||Dec 21, 2004||May 15, 2007||Cisco Technology, Inc.||Associative memory with invert result capability|
|US7240149||Nov 6, 2003||Jul 3, 2007||Cisco Technology, Inc.||Multiple branch operations in an associative memory|
|US7249228||Mar 1, 2004||Jul 24, 2007||Cisco Technology, Inc.||Reducing the number of block masks required for programming multiple access control list in an associative memory|
|US7257672||Nov 16, 2005||Aug 14, 2007||Cisco Technology, Inc.||Error protection for lookup operations performed on ternary content-addressable memory entries|
|US7290083||Jun 29, 2004||Oct 30, 2007||Cisco Technology, Inc.||Error protection for lookup operations in content-addressable memory entries|
|US7325074||Nov 15, 2005||Jan 29, 2008||Cisco Technology, Inc.||Incremental compilation of packet classifications using fragmented tables|
|US7493328||Nov 13, 2005||Feb 17, 2009||Cisco Technology, Inc.||Storing and searching a hierarchy of policies and associations thereof of particular use with IP security policies and security associations|
|US7523251||Jan 18, 2005||Apr 21, 2009||Cisco Technology, Inc.||Quaternary content-addressable memory|
|US7646771||Sep 28, 2005||Jan 12, 2010||Cisco Technology, Inc.||Compilation of access control lists|
|US7689889||Aug 24, 2006||Mar 30, 2010||Cisco Technology, Inc.||Content addressable memory entry coding for error detection and correction|
|US7724728||May 5, 2005||May 25, 2010||Cisco Technology, Inc.||Policy-based processing of packets|
|US7773590||Apr 26, 2005||Aug 10, 2010||Cisco Technology, Inc.||Combined interface and non-interface specific associative memory lookup operations for processing of packets|
|US7843827||Dec 19, 2006||Nov 30, 2010||International Business Machines Corporation||Method and device for configuring a network device|
|US7855967 *||Sep 26, 2008||Dec 21, 2010||Tellabs San Jose, Inc.||Method and apparatus for providing line rate netflow statistics gathering|
|US7941527||Nov 19, 2007||May 10, 2011||Cisco Technology, Inc.||Tuning aging parameters for flows in flow-based systems|
|US7941606||Jul 22, 2003||May 10, 2011||Cisco Technology, Inc.||Identifying a flow identification value mask based on a flow identification value of a packet|
|US8199644||May 5, 2010||Jun 12, 2012||Lsi Corporation||Systems and methods for processing access control lists (ACLS) in network switches using regular expression matching logic|
|US8456987||Dec 8, 2005||Jun 4, 2013||Cisco Technology, Inc.||Method and apparatus for route optimization enforcement and verification|
|US8750144 *||Oct 20, 2010||Jun 10, 2014||Google Inc.||System and method for reducing required memory updates|
|US8942106||May 24, 2013||Jan 27, 2015||Cisco Technology, Inc.||Method and apparatus for route optimization enforcement and verification|
|US9558048||Aug 10, 2012||Jan 31, 2017||Oracle International Corporation||System and method for managing message queues for multinode applications in a transactional middleware machine environment|
|US9559958||Nov 28, 2013||Jan 31, 2017||Cisco Technology, Inc.||Resolving a monitor based on information in a plurality of packets|
|US20050010612 *||Jul 9, 2003||Jan 13, 2005||Cisco Technology, Inc.||Storing and searching a hierarchy of items of particular use with IP security policies and security associations|
|US20050114602 *||Oct 22, 2003||May 26, 2005||Cisco Technology, Inc.||Merging indications of matching items of multiple groups and possibly associated with skip conditions to identify winning entries of particular use for implementing access control lists|
|US20050289295 *||Jun 29, 2004||Dec 29, 2005||Cisco Technology, Inc.||Error Protection For Lookup Operations in Content-Addressable Memory Entries|
|US20060074899 *||Nov 13, 2005||Apr 6, 2006||Cisco Technology, Inc., A California Corporation||Storing and searching a hierarchy of policies and associations thereof of particular use with IP security policies and security associations|
|US20060080498 *||Nov 16, 2005||Apr 13, 2006||Cisco Technology, Inc.||Error protection for lookup operations performed on ternary content-addressable memory entries|
|US20060136660 *||Dec 21, 2004||Jun 22, 2006||Cisco Technology, Inc.||Associative memory with invert result capability|
|US20060161729 *||Jan 18, 2005||Jul 20, 2006||Nemat Awais B||Quaternary content-addressable memory|
|US20060233173 *||May 5, 2005||Oct 19, 2006||Pullela Venkateshwar R||Policy-based processing of packets|
|US20060239258 *||Apr 26, 2005||Oct 26, 2006||Cisco Technology, Inc., A California Corporation||Combined interface and non-interface specific associative memory lookup operations for processing of packets|
|US20070112794 *||Nov 15, 2005||May 17, 2007||Mcrae Andrew||Incremental compilation of packet classifications using fragmented tables|
|US20070147246 *||Dec 19, 2006||Jun 28, 2007||International Business Machines Corporation||Method and device for configuring a network device|
|US20070150593 *||Dec 28, 2005||Jun 28, 2007||Telefonaktiebolaget Lm Ericsson (Publ)||Network processor and reference counting method for pipelined processing of packets|
|US20070260728 *||May 4, 2007||Nov 8, 2007||Finisar Corporation||Systems and methods for generating network diagnostic statistics|
|US20080049522 *||Aug 24, 2006||Feb 28, 2008||Cisco Technology, Inc.||Content addressable memory entry coding for error detection and correction|
|US20080186971 *||Aug 27, 2007||Aug 7, 2008||Tarari, Inc.||Systems and methods for processing access control lists (acls) in network switches using regular expression matching logic|
|US20100217936 *||May 5, 2010||Aug 26, 2010||Jeff Carmichael||Systems and methods for processing access control lists (acls) in network switches using regular expression matching logic|
|US20130086183 *||Aug 10, 2012||Apr 4, 2013||Oracle International Corporation||System and method for providing message queues for multinode applications in a middleware machine environment|
|WO2006028656A3 *||Aug 15, 2005||Feb 22, 2007||Fisher Rosemount Systems Inc||Low latency data packet reception and processing|
|U.S. Classification||711/128, 711/133, 711/108, 711/159|
|International Classification||H04L12/26, H04L29/06, G06F12/00|
|Feb 20, 2002||AS||Assignment|
Owner name: CISCO TECHNOLOGY, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:OREN, EYAL;BELZ, DAVID E.;RATINSKY, ALON;REEL/FRAME:012626/0983
Effective date: 20020217
|Aug 28, 2007||CC||Certificate of correction|
|Aug 19, 2008||FPAY||Fee payment|
Year of fee payment: 4
|Sep 24, 2012||FPAY||Fee payment|
Year of fee payment: 8
|Oct 28, 2016||REMI||Maintenance fee reminder mailed|