US 7,961,734 B2Grant
Methods and apparatus related to packet classification associated with a multi-stage switch
Issue Date:2011-06-14
•20 Claims
•6 Drawing Sheets
Abstract
In one embodiment, an apparatus can include a policy vector module configured to retrieve a compressed policy vector based on a portion of a data packet received at a multi-stage switch. The apparatus can also include a decompression module configured to receive the compressed policy vector and configured to define a decompressed policy vector based on the compressed policy vector. The decompressed policy vector can define a combination of bit values associated with a policy.
Metadata
Assignee
- Juniper Networks, Inc.
Inventors
- Ramesh Panwar
- Deepak Goel
- Srinivasan Jagannadhan
- Jean-Marc Frailong
Application Information
Application Number:US 12/242,168
Filing Date:2008-09-30
Priority Date:2008-09-30
Art Unit:2465
Classifications
IPC:
H04L12/28
Patent Drawings (6 sheets)
Description
Related Application
[0001] This application is related to a co-pending U.S. patent application Ser. No. 12/242,172, entitled “Methods and Apparatus for Packet Classification Based on Policy Vectors,” filed on Sep. 30, 2008, which is incorporated herein by reference in its entirety.
Background
[0002] Embodiments described herein relate generally to packet classification, and, in particular, to packet classification at a multi-stage switch.
[0003] A data packet received at a network device can be processed based on one or more policies established by, for example, a network administrator. Any processing performed so that the data packet can be subsequently processed at the network device based on a policy can be referred to as packet classification. Packet classification can include, for example, associating the data packet with an appropriate policy from a library of policies based on information included in the data packet such as an address value and/or a port value. A packet classification scheme can be used to, for example, distinguish and route groups of data packets within a firewall or through a switch fabric associated with a multi-stage switch.
[0004] Known packet classification schemes, such as those based on Ternary Content Addressed Memories (TCAMs) or software algorithms, can have power requirements, chip area requirements, and/or storage requirements that may be undesirable in some applications. For example, known software packet classification algorithms that rely on relatively large data structures resident in external memory (external to a processing chip) may have memory bandwidth limitations that can make their use in very high speed switches and routers impractical. Power consumption requirements and/or inefficient chip designs associated with some known packet classification schemes may substantially prevent scaling of these packet classification schemes, for example, for use in a complex routing system such as a data center.
[0005] Thus, a need exists for methods and apparatus for packet classification that have desirable power, chip area, and/or storage characteristics.
Summary of the Invention
[0006] In one embodiment, an apparatus can include a policy vector module configured to retrieve a compressed policy vector based on a portion of a data packet received at a multi-stage switch. The apparatus can also include a decompression module configured to receive the compressed policy vector and configured to define a decompressed policy vector based on the compressed policy vector. The decompressed policy vector can define a combination of bit values associated with a policy.
Brief Description of the Drawings
[0007] FIG. 1 is a schematic block diagram that illustrates a packet classification module included in a multi-stage switch, according to an embodiment.
[0008] FIG. 2 is a schematic block diagram of a packet classification module, according to an embodiment.
[0009] FIG. 3 is a schematic diagram that illustrates a key vector defined based on a portion of a data packet, according to an embodiment.
[0010] FIG. 4 is a schematic diagram that illustrates compressed policy vectors included in a policy vector database, according to an embodiment.
[0011] FIG. 5 is a schematic diagram that illustrates a decompressed policy vector configured to trigger processing at a multi-stage switch, according to an embodiment.
[0012] FIG. 6 is a flowchart that illustrates a method for classification of a data packet, according to an embodiment.
[0013] FIG. 7 is a schematic block diagram that illustrates a packet classification module configured to define a combined policy vector based on multiple portions of a data packet, according to an embodiment.
[0014] FIG. 8 is a flowchart that illustrates a method for defining a combined policy vector, according to an embodiment.
[0015] FIG. 9 is a schematic block diagram that illustrates a packet classification module configured to process a data packet, according to an embodiment.
Detailed Description
[0016] A packet classification module at a multi-stage switch can be configured to classify a data packet (e.g., an Internet Protocol (IP) packet, a session control protocol packet, a media packet) received at the multi-stage switch from a network entity. Classifying can include any processing performed so that the data packet can be processed at the multi-stage switch based on a policy. In some embodiments, the policy can include one or more policy conditions that are associated with an instruction that can be executed at the multi-stage switch. The policy can be, for example, a policy to route a data packet to a particular destination (instruction) if the data packet has a specified type of network address (policy condition). Packet classification can include determining whether or not the policy condition has been satisfied so that the instruction can be executed. For example, one or more portions (e.g., a field, a payload, an address portion, a port portion) of the data packet can be analyzed by the packet classification module based on a policy condition defined within a policy. When the policy condition is satisfied, the data packet can be processed based on an instruction associated with the policy condition.
[0017] In some embodiments, a data packet can be associated with a policy vector that can include one or more bit values that represent whether or not a policy condition associated with a policy has been satisfied based on processing of a portion of the data packet. The policy vector can be used to trigger processing of the data packet at the multi-stage switch based on an instruction associated with the policy (when the bit value(s) indicate that the policy condition has been satisfied). In some embodiments, a policy vector can be referred to as a facet cover vector.
[0018] In some embodiments, a policy condition can be related to a prefix length of an address value and/or a range of port values. The policy condition can be satisfied, for example, when a port value included in a data packet falls within a specified range of port values. In some embodiments, this type of policy condition can be referred to as a match condition or as a filter condition. In some embodiments, an instruction associated with a policy condition can be related to, for example, routing of a data packet through a switch fabric of a multi-stage switch.
[0019] The packet classification module (including any sub-modules and/or memory) can be implemented in hardware. For example, sub-modules of the packet classification module that are configured to process the data packet based on one or more policy conditions associated with a policy can be implemented in hardware. In addition, modules that are configured to execute an instruction associated with a policy can be implemented in hardware and can be included in a packet classification. In some embodiments, the packet classification module (including sub-modules and memory) can be integrated on a single (or common) semiconductor chip. In some embodiments, one or more portions of the packet classification module can be implemented in software, or implemented in a combination of hardware and software.
[0020] In some embodiments, the process of classifying a data packet can be referred to as classification. In some embodiments, a portion of a multi-stage switch can be configured to trigger another portion of the multi-stage switch to execute an instruction associated with a policy. In some embodiments, a multi-stage switch can be configured to trigger, based on a policy vector, execution of an instruction at a separate entity. In some embodiments, a data packet can be processed based on a policy that is associated with a group of data packets. In some embodiments, the group of data packets can be referred to as a data packet flow or as a flow.
[0021] In some embodiments, a vector, such as the policy vector, can be a binary string defined by, for example, a sequence of high values (represented as 1's) and/or low values (represented as 0's). The values in the binary string can be referred to as bit values. In other words, the vector can define a sequence of bit values. In some embodiments, for example, if a packet classification module is implemented in a hardware system that is a base-n system (e.g., a base-4 system), a vector processed by the packet classification module can be a base-n string. In some embodiments, the vector can be defined as a one-dimensional array. In some embodiments, for example, if a packet classification module is implemented in software, a vector processed by the packet classification module can be a string that includes a sequence of symbols (e.g., American Standard Code for Information Interchange (ASCII) characters) and/or digits. For example, the vector can be a byte string or a hexadecimal value.
[0022] FIG. 1 is a schematic block diagram that illustrates a packet classification module 102 included in a multi-stage switch 100, according to an embodiment. The multi-stage switch 100 includes a switch fabric 106 that can have multiple stages (e.g., an ingress stage, an egress stage, a middle stage) through which a data packet can be routed. In some embodiments, the switch fabric 106 can be defined based on a Clos network architecture (e.g., a non-blocking Clos network, a strict sense non-blocking Clos network, a Benes network). In some embodiments, a network architecture such as, for example, a Clos network and/or a Benes network can be reconfigurable (e.g., rearrangeable). In some embodiments, the switch fabric 106 can be a reconfigurable switch fabric and/or a time-division multiplexed switch fabric.
[0023] The packet classification module 102 can be configured to receive a data packet from at least one of the network entities 180, which include network entity 110, network entity 120, and network entity 130, and is configured to classify the data packet so that the data packet can be processed based on a policy. The policy can include one or more policy conditions associated with an instruction that can be executed at the multi-stage switch 100. One or more portions of the data packet can be analyzed by the packet classification module 102 based on a policy condition (e.g., a match condition) associated with a policy. The data packet can be processed by a packet processing module 104 based on an instruction associated with the policy condition when the policy condition is satisfied. In some embodiments, the packet processing module 102 can execute one or more portions of the instruction associated with the policy and/or can trigger another entity (not shown) to execute one or more portions of the instruction associated with the policy. In some embodiments, processing of a data packet based on the instruction can include, for example, logging information related to the data packet, verifying information at the multi-stage switch 100, forwarding the data packet to a specific destination such as one of the network entities 180, dropping the data packet (or a related data packet), routing a portion of a data packet flow associated with the data packet through switch fabric 106 of the multi-stage switch 100, and so forth.
[0024] In some embodiments, the packet classification module 102 can be configured to define (e.g., produce) a policy vector based on one or more portions of a data packet. The policy vector can include one or more bit values that represent whether or not a policy condition associated with a policy has been satisfied based on the portion(s) of the data packet. The policy vector can be used by the packet processing module 104 to process the data packet and/or to trigger processing of the data packet at the multi-stage switch 100, based on an instruction associated with the policy (when the bit value(s) indicate that the policy condition has been satisfied). In some embodiments, the policy vector can be a decompressed policy vector that has been defined based on a compressed policy vector. More details related to compression and decompression of policy vectors are discussed in connection with FIG. 2 .
[0025] As shown in FIG. 1 , a data packet 10 is sent from network entity 110 and received at the multi-stage switch 100. Data packet 10 is classified at the packet classification module 102. Specifically, packet classification module 102 associates data packet 10 with a policy vector based on information from the data packet 10. As shown in FIG. 1 , the data packet 10 is routed through the switch fabric 106 to network entity 120 based on processing of the data packet 10 at packet processing module 104. The processing of the data packet 10 at the packet processing module 104 can be triggered based on the policy vector associated at the packet classification module 102 with the data packet 10.
[0026] In some embodiments, each of the network entities 180 (e.g., network entity 110) can be a wired device and/or a wireless device and can be, for example, a computing entity (e.g., a personal computing device), a mobile phone, a personal digital assistant (PDA), and/or a server (e.g., a web server/host). In some embodiments, each of the network entities 180 can function as a source device and/or as a destination device. Each of the network entities 180 can be configured to operate based on one or more platforms that can include one or more types of hardware, software, operating systems, runtime libraries, and so forth. The network 170 can be, for example, a virtual network, a local area network (LAN) and/or a wide area network (WAN) and can include one or more wired and/or wireless segments.
[0027] The packet classification module 102 and/or the packet processing module 104 can be a hardware-based module (e.g., a processor, an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA)). In other words, the packet classification module 102 and/or the packet processing module 104 can be implemented entirely in hardware. In some embodiments, the entire packet classification module 102 (including look-up tables associated with the packet classification module 102) and/or the packet processing module 104 can be integrated on one or more semiconductor chips that can have one or more substrates. In some embodiments, one or more portions of the packet classification module 102 and/or the packet processing module 104 can be implemented in software (e.g., a set of instructions executable at a processor, a software application). In some embodiments, one or more portions (e.g., operations, functions) of the packet classification module 102 and/or the packet processing module 104 can implemented in a combination of hardware and software.
[0028] FIG. 2 is a schematic block diagram of a packet classification module 230, according to an embodiment. The packet classification module 230 can be included in a multi-stage switch (not shown in FIG. 1 ). The packet classification module 230 includes a key vector module 240 configured to produce a key vector 12 based on a data packet 11. In some embodiments, the data packet 11 can be received from a network entity (not shown in FIG. 1 ) via a network (not shown in FIG. 1 ). The key vector 12 can be used by the policy vector module 250 to retrieve a compressed policy vector 14 from a policy vector database 260 when at least one policy condition is satisfied. Specifically, the policy vector module 250 produces an index value 13 based on the key vector 12; the compressed policy vector 14 can then be retrieved from the policy vector database 260 by policy vector module 250 using an index value 13. Although not shown, the policy vector database 260 can be stored in a memory that has addressable locations.
[0029] After the compress policy vector 14 has been retrieved, the compressed policy vector 14 can be decompressed by a decompression module 270 into a decompressed policy vector 16. In other words, the compressed policy vector 14 can be processed by decompression module 270 based on a decompression algorithm to define a decompressed policy vector 16. The decompressed policy vector 16 can be used by the packet processing module 290 to trigger and/or perform processing associated with the data packet 11 based on an instruction retrieved from, for example, an instruction database. The policy condition used to retrieve the compressed policy vector 14 and the instruction can be associated with (e.g., defined within) a policy. In some embodiments, the instruction database can be included in the packet processing module 290.
[0030] The key vector module 240 can be configured to parse (e.g., extract) bit values associated with certain portions of the data packet 11 to define the key vector 12. In other words, the key vector module 240 can be configured to parse a portion from the data packet 11 received at the packet classification module 230 and can use that portion to produce the key vector 12. In some embodiments, the key vector 12 can be defined based on portions of the data packet 11 that have been modified by the key vector module 240 or are unmodified.
[0031] In some embodiments, the key vector module 240 can be configured to define and include additional bit values (or strings) in the key vector 12. In some embodiments, the additional bit values can be default bit values and/or padding (e.g., zero padding). In some embodiments, for example, the key vector 12 can be defined based on additional bit values appended to, intermingled with, and/or logically combined with a portion of the data packet 11. In some embodiments, the key vector 12 can have a specified quantity of bit values, such as, for example, a 1 bit width, a 72 bit width, or a 400 bit width. An example of a key vector defined based on a data packet is described in connection with FIG. 3 .
[0032] FIG. 3 is a schematic diagram that illustrates a key vector 330 defined based on a portion 322 of a data packet 324, according to an embodiment. The portion 322 can be, for example, a field (or a portion of a field) from a header, a payload, and/or a trailer of the data packet 324. In some embodiments, the portion 322 can be referred to as a facet. In some embodiments, the portion 322 can be associated with any of an address value (e.g., a destination address value, a source address value), a port value (e.g., a source port value, a destination port value), a protocol indicator, a type value, and so forth. In some embodiments, the bit values of the portion 322 of the data packet 324 can be modified before being included in the key vector 330. In some embodiments, the key vector 330 can be a key vector. An example of a binary representation of a key vector 330 is shown below:
-
- [0033] 00 000100 11001000 00000000 00000000 00000000 00000000 00000000
[0034] As shown in FIG. 3 , the key vector 330 includes a bit string 332 defined based on the data packet 324. In some embodiments, the bit string 332 can be a metadata tag that represents a characteristic of the key vector 330 (e.g., a length of the key vector 330) and/or a characteristic of the data packet 324 (e.g., a protocol type).
[0035] Referring back to FIG. 2 , the policy vector module 250 can be configured to retrieve a compressed policy vector 14 from the policy vector database 260 based on the key vector 12 and based on at least one policy condition associated with a policy. The policy vector module 250 can be configured to execute one or more functions that can use the key vector 12 to retrieve the compressed policy vector 14. The function(s) can have one or more portions defined based on the policy condition(s) so that the compressed policy vector 14 is retrieved based on whether or not the policy condition(s) is satisfied. In other words, the policy condition(s) can be integrated into (e.g., encoded within) and applied by the function (and the policy vector module 250) so that the compressed policy vector 14 can be defined based on whether or not the policy condition(s) is satisfied. In some embodiments, a policy condition can be satisfied when a portion of the data packet 11, which can be encoded in the key vector 12, is matched to a range of values defined within the policy condition.
[0036] As shown in FIG. 2 , the policy vector module 250 is configured to process the key vector 12 to define an index value 13 based on the key vector 12 and based on a policy condition. The index value 13 can be used by the policy vector module 250 to retrieve the compressed policy vector 14 from the policy vector database 260. In some embodiments, the index value 13 can be an address value associated with a memory location. In some embodiments, the evaluation of the policy condition(s) can be integrated into the functionality of the policy vector module 250 so that the index value 13 can be defined based on whether or not the policy condition is satisfied.
[0037] In some embodiments, the policy vector module 250 can be configured to process the key vector 12 based on, for example, a hash-based search function (also can be referred to as a hash function), a trie-based search function, a look-up table search function (e.g., a direct look-up table search function), and/or a node-based search function (also can be referred to linked-node function). More details related to hash functions and hash function processing within a packet classification module are set forth in co-pending U.S. patent application Ser. No. 12/242,154, filed on Sep. 30, 2008, entitled “Methods and Apparatus Related to Packet Classification Based on Range Values,” and co-pending U.S. patent application Ser. No. 12/242,158, filed on Sep. 30, 2008, entitled “Methods and Apparatus for Producing a Hash Value Based on a Hash Function,” both of which are incorporated herein by reference in their entireties. More details related to node-based functions are provided in co-pending U.S. patent application Ser. No. 12/242,125, filed on Sep. 30, 2008, entitled “Methods and Apparatus for Range Matching During Packet Classification Based on a Linked-Node Structure,” which is incorporated herein by reference in its entirety.
[0038] FIG. 4 is a schematic diagram that illustrates compressed policy vectors 464 included in a policy vector database 460, according to an embodiment. The policy vector database 460 is an example of an implementation of the policy vector database 260 shown in FIG. 2 . The policy vector database 460 includes policy vectors CPV1 through CPVK. Each of the policy vectors 464 is stored at a location within a memory 470 represented by one of the address values A1 through AK. In some embodiments, the address values 462 can be referred to as memory address values. The index value 35 can be used to locate at least one of the compressed policy vectors 464 stored in the policy vector database 460 at a particular address value 462. In some embodiments, the index value 35 can correspond with one of the address values 462. In some embodiments, the policy vector database 460 can include a logic module (not shown) that can use bit values that define the index value 35 to retrieve a compressed policy vector from the policy vector database 460.
[0039] In some embodiments, the memory 470 can be any type of memory such as a read-only memory (ROM) or a random-access memory (RAM). In some embodiments, the policy vector database 460 can be a look-up table (LUT) or a memory array. In some embodiments, the policy vector database 460 can be a relational database. Because the policy vectors stored in the policy vector database 460 are compressed policy vectors 464, the memory 470 can be relatively small and can be integrated with a policy vector module (not shown) on a single (or common) semiconductor chip. In some embodiments, the compressed policy vectors 464 can be compressed based on a pattern compression scheme and/or a run-length compression scheme.
[0040] Referring back to FIG. 2 , the decompression module 270 can be configured to define a decompressed policy vector 16 based on the compressed policy vector 14. Specifically, the compressed policy vector 14 can be processed by the decompression module 270 to produce the decompressed policy vector 16 based on a decompression algorithm associated with a compression/decompression scheme. This type of processing can be referred to as decompression. In some embodiments, the compression/decompression scheme can be referred to as a codec. After the compressed policy vector 14 has been decompressed by the decompression module 270, the decompressed policy vector 16 can be used by the packet processing module 290 to trigger and/or perform processing associated with the data packet 11.
[0041] The compressed policy vector 14 can be processed based on a codec to define the decompressed policy vector 16. The codec can also be used to define the compressed policy vector 14 based on the decompressed policy vector 16. For example, if the compressed policy vector 14 was defined (e.g., compressed) based on a pattern and run-length codec, the decompressed policy vector 16 can be defined (e.g., decompressed) from the compressed policy vector 14 based on the same pattern and run-length codec.
[0042] In some embodiments, the compressed policy vector 14 can have a number of bit values that is at least an order of magnitude smaller than a number of bit values included in the decompressed policy vector 16. For example, the compressed policy vector 14 can have a bitwise width of 32 bits and the decompressed policy vector 16 can have a bitwise width of 2048 bits (2K bits). More details related to compression and decompression of policy vectors are set for in co-pending U.S. patent application Ser. No. 12/242,143, filed Sep. 30, 2008, entitled, “Methods and Apparatus for Compression in Packet Classification,” which is incorporated herein by reference in its entirety.
[0043] In some embodiments, the packet processing module 290 can be integrated into the packet classification module 230. For example, although not shown, a packet processing module can be included within the same semiconductor chip as a packet classification module implemented in hardware. In some embodiments the packet processing module 290 can be an element included in a multi-stage switch (not shown) and can be associated with a switch fabric (not shown) of the multi-stage switch.
[0044] FIG. 5 is a schematic diagram that illustrates a decompressed policy vector 510 configured to trigger processing at a multi-stage switch, according to an embodiment. The decompressed policy vector 510 can be configured to trigger processing at, for example, a packet processing module (not shown) within the multi-stage switch. The decompressed policy vector 510 includes bit values T1 through TN, each of which can be configured to trigger processing at the multi-stage switch. Specifically, each set of bit values (e.g., bit values that have a high binary value) in the decompressed policy vector 510 represent whether or not a policy condition associated with a policy has been satisfied. The set of bit values can be used to look-up an instruction from instructions 1 through N in database 520 (also can be referred to as an instruction database). After an instruction has been identified, the instruction can be executed at the multi-stage switch. In some embodiments, the decompressed policy vector 510 can be configured to trigger processing associated with data packet 11 and/or can be configured to trigger processing of a data packet flow associated with data packet 11. In some embodiments, a bit value can be set when the bit value is low or zero.
[0045] As shown in the decompress policy vector 510 in FIG. 5 , bit value T3, which is set, is associated with instructions, and bit value TN-1, which is also set, is associated with instructionN-1. Accordingly, bit value T3 can be used to trigger execution of instructions and bit value TN-1 can be used to trigger execution of instructionN-1. The instruction can be related to processing of a data packet at a packet processing module at a multi-stage switch (not shown) such as, for example, routing of the data packet via a switch fabric (not shown) of the multi-stage switch.
[0046] In some embodiments, a combination of bit values (e.g., binary values of 1's and/or 0's) within the policy vector can represent whether or not a policy condition associated with one or more instructions has been satisfied. In other words, a sequence of bit values including more than one bit value can represent that a policy condition associated with an instruction has been satisfied. Accordingly, the sequence of bit values within the policy vector can trigger execution of an instruction. In some embodiments, a single bit value within the policy vector can represent that a policy condition associated with more than one instruction has been satisfied. In some embodiments, the single bit value within the policy vector can be used to trigger execution of the instructions.
[0047] FIG. 6 is a flowchart that illustrates a method for classification of a data packet, according to an embodiment. A data packet is received at a multi-stage switch at 600. The data packet can be received from a source network entity. In some embodiments, the data packet can be associated with a flow of data packets received at the multi-stage switch.
[0048] A key vector is defined based on a portion of the data packet at 610. In some embodiments, the key vector can be defined based on a field from the data packet. In some embodiments, the key vector can be defined based on another data packet from a flow of data packets associated with the data packet. In some embodiments, the key vector can be defined based on a combination of portions of data packets from a flow of data packets associated with the data packet.
[0049] A compressed policy vector is produced based on the key vector at 620. In some embodiments, the compressed policy vector can be selected from a policy database based on processing of the key vector. In some embodiments, the key vector can be processed based on a hash-based search function, a trie-based search function, a look-up table search function, and/or a node-based search function. The hash-based search function, a trie-based search function, a look-up table search function, and/or the node-based search function can be implemented, for example, in hardware within a packet classification module.
[0050] A decompressed policy vector is defined based on the compressed policy vector at 630. The compressed policy vector can be used to define the decompressed policy vector based on a decompression algorithm associated with a codec. In some embodiments, the decompression algorithm can be implemented in hardware within a packet classification module.
[0051] The data packet is processed at the multi-stage switch based on the decompressed policy vector at 640. Specifically, one or more of the bit values within the decompressed policy vector can be configured to trigger an element of the multi-stage switch to process the data packet. For example, a bit value within the decompressed policy vector can be configured to trigger the multi-stage stage to forward the data packet (and/or a flow of data packet associated with the data packet) to a destination entity via a switch fabric associated with the multi-stage switch. In some embodiments, a bit value within the decompressed policy vector can be configured to, for example, trigger the multi-stage switch to drop the packet or log information related to the data packet.
[0052] FIG. 7 is a schematic block diagram that illustrates a packet classification module 730 configured to define a combined policy vector 64 based on multiple portions of a data packet 62, according to an alternative embodiment. In some embodiments, the combined policy vector 64 can be referred to as a master policy vector. The packet classification module 730 can be included in a multi-stage switch (not shown). In some embodiments, the data packet 62 can be received at the multi-stage switch from a network entity (not shown in FIG. 7 ) via a network (not shown in FIG. 7 ).
[0053] As shown in FIG. 7 , the data packet 62 has two portions—portion 61 and portion 63—that are processed within a processing pipeline that includes a key vector module 740, a policy vector module 750, and a decompression module 770. In some embodiments, the processing pipeline can be referred to as a processing path.
[0054] The key vector module 740 is configured to define a key vector KVA based on portion 61 of the data packet 62. The key vector KVA can be used by the policy vector module 750 to retrieve a compressed policy vector CPVA from the policy vector database 760. In some embodiments, the policy vector module 750 can process the key vector KVA to define an index value; the policy vector module 750 can then retrieve the compressed policy vector CPVA from the policy vector database 760 based on the index value. Although not shown, the policy vector database 760 can be stored in a memory. A decompressed policy vector DPVA can be defined at the decompression module 770 based on the compressed policy vector CPVA.
[0055] Portion 63 of the data packet 62 can similarly be processed through the processing pipeline. The key vector module 740 can be configured to produce a key vector KVB based on the portion 63 of the data packet 62. The key vector KVB can be used by the policy vector module 750 to retrieve the compressed policy vector CPVB from the policy vector database 760, and a decompressed policy vector DPVB can be defined at the decompression module 770 based on the compressed policy vector CPVB.
[0056] In this embodiment, the key vectors KVA and KVB are different. In some embodiments, portion 61 of the data packet 62 and portion 63 of the data packet 62 can be mutually exclusive portions of the data packet 62. Although not shown, in some embodiments, the different key vectors KVA and KVB can be defined based on the same portion (or overlapping portions) of the data packet 62. In some embodiments, data packet 62 can be associated with a flow of data packets (not shown). Although not shown, in some embodiments, key vector KVA and/or key vector KVB can be defined based a portion of the flow of data packets.
[0057] As shown in FIG. 7 , a combined policy vector 64 can be defined at a combination module 780 based on a combination of at least a portion of the decompressed policy vector DPVA and at least a portion of the decompressed policy vector DPVB. In some embodiments, the combination module 780 can be considered part of the processing pipeline. In some embodiments, at least a portion of the decompressed policy vector DPVA and at least a portion of the decompressed policy vector DPVB can be combined using a bitwise operation. For example, the decompressed policy vector DPVA and the decompressed policy vector DPVB can be combined in a bitwise “and” operation to define the combined policy vector 64. In some embodiments, the decompressed policy vector DPVA and decompressed policy vector DPVB can be used within a function (e.g., an algorithm) to define the combined policy vector 64. The combined policy vector 64 can be used by the packet processing module 790 to trigger and/or perform processing associated with the data packet 62 and/or a flow of data packets associated with data packet 62.
[0058] In some embodiments, the decompressed policy vector DPVA, the decompressed policy vector DPVB, and/or the combined policy vector 64 can have different sequences of bit values. In other words, two or more of the decompressed policy vector DPVA, the decompressed policy vector DPVB, and the combined policy vector 64 can have different set bit values that can each be associated with different instructions. In some embodiments, two or more of the decompressed policy vector DPVA, the decompressed policy vector DPVB, and the combined policy vector 64 can have similar or identical sequences of bit values. In some embodiments, two or more of the decompressed policy vector DPVA, the decompressed policy vector DPVB, and the combined policy vector 64 can have different bitwise lengths.
[0059] In some embodiments, portion 61 of the data packet 62 and portion 63 of the data packet 62 can be processed through the pipeline serially. For example, portion 61 of the data packet 62 can be processed through the processing pipeline before portion 63 of the data packet 62 is processed through the processing pipeline, and vice versa. In some embodiments, portion 61 of data packet 62 and portion 63 of the data packet 62 can be processed serially through one or more of the modules of the packet classification module 730. For example, portion 61 of data packet 62 can be processed at the key vector module 740 directly after portion 63 of the data packet 62 has finished processed at the key vector module 740.
[0060] In some embodiments, portion 61 of the data packet 62 and portion 63 of the data packet 62 can be processed through the processing pipeline in parallel. For example, portion 61 of the data packet 62 and portion 63 of the data packet 62 can be processed via different parallel portions (e.g., different hardware portions, or mutually exclusive hardware portions) of the modules included in the packet classification module 730. More details related to parallel processing at a packet classification module are described in connection with FIG. 9 .
[0061] FIG. 8 is a flowchart that illustrates a method for defining a combined policy vector, according to an embodiment. As shown in FIG. 8 , a data packet is received at a multi-stage switch at 800. The data packet can be received from a source network entity. In some embodiments, the data packet can be associated with a flow of data packets received at the multi-stage switch.
[0062] A first policy vector is produced (e.g., defined) based on a first portion of the data packet at 810. The first policy vector can be produced based on processing of the first portion of the data packet via a processing pipeline of a classification module. The processing pipeline can include a key vector module, a policy vector module (and/or policy vector database), a decompression module, and/or a combination module.
[0063] A second policy vector is produced (e.g., defined) based on a second portion of the data packet at 820. The second policy vector can be produced based on processing of the second portion of the data packet via the processing pipeline of the classification module. In some embodiments, the first portion of the data packet and the second portion of the data packet can be processed via portions of the processing pipeline serially or in parallel. In some embodiments, the first portion of the data packet and the second portion of the data packet can be processed via some portions of the processing pipeline serially and via other portions of the processing pipeline in parallel. The second portion of the data packet can be different than the first portion of the data packet. In some embodiments, the second policy vector can be different than or the same as the first policy vector.
[0064] A combined policy vector is defined based on a combination of the first policy vector and the second policy vector at 830. In some embodiments, the first policy vector and/or the second policy vector can be decompressed policy vectors. In some embodiments, the combined policy vector can be defined based on a bitwise combination of at least a portion of the first policy vector and at least a portion of the second policy vector. In some embodiments, at least a portion of the first policy vector and at least a portion of the second policy vector can be combined based on a function (e.g., an algorithm). In some embodiments, the combined policy vector can be defined based on a concatenation of at least a portion of the first policy vector and at least a portion of the second policy vector.
[0065] FIG. 9 is a schematic block diagram that illustrates a packet classification module 930 configured to process a data packet 73, according to another embodiment. Specifically, the packet classification module 930 is configured to process a portion 71 of the data packet 73 associated with an address value, and a portion 72 of the data packet 73 associated with a port value. In some embodiments, the address value can be, for example, an IP address value. In some embodiments, the port value can represent an input/output (I/O) port associated a network entity. Data, such as the data packet 73, are shown as dotted boxes, and processing paths are shown as dotted lines.
[0066] As shown in FIG. 9 , portion 71 of data packet 73 and portion 72 of data packet 73 are processed in parallel via the packet classification module 930. Address key vector 81 and port key vector 82 are defined at the key vector module 940 based on portion 71 of data packet 73 and portion 72 of data packet 73, respectively. In some embodiments, the address key vector 81 and the port key vector 82 can be defined via mutually exclusive hardware portions of the key vector module 940.
[0067] The address key vector 81 can be processed via a hash-based search function module 952 of a policy vector module 950 so that a compressed address policy vector 83 can be selected and retrieved from the policy vector database 954. One or more policy conditions associated with a policy (or policies) can be integrated into (e.g., encoded within) and applied by the hash-based search function module 952. The port policy vector 82 can be processed at a node-based search function module 956 so that a compressed port policy vector 84 can be selected and retrieved from the policy vector database 954. One or more policy conditions associated with a policy (or policies) can be integrated into (e.g., encoded within) and applied by the node-based search function module 956.
[0068] Although the policy vector database 954 is shown as a single database, in some embodiments, the policy vector database 954 can be stored in more than one separate database. For example, the node-based search function module 956 can be configured to access (e.g., use) a first policy vector database (not shown) and the hash-based search function module 952 can be configured to access (e.g., use) a second policy vector database (not shown) separate from the first policy vector database. In some embodiments, the policy vector database 954 can be stored in a memory (not shown). In some embodiments, the memory can be integrated into a semiconductor chip as part of the packet classification module 930 or can be an external memory. In some embodiments, the policy vector database 954 can be implemented in hardware within the packet classification module 930.
[0069] The compressed address policy vector 83 and the compressed port policy vector 84 are both decompressed at the decompression module 960. In some embodiments, the compressed address policy vector 83 and the compressed port policy vector 84 can be processed via mutually exclusive hardware portions of the decompression module 960.
[0070] As shown in FIG. 9 , the compressed policy vector 83 can be processed at an exception module 964. The exception module 964 can be configured to handle an exception to a policy condition related to portion 71 of the data packet 73 and can be configured to modify the decompressed address policy vector 85 accordingly. In some embodiments, an exception to a policy condition can be associated with an instruction and can be defined within a policy. For example, a first instruction can be executed when a policy condition is satisfied and a different instruction can be executed when the policy condition is satisfied but an exception to the policy condition is also satisfied. Although not shown, in some embodiments, the decompressed port policy vector 86 can also be modified at the exception module 964 (or a mutually exclusive portion of the exception module (not shown)) based on an exception to a policy condition related to portion 72 of the data packet 73. More details related to a handling of an exception to a policy condition are set forth in co-pending U.S. patent application Ser. No. 12/242,278, filed Sep. 30, 2008, entitled, “Methods and Apparatus to Implement Except Condition During Data Packet Classification,” which is incorporated herein by reference in its entirety.
[0071] The combined policy vector 87 is defined at the combination module 970 based on a bitwise “and” combination of the decompressed address policy vector 85 and the decompressed port policy vector 86. Although not shown, in some embodiments, the combined policy vector 87 can be defined based on a different logical operation such as an exclusive—or operation or a complex logical operation that includes multiple gate types (e.g., an “or” gate) and/or an algorithm.
[0072] As shown in FIG. 9 , the combined policy vector 87 can be sent to a packet processing module 980. The packet processing module 790 can be configured to trigger and/or perform processing associated with the data packet 73 and/or a flow of data packets associated with data packet 73 based on the combined policy vector 87. Specifically, the packet processing module 790 can be configured to trigger and/or perform specified instructions associated with bit values that are set within the combined policy vector 87.
[0073] In some embodiments, each of the components (e.g., modules) within the packet classification module 930 can be implemented in hardware within one or more semiconductor chips. In some embodiments, the packet processing module 980 can be integrated with the packet classification module 930 on a single integrated chip.
[0074] Some embodiments described herein relate to a computer storage product with a computer-readable medium (also can be referred to as a processor-readable medium) having instructions or computer code thereon for performing various computer-implemented operations. The media and computer code (also can be referred to as code) may be those designed and constructed for the specific purpose or purposes. Examples of computer-readable media include, but are not limited to: magnetic storage media such as hard disks, floppy disks, and magnetic tape; optical storage media such as Compact Disc/Digital Video Discs (CD/DVDs), Compact Disc-Read Only Memories (CD-ROMs), and holographic devices; magneto-optical storage media such as optical disks; carrier wave signal processing modules; and hardware devices that are specially configured to store and execute program code, such as Application-Specific Integrated Circuits (ASICs), Programmable Logic Devices (PLDs), and Read-Only Memory (ROM) and Random-Access Memory (RAM) devices.
[0075] Examples of computer code include, but are not limited to, micro-code or micro-instructions, machine instructions, such as produced by a compiler, code used to produce a web service, and files containing higher-level instructions that are executed by a computer using an interpreter. For example, embodiments may be implemented using Java, C++, or other programming languages (e.g., object-oriented programming languages) and development tools. Additional examples of computer code include, but are not limited to, control signals, encrypted code, and compressed code.
[0076] While various embodiments have been described above, it should be understood that they have been presented by way of example only, not limitation, and various changes in form and details may be made. Any portion of the apparatus and/or methods described herein may be combined in any combination, except mutually exclusive combinations. The embodiments described herein can include various combinations and/or sub-combinations of the functions, components and/or features of the different embodiments described. For example, in some embodiments, a policy vector database can be configured to store decompressed policy vectors. In such cases, a decompression module would not need to be included as a component in a packet classification module. In some embodiments, for example, one or more combined policy vectors can be defined based on N compressed (and/or decompressed) policy vectors.
Claims
What is claimed is:
1. An apparatus comprising:
a policy vector module implemented in at least one of a memory or a processing device, configured to retrieve a compressed policy vector based on a portion of a data packet received at a multi-stage switch; and
a decompression module configured to receive the compressed policy vector and configured to define a first decompressed policy vector based on the compressed policy vector, the first decompressed policy vector defining a combination of bit values associated with a policy; and
a combination module configured to receive the first decompressed policy vector and configured to produce a combined policy vector based on a combination of the first decompressed policy vector and a second decompressed policy vector, the combined policy vector configured to trigger an element at the multi-stage switch to process the data packet.
2. The apparatus, of claim 1, further comprising:
a key vector module configured to define a key vector including a bit sequence corresponding to the portion of the data packet, the policy vector module configured to receive the key vector from the key vector module and configured to retrieve the compressed policy vector based on the key vector.
3. The apparatus of claim 1, wherein the policy vector module includes at least one of a hash-based search function module or a node-based search function module.
4. The apparatus of claim 1, wherein the portion of the data packet is a first portion of the data packet,
The combination module configured to produce the combined policy vector based on a boolean combination of the first decompressed policy vector and the second decompressed policy vector, the second decompressed policy vector being defined based on a second portion of the data packet different than the first portion of the data packet.
5. The apparatus of claim 1, wherein the policy vector module is configured to define an index value based on a key vector,
the apparatus further comprising:
a policy vector database including a plurality of compressed policy vectors, the compressed policy vector being retrieved from the policy vector database based on the index value.
6. The apparatus of claim 1, further comprising:
a packet processing module configured to receive the first decompressed policy vector and configured to trigger an element at the multi-stage switch to process the data packet based on a combination of bit values defined by the first decompressed policy vector.
7. The apparatus of claim 1, further comprising:
a packet processing module configured to execute an instruction associated with the data packet based on the combined policy vector defining a sequence of bit values, the combined policy vector being defined based on the combination of the first decompressed policy vector and the second decompressed policy vector.
8. The apparatus of claim 1, further comprising:
a switch fabric associated with the multi-stage switch; and
a packet processing module configured to trigger routing through the switch fabric based on a sequence of bit values defined by the first decompressed policy vector.
9. An apparatus, comprising:
a memory configured to store a policy vector database including a plurality of compressed policy vectors;
a policy vector module configured to produce an index value based on a portion of a data packet received at a multi-stage switch, the policy vector module configured to retrieve a compressed policy vector from the plurality of compressed policy vectors based on the index value, the memory and the policy vector module being integrated on a common chip;
a decompression module configured to receive the compressed policy vector and configured to produce a decompressed policy vector based on the compressed policy vector; and
a packet processing module configured to receive the decompressed policy vector and configured to trigger based on a set of bit values defined by the decompressed policy vector an element at the multi-stage switch to process the data packet.
10. The apparatus of claim 9, wherein: the set of bit values are configured to trigger execution of an instruction associated with a policy.
11. The apparatus of claim 9, further comprising:
a key vector module configured to define a key vector including a bit sequence corresponding to the portion of the data packet, the policy vector module configured to receive the key vector from the key vector module and configured to produce the index value based on the key vector.
12. The apparatus of claim 9, wherein the policy vector module is configured to produce the index value based on at least one of a hash-based search function module or a node-based search function module.
13. The apparatus of claim 9, further comprising:
an exception module configured to associate the portion of the data packet with an exception vector based on an exception condition being satisfied, the exception module configured to modify the decompressed policy vector based on the exception vector.
14. A method, comprising:
defining a key vector based on a portion of a data packet received at a multi-stage switch;
retrieving a first compressed policy vector based on the key vector and a hash-based search function module;
defining a decompressed policy vector having a plurality of policy bit values based on the first compressed policy vector, a policy bit value from the plurality of policy bit values being configured to trigger an element at the multi-stage switch to process the data packet when the policy bit value is set; and
retrieving a second compressed policy vector based on a node-based search function module.
15. The method of claim 14, wherein the data packet is included in a flow of data packets, the element at the multi-stage switch is configured to process the flow of data packets.
16. The method of claim 14, wherein the decompressed policy vector is a first decompressed policy vector, the method further comprising:
defining a combined policy vector based on a logical combination of the first decompressed policy vector and a second decompressed policy vector.
17. The method of claim 14, wherein each of the policy bit values is associated with at least one term included in a policy associated with the multi-stage switch.
18. The method of claim 14, wherein the data packet is defined based on Internet Protocol version 6.
19. The method of claim 14, wherein the key vector is a first key vector, the portion of the data packet is a first portion of the data packet,
the method further comprising:
defining a second key vector based on a second portion of the data packet, the second portion of the data packet being mutually exclusive from the first portion of the data packet,
the retrieving the second compressed policy vector being based on the second key vector.
20. The method of claim 14, wherein the key vector is a first key vector, the portion of the data packet is a first portion of the data packet,
the method further comprising:
defining a second key vector based on a second portion of the data packet, the second portion of the data packet overlapping with the first portion of the data packet,
the retrieving the second compressed policy vector being based on the second key vector.
Patent Citations (112)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4215402(A) | 1980-07-01 | Mitchell et al. | Applicant |
| US5473607(A) | 1995-12-01 | Hausman et al. | Applicant |
| US5495476(A) | 1996-02-01 | Kumar | Applicant |
| US6073160(A) | 2000-06-01 | Grantham et al. | Applicant |
| US6157955(A) | 2000-12-01 | Narad et al. | Examiner |
| US6212184(B1) | 2001-04-01 | Venkatachary et al. | Applicant |
| US6226629(B1) | 2001-05-01 | Cossock | Applicant |
| US6266705(B1) | 2001-07-01 | Ullum et al. | Applicant |
| US6457058(B1) | 2002-09-01 | Ullum et al. | Applicant |
| US6587466(B1) | 2003-07-01 | Bhattacharya et al. | Applicant |
| US6600741(B1) | 2003-07-01 | Chrin et al. | Examiner |
| US6600744(B1) | 2003-07-01 | Carr et al. | Applicant |
| US6618397(B1) | 2003-09-01 | Huang | Examiner |
| US6654373(B1) | 2003-11-01 | Maher, III et al. | Applicant |
| US6658482(B1) | 2003-12-01 | Chen et al. | Applicant |
| US6665274(B1) | 2003-12-01 | Yamada | Applicant |
| US6675163(B1) | 2004-01-01 | Bass et al. | Applicant |
| US6721316(B1) | 2004-04-01 | Epps et al. | Applicant |
| US6731631(B1) | 2004-05-01 | Chang et al. | Applicant |
| US6731644(B1) | 2004-05-01 | Epps et al. | Applicant |
| US6735670(B1) | 2004-05-01 | Bronstein et al. | Applicant |
| US6754662(B1) | 2004-06-01 | Li | Applicant |
| US6778532(B1) | 2004-08-01 | Akahane et al. | Applicant |
| US6778546(B1) | 2004-08-01 | Epps et al. | Applicant |
| US6778984(B1) | 2004-08-01 | Lu et al. | Applicant |
| US6789118(B1) | 2004-09-01 | Rao | Applicant |
| US6813243(B1) | 2004-11-01 | Epps et al. | Applicant |
| US6859455(B1) | 2005-02-01 | Yazdani et al. | Applicant |
| US6862278(B1) | 2005-03-01 | Chang et al. | Applicant |
| US6889225(B2) | 2005-05-01 | Cheng et al. | Applicant |
| US6917946(B2) | 2005-07-01 | Corl, Jr. et al. | Applicant |
| US6925085(B1) | 2005-08-01 | Krishna et al. | Applicant |
| US6940862(B2) | 2005-09-01 | Goudreau | Applicant |
| US6947931(B1) | 2005-09-01 | Bass et al. | Applicant |
| US6977930(B1) | 2005-12-01 | Epps et al. | Applicant |
| US7042878(B2) | 2006-05-01 | Li | Examiner |
| US7089240(B2) | 2006-08-01 | Basso et al. | Applicant |
| US7133400(B1) | 2006-11-01 | Henderson et al. | Applicant |
| US7136926(B1) | 2006-11-01 | Iyer et al. | Applicant |
| US7173931(B2) | 2007-02-01 | Chao et al. | Applicant |
| US7190696(B1) | 2007-03-01 | Manur et al. | Applicant |
| US7193997(B2) | 2007-03-01 | Van Lunteren et al. | Applicant |
| US7227842(B1) | 2007-06-01 | Ji et al. | Applicant |
| US7233568(B2) | 2007-06-01 | Goodman et al. | Applicant |
| US7233579(B1) | 2007-06-01 | Crump et al. | Applicant |
| US7277429(B2) | 2007-10-01 | Norman et al. | Applicant |
| US7325074(B2) | 2008-01-01 | McRae | Applicant |
| US7349415(B2) | 2008-03-01 | Rangarajan et al. | Applicant |
| US7356033(B2) | 2008-04-01 | Basu et al. | Applicant |
| US7369561(B2) | 2008-05-01 | Wybenga et al. | Applicant |
| US7373345(B2) | 2008-05-01 | Carpentier et al. | Applicant |
| US7382637(B1) | 2008-06-01 | Rathnavelu et al. | Applicant |
| US7382777(B2) | 2008-06-01 | Irish et al. | Applicant |
| US7382876(B2) | 2008-06-01 | Lauter et al. | Applicant |
| US7383244(B2) | 2008-06-01 | Bass et al. | Applicant |
| US7394809(B2) | 2008-07-01 | Kumar et al. | Examiner |
| US7403524(B2) | 2008-07-01 | Hill | Applicant |
| US7403526(B1) | 2008-07-01 | Zou et al. | Applicant |
| US7418505(B2) | 2008-08-01 | Lim et al. | Applicant |
| US7441268(B2) | 2008-10-01 | Remedios | Applicant |
| US7480302(B2) | 2009-01-01 | Choi | Applicant |
| US7543052(B1) | 2009-06-01 | Cesa | Applicant |
| US7602787(B2) | 2009-10-01 | Cheriton | Applicant |
| US7610330(B1) | 2009-10-01 | Quinn et al. | Applicant |
| US7646771(B2) | 2010-01-01 | Guru et al. | Applicant |
| US7668160(B2) | 2010-02-01 | Narayan et al. | Applicant |
| US7738454(B1) | 2010-06-01 | Panwar et al. | Applicant |
| US2002/0138648(A1) | 2002-09-01 | Liu | Applicant |
| US2002/0152209(A1) | 2002-10-01 | Merugu et al. | Applicant |
| US2002/0191605(A1) | 2002-12-01 | Lunteren et al. | Applicant |
| US2003/0023846(A1) | 2003-01-01 | Krishna et al. | Applicant |
| US2003/0030575(A1) | 2003-02-01 | Frachtenberg et al. | Applicant |
| US2003/0053460(A1) | 2003-03-01 | Suda et al. | Applicant |
| US2003/0059045(A1) | 2003-03-01 | Ruehle | Applicant |
| US2003/0156586(A1) | 2003-08-01 | Lee et al. | Applicant |
| US2003/0219017(A1) | 2003-11-01 | Davis et al. | Applicant |
| US2003/0223424(A1) | 2003-12-01 | Anderson et al. | Applicant |
| US2003/0233516(A1) | 2003-12-01 | Davis et al. | Applicant |
| US2004/0015599(A1) | 2004-01-01 | Trinh et al. | Applicant |
| US2004/0028046(A1) | 2004-02-01 | Govindarajan et al. | Applicant |
| US2004/0095936(A1) | 2004-05-01 | O'Neill et al. | Applicant |
| US2004/0100950(A1) | 2004-05-01 | Basu et al. | Examiner |
| US2004/0100959(A1) | 2004-05-01 | Relan | Applicant |
| US2004/0190526(A1) | 2004-09-01 | Kumar et al. | Applicant |
| US2004/0254909(A1) | 2004-12-01 | Testa | Applicant |
| US2004/0258067(A1) | 2004-12-01 | Irish et al. | Applicant |
| US2004/0264373(A1) | 2004-12-01 | Engbersen et al. | Applicant |
| US2005/0083935(A1) | 2005-04-01 | Kounavis et al. | Applicant |
| US2005/0141510(A1) | 2005-06-01 | Narsinh et al. | Applicant |
| US2005/0226235(A1) | 2005-10-01 | Kumar et al. | Applicant |
| US2005/0232261(A1) | 2005-10-01 | Wybenga et al. | Applicant |
| US2005/0237938(A1) | 2005-10-01 | Corl Jr., et al. | Applicant |
| US2006/0050690(A1) | 2006-03-01 | Epps et al. | Applicant |
| US2006/0083247(A1) | 2006-04-01 | Mehta | Applicant |
| US2006/0195896(A1) | 2006-08-01 | Fulp et al. | Applicant |
| US2006/0218167(A1) | 2006-09-01 | Bosley et al. | Applicant |
| US2006/0221954(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2006/0221956(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2006/0221967(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2007/0008962(A1) | 2007-01-01 | Basu et al. | Applicant |
| US2007/0070900(A1) | 2007-03-01 | Heink et al. | Applicant |
| US2007/0071233(A1) | 2007-03-01 | Zak | Applicant |
| US2007/0115986(A1) | 2007-05-01 | Shankara | Applicant |
| US2007/0133593(A1) | 2007-06-01 | Shankara | Applicant |
| US2007/0234005(A1) | 2007-10-01 | Erlingsson et al. | Applicant |
| US2007/0283045(A1) | 2007-12-01 | Nguyen et al. | Applicant |
| US2008/0177812(A1) | 2008-07-01 | Brandle | Applicant |
| US2008/0186974(A1) | 2008-08-01 | Singh et al. | Applicant |
| US2008/0228798(A1) | 2008-09-01 | Van Lunteren | Applicant |
| US2009/0196297(A1) | 2009-08-01 | Jabr | Applicant |
| US2010/0040067(A1) | 2010-02-01 | Hao et al. | Applicant |
| US2010/0080224(A1) | 2010-04-01 | Panwar et al. | Applicant |
Non-Patent Literature (15)
- H. Jonathan Chao et al. “Matching Algorithms for Three-Stage Bufferless Clos Network Switches” IEEE Communications Magazine, Oct. 2003, pp. 46-54.Applicant
- Itamar Elhanany et al. “High-performance Packet Switching Architectures” Springer Science & Business Media, ISBN-10: 184628273X, 2002, Chapter 10, 20 pages.Applicant
- Final Office Action mailed Oct. 13, 2010 for U.S. Appl. No. 12/347,495 (14 pages).Applicant
- Office Action mailed May 10, 2010 for U.S. Appl. No. 12/242,143 (23 pages).Applicant
- Office Action mailed Apr. 23, 2010 for U.S. Appl. No. 12/347,495 (11 pages).Applicant
- Office Action mailed Jun. 10, 2010 for U.S. Appl. No. 12/242/278, filed Sep. 30, 2008 (24 pages).Applicant
- U.S. Appl. No. 12/874,681, filed Sep. 2, 2010, entitled “Methods and Apparatus For Range Matching During Packet Classification Based on a Linked-Node Structure” (42 pages).Applicant
- U.S. Appl. No. 12/242,143, filed Sep. 30, 2008, entitled “Methods and Apparatus For Compression In Packet Classification” (34 pgs).Applicant
- U.S. Appl. No. 12/242,125, filed Sep. 30, 2008, entitled “Methods and Apparatus For Range Matching During Packet Classification Based on a Linked-Node Structure” (39 pgs).Applicant
- U.S. Appl. No. 12/242,278, filed Sep. 30, 2008, entitled “Methods and Apparatus To Implement Except Condition During Data Packet Classification” (35 pgs).Applicant
- U.S. Appl. No. 12/794,175, filed Jun. 4, 2010 entitled “Methods And Apparatus Related To Packet Classification Based On Range Values” (42 pgs).Applicant
- U.S. Appl. No. 12/242,158, filed Sep. 30, 2008 entitled “Methods And Apparatus For Producing A Hash Value Based On A Hash Function” (37 pgs).Applicant
- U.S. Appl. No. 12/347,495, filed Dec. 31, 2008 entitled “Methods and Apparatus for Packet Classification Based on Multiple Conditions” (40 pgs).Applicant
- U.S. Appl. No. 12/347,499, filed Dec. 31, 2008 entitled “Methods and Apparatus for Packet Classification Based on Multiple Conditions” (41 pgs).Applicant
- U.S. Appl. No. 12/347,418, filed Dec. 31, 2008 entitled “Methods and Apparatus for Indexing Set Bit Values in a Long Vector Associated with a Switch Fabric” (35 pgs).Applicant