Embodiments of the present application relate to forwarding data packets in a computer network, and more particularly to techniques for selecting a path such as an Equal Cost MultiPath (ECMP) path and/or a trunk port for forwarding data packets.
Network devices commonly have to select a path from multiple available choices for forwarding a packet. For example, ECMP is a routing strategy where next-hop packet forwarding to a destination can occur over multiple equal cost routing paths. The effect of multipath routing on a network device (e.g., a router) configured to forward packets is that the network device potentially has several next-hops for any given destination and must use some method to choose which path to the next-hop should be used for a given data packet. The use of ECMP helps to reduce delay and congestion in networks by taking advantage of multiple paths through a network by splitting traffic flows across those paths. Accordingly, a network device such as a router has to be able to select a particular ECMP path from multiple available paths to forward a packet.
Trunking is another technique that is commonly used in networks. A trunk represents a logical collection of multiple output ports generally associated with the same route or connected to the same MAC address. In a network environment, when a selected output path for a packet is a trunk, a network device has to be able to select a port from multiple ports associated with the trunk for forwarding the packet. In certain network environments, a selected ECMP path may itself correspond to a trunk. In such an environment, in addition to selecting a particular ECMP path, the network device also has to select a particular output port from the multiple output ports associated with the trunk for forwarding the data packet.
Conventionally, selection of paths (e.g., ECMP paths) and/or trunk ports for data forwarding is done by simply hashing on various fields of a packet header, such as based upon the IP source and destination address fields, and using the hash for selecting the path and/or trunk port. The diversification in the selection offered by such conventional techniques however is quite poor and does not offer proper distribution of traffic to the available paths and/or trunk ports. For example in ECMP forwarding, poor diversification results in the same ECMP path and/or trunk port being selected for forwarding the traffic flow packets at multiple stages of the network. As a result, a router forwards traffic with the same source and destination addresses using the same port of a trunk or the same path, not fully utilizing the bandwidth available for the traffic via other ports or paths available to the router. Accordingly, using conventional techniques in which all routers in the network derive their hashing decision purely based on information extracted from the packet header, correlation occurs among routers that any given packet flow traverses, and such correlation reduces diversification. Further, existing ECMP solutions only work in some network topologies and provide limited diversification.
Embodiments of the present invention provide techniques that offer enhanced diversity in the selection of paths (e.g., ECMP paths) and/or ports from ports associated with trunks for forwarding data traffic. In one embodiment, one or more functions are used to generate a result. A first portion of the generated result may be used as an index (path index) for selecting a path (e.g., an ECMP path) from multiple possible paths for forwarding a packet. A second portion of the generated result, different from the first portion, may be used as an index (trunk index) for selecting an output port from multiple output ports associated with a trunk for forwarding a packet. In this manner, selected portions of the generated result may be used as indices, one for selecting a path and another for selecting a trunk port for forwarding packets such that the portions used for the two indices are not the same. The path index and the trunk index are not dependent upon one another.
According to an embodiment of the present invention, techniques are provided for determining a path for forwarding a packet. A result may be generated using one or more sections of the packet and one or more functions. A first portion of the result may then be used to select a path from a plurality of paths for forwarding the packet from the network device, wherein the first portion of the result is less than the whole result. In one embodiment, a plurality of paths may be equal-cost-multipath (ECMP) paths and the first portion is used to select an ECMP path from the plurality of ECMP paths.
The one or more functions that are used to generate a result may comprise different functions such as a cyclic redundancy check (CRC) function, a rotate function, and others. In one embodiment, a CRC function is applied to the one or more sections of the packet to generate the result. In another embodiment, multiple functions may be used to generate the result. For example, a rotate function may be applied to the one or more sections of the packet to create a rotated result and a CRC function may be applied to the rotated result to generate the result. In another embodiment, another rotate function may be applied to the CRC result to generate the result, a portion of which is then used to select a path for forwarding the packet. The amount of rotation applied by a rotate function may be preconfigured for the network device performing the processing. Different network devices may be configured to apply different amounts of rotation.
In one embodiment, a second portion of the result may be used to select a port from a plurality of ports associated with a trunk for forwarding the packet, wherein the second portion is different from the first portion. The first and second portions though different may still have some overlapping sections. In an alternative embodiment, the first portion and second portion are non-overlapping portions of the result.
According to an embodiment of the present invention, techniques are provided for selecting a port for forwarding a packet. A result may be generated using one or more sections of the packet and one or more functions. A portion of the result may be used to select a port from a plurality of ports associated with a trunk for forwarding the packet from a network device, wherein the portion is less than the whole result.
The one or more functions that are used to generate a result may comprise different functions such as a cyclic redundancy check (CRC) function, a rotate function, and others. In one embodiment, a CRC function is applied to the section of the packet to generate the result. In another embodiment, multiple functions may be used to generate the result. For example, a rotate function may be applied to the section of the packet to create a rotated result and a CRC function may be applied to the rotated result to generate the result. In another embodiment, another rotate function may be applied to the CRC result to generate the result, a portion of which is then used to select a path for forwarding the packet. The amount of rotation applied by a rotate function may be preconfigured for the network device performing the processing. Different network devices may be configured to apply different amounts of rotation.
The foregoing, together with other features and embodiments will become more apparent when referring to the following specification, claims, and accompanying drawings.
In the following description, for the purposes of explanation, specific details are set forth in order to provide a thorough understanding of embodiments of the invention. However, it will be apparent that the invention may be practiced without these specific details.
Embodiments of the present invention provide techniques that enhance diversification in the selection of paths and/or trunk ports for forwarding traffic flows comprising packets.
Network device 100 receives and transmits data flows comprising packets using ports 102. A port within ports 102 may be classified as an input port or an output port depending upon whether a packet is received or transmitted using the port. A port over which a packet is received by network device 100 is referred to as an input port. A port used for communicating or transmitting a packet from network device 100 is referred to as an output port. A particular port may function both as an input port and an output port. Ports 102 may be capable of receiving and/or transmitting different types of data traffic at different speeds including 1 Gigabit/sec, 10 Gigabits/sec, or more. In some embodiments, multiple ports of network device 100 may be logically grouped into one or more trunks. A trunk represents a logical collection of multiple output ports of a network device generally associated with the same route or connected to the same MAC address.
In one embodiment, network device 100 may receive one or more packets via one or more input ports. For a packet received over an input port, network device 100 may be configured to determine an output port for the packet. The packet may then be forwarded to the determined output port and transmitted from network device 100 using the output port. As part of the processing to determine an output port for a packet, network device 100 may be configured to select a particular path (e.g., an ECMP path) from multiple paths (e.g., multiple ECMP paths) that may be available for forwarding the packet and select an output port corresponding to the particular selected path. If the selected path is a trunk, as part of forwarding a packet from an input port to an output port, network device 100 may be configured to select a particular output port from the multiple output ports associated with the selected trunk for forwarding the packet. The packet may then be communicated from network device 100 using the selected trunk output port.
In the embodiment depicted in
Packet processor 106 is configured to process each packet received by network device 100 and determine how the packet is to be forwarded. This processing may involve performing lookups in CAM 110, PRAM 112, and CAM2PRAM 114. In one embodiment, as part of the processing, packet processor 106 is configured to determine an output port to which the packet is to be forwarded. As part of determining an output port to which the packet is to be forwarded, packet processor 106 is configured to select a particular path from multiple paths for forwarding the packet and then select an output port corresponding to a particular selected path. For example, packet processor 106 may be configured to select an ECMP path from multiple ECMP paths for forwarding the packet and forward the packet to a port corresponding to the selected ECMP path. If the selected path is a trunk, as part of determining an output port to which the packet is to be forwarded, packet processor 106 is configured to select a particular output port from the multiple output ports associated with the selected trunk for forwarding the packet. The packet may then be communicated from network device 100 using the selected output port. In some scenarios, the selected path may itself be a trunk. In such a scenario, upon selecting a particular path, packet processor 106 is configured to select a particular output port from the multiple output ports associated with the selected path for forwarding the packet.
According to an embodiment of the present invention, packet processor 106 performs the selection of a path and/or selection of a port from ports grouped as a trunk using techniques that provide enhanced diversification in the selection of the path and/or trunk port. Embodiments of the present invention provide enhanced diversification by more equally distributing traffic flows between available paths (e.g., ECMP paths) and/or trunk ports.
In one embodiment, packet processor 106 is configured to extract one or more sections of the packet to be forwarded. Packet processor 106 is then configured to generate a result using the extracted sections of the packet and one or more functions. A portion of the generated result is used as an index (path index) for selecting a path from multiple possible paths for forwarding the packet. For example, a portion of the generated result may be used as a path index to select an ECMP path from multiple ECMP paths. A path index used for selecting an ECMP path may also be referred to as an ECMP index.
Another portion of the generated result may be used as an index (referred to as a trunk index) for selecting an output port from multiple output ports associated with a trunk for forwarding the packet. The portions of the generated result are selected such that the portion used as the path index is not the same as the portion used as the trunk index. It is possible that the portion selected as the path index and the portion selected as the trunk index have some overlap. In some embodiments, the portions are selected such that there is no overlap. As a result of the manner in which the result is generated and portions of the result used as the path index and the trunk index, the two indices are not dependent upon one another. Further details related to generating the results and using portions of the generated result as indices are described below.
As depicted in
Since processing performed by packet processor 106 needs to be performed at a high packet rate in a deterministic manner, packet processor 106 is generally a dedicated hardware device configured to perform the processing. In one embodiment, packet processor 106 may be a programmable logic device such as a field programmable gate array (FPGA). Packet processor 106 may also be an ASIC.
In one embodiment, network device 100 may comprise multiple linecards, with each linecard comprising the components depicted in
As depicted in
A function is then applied to the sections of the packet extracted in 202 to generate a result (step 204). Various different functions may be used in 204. In one embodiment, the function selected is such that the result generated by the function is sensitive to the inputs to the function such that even a small change in the inputs causes a change in the result that is generated. In one embodiment, a cyclic redundancy check (CRC) function is used. A CRC function takes inputs of different lengths and generates an output result that is generally of a certain fixed size. The extracted portions of the packet are provided as input to a CRC function that generates a CRC result based upon the inputs. Due to the nature of a CRC function, the CRC result is very sensitive to the inputs that are provided to the CRC function—any change in the input to the CRC function, even a one bit change, changes the resultant CRC value. Accordingly, if there is even a slight change in the extracted portions of the packet that are provided as input to the CRC function, then the resultant CRC result will be different.
For example, in one embodiment, 256 bits of the packet header may be selected in 202 and provided as input to a CRC function. In one embodiment, a 32-bit CRC function is used that generates a 32-bit CRC result. Various different techniques may be used for generating the 32-bit CRC result. In one embodiment, the polynomial used is (0 1 2 4 5 7 8 10 11 12 16 22 23 26 32)
X32+X26+X23+X22+X16+X12+X11+X10+X8+X7+X5+X4+X2+X+1
The following pseudo code may be used for generating a 32-bit CRC result according to an embodiment of the present invention (the input data in this example code is assumed to be 256 bits wide):
crc_tmp[31:0]=0 (initial seed can be programmed for multi-level system purpose)
crc_mask=32′h04C1—1DB7 (polynomial)
for (i=0; i<256; i++)/*applying to each bit of the 256 bits selected from packet*/
crc_tmp=data[i] ^((crc_tmp & 0x8000—0000)>>31)?((crc_tmp<<1)^crc_mask):(crc_tmp<<1);
After the running of the algorithm, the crc_tmp stores the generated CRC result.
Besides a CRC function, other functions may also be used in 204. These functions may include a rotate function, a bit swap function, a bit inverting function, a bit XOR function, and the like.
A portion of the result generated in 204 is then used as path index to select a path, from possibly multiple paths, for forwarding the packet to a next-hop device (step 206). As part of 206, an output port corresponding to the selected ECMP path may also be selected. In one embodiment, the portion of the result used in 204 as the path index is less than the full result. For example, if the CRC result generated in 204 is 32-bits wide, then the path index may be less than 32 bits (e.g., bits 0-15 of the generated result may be used as the path index). The portion used in 206 may be a contiguous portion of the result generated in 204 or may be made up of non-contiguous portions of the result. An example of using non-contiguous portions as the path index is using bit 0-4 and 10-15 as the path index.
A portion of the result generated in 204 may also be used as a trunk index to select a particular output port for forwarding the packet from multiple output ports associated with a selected trunk (step 208). The portion of the result used in 208 is generally less than the full result. The portion used in 208 may be a contiguous portion of the result generated in 204 or may be made up of non-contiguous portions of the result.
The portions of the result selected in 206 and 208 and used as a path index and as a trunk index are such that the portion used as the path index is not the same as the portion used as the trunk index. It is possible that the portion selected as the path index and the portion selected as the trunk index may have some overlapping sections. In some embodiments, the two portions are non-overlapping, for example, for a 32-bit CRC result, bits 0-15 may be used as the path index and bits 16-31 may be used as the trunk index.
For example, in embodiments supporting ECMP and trunking, a first portion of the result generated in 204 may be used in 206 as an ECMP index to select a particular ECMP path, and if the selected ECMP path is a trunk, a second portion of the result generated in 204 may be used in 208 as a trunk index to select a particular output port from the multiple ports associated with the selected ECMP path trunk. For example, for a 32-bit CRC result, bits 0-15 may be used as the ECMP index and bits 16-31 may be used as the trunk index.
Although not shown in
Due to the manner in which the result is generated and the manner in which portions of the generated result are used as the path index and the trunk index, the two indices are not dependent upon one another: the path index is not dependent on the trunk index and the trunk index is not dependent upon the path index. The two indices are not related to each other. This provides for enhanced diversification in the selection of paths and/or trunk ports.
The diversification in the selection of paths and/or trunk ports may be further enhanced by using multiple functions to generate the result and then using portions of the result as the path index and the trunk index. For example, instead of applying a single function, three functions may be applied: (1) a pre-function; (2) a function such as the function applied in step 204 in
Processing starts by extracting one or more sections of the packet to be forwarded (step 302). The processing performed in 302 may be similar to the processing performed in step 202 in
A first function is then applied to sections of the packet extracted in 302 to generate a first result (step 304). Various different functions may be used as a first function such as a rotate or shift function (e.g., using a barrel shifter), a bit swap function, an invert function, an XOR function, and the like. In one embodiment, a rotate function is applied to the portion(s) of the packet selected in 302. The input to the rotate function is rotated by a certain amount to generate a rotated output value. The amount of the rotation performed may be user-configurable and may be set for the network device. Different network devices in a network environment may be configured to apply different amounts of rotations. As a result, the amount of rotation applied by one network device may be different from the amount of rotation applied by another network device. Consequently, for the same packet, the rotated result generated by one network device may be different from the rotated results generated by another network device. In one embodiment, a rotation control parameter may be set for the network device that controls that amount of rotation applied by the network device. The parameter may be stored in a memory of the network device.
A second function is then applied to the results of the first function to generate a second result (step 306). For example, if the first function was a rotate function, then the rotated result is provided as input to the second function that generates a second result. Various different functions may be used as the second function. In one embodiment, a CRC function is applied in 306 to generate a CRC result. Other functions may also be applied in alternative embodiments such as a rotate or shift function, a bit swap function, an invert function, an XOR function, and the like.
A third function is then applied to the results of the second function to generate a third result (step 308). For example, if the second function was a CRC function, then the CRC result is provided as input to the third function that generates a third result. Various different functions may be used as the third function such as rotate or shift function, a bit swap function, an invert function, an XOR function, and the like. In one embodiment, a rotate function is applied in 308. The amount of the rotation performed in 308 may be user-configurable and may be set for the network device. Different network devices in a network environment may be configured to apply different amounts of rotations. As a result, the amount of rotation applied by one network device may be different from the amount of rotation applied by another network device. Consequently, for the same packet, the rotated result generated by one network device may be different from the rotated results generated by another network device. For a network device, the amount of rotation applied by the network device in 304 may be different from the amount of rotation applied in 308.
A portion of the third result generated in 308 may then be used as a path index to select a path (e.g., ECMP path), from possibly multiple paths (e.g., multiple ECMP paths), for forwarding the packet to a next-hop device (step 310). As part of 310, an output port corresponding to the selected path may also be selected. The portion of the third result used in 310 is generally less than the full result. The portion used in 310 may be a contiguous portion of the third result generated in 308 or may be made up of non-contiguous portions of the third result.
A portion of the third result generated in 308 may be used as a trunk index to select a particular output port for forwarding the packet from the multiple output ports associated with the trunk (step 312). The portion of the third result used in 312 is generally less than the full result. The portion used in 312 may be a contiguous portion of the third result generated in 308 or may be made up of non-contiguous portions of the third result.
The portions of the result selected in 310 and 312 and used as a path index and as a trunk index are such that the portion used as the path index is not the same as the portion used as the trunk index. The portion selected as the path index and the portion selected as the trunk index may have some overlapping sections. In some embodiments, the two portions are non-overlapping, for example, for a 32-bit CRC result, bits 0-15 may be used as the path index and bits 16-31 may be used as the trunk index.
In embodiments supporting ECMP and trunking, a first portion of the third result generated in 308 may be used as an ECMP index to select a particular ECMP path, and if the selected ECMP path is a trunk, a second portion of the third result generated in 308 may be used as a trunk index to select a particular output port from the multiple ports associated with the selected ECMP path trunk. For example, for a 32-bit third result, bits 0-15 may be used as the ECMP index and bits 16-31 may be used as the trunk index.
Although not shown in
It should be apparent that both the path index and the trunk index do not have to be used each time. A trunk index may need to be used only when the selected path for forwarding a packet is a trunk. Similarly, a path index may need to be used only when there are multiple paths available for forwarding the packet and a single path has to be selected. There may be no need to use a path index in network topologies where there is only one or no path from a network device for forwarding a packet. Embodiments of the present invention thus provide the flexibility of using a path index and/or a trunk index as and when appropriate.
In the embodiment depicted in
There is no limitation on the number of functions that may be used to generate a result, portions of which are then used as the ECMP index and the trunk index. For example, only one function may be used (as depicted in
Once the path index and the trunk index have been identified from the generated result, the indices may then be used to select a path and/or a trunk port for forwarding a packet. Various different techniques may be used to select the path and/or trunk port using a path index and a trunk index.
As depicted in
An ECMP_mask value is then determined from the CAM2PRAM table entry determined from the CAM lookup performed in 502 (step 504). In one embodiment, the ECMP_mask is a 4-bit value from zero to the number of ECMP paths minus one. In order to get the number of ECMP paths and to avoid having to deal with a modulo operation (described below) using a zero base, an ECMP_Base value is then determined from the ECMP_mask determined in 504 by adding one to the ECMP_mask (step 506). In one embodiment, the ECMP_Base value is determined as follows (by adding 1 to the 4-bit number):
ECMP_Base[4:0]=ECMP_mask[3:0]+4′h1//0-15→1-16 ports
The ECMP_Base identifies the total number of ECMP paths that are available for forwarding the packet from the network device.
An ECMP_Adjust value is then determined based upon the ECMP_Base determined in 506 and the ECMP or path index determined as previously described (for example, the path index determined in step 206 in
ECMP_Adjust[4:0]=ECMP Index[15:0]%ECMP_Base[4:0]
The ECMP_Adjust determined in 508 thus represents a number between 1 and the total number of available ECMP paths and used for path selection. The ECMP_Adjust is used an index to an entry in the PRAM (e.g., in PRAM 112 depicted in
The ECMP path to be used is then determined based upon the contents of the PRAM entry (step 512). In one embodiment, a forwarding identifier (FID) is determined from the PRAM entry. The particular ECMP path to be used for forwarding the packet is then determined from the FID. In one embodiment, an output port corresponding to the selected ECMP path is also determined in 512.
As depicted in
A trunk group identifier (TGID) and a PRAM forwarding identifier (PRAM FID) are then determined from the PRAM entry to which an index is obtained in 602 (step 604). In one implementation, the PRAM may be organized as a 32M×4 or 512K×64×4 memory. Each PRAM entry may include, for example, 247 bits of routing and status information, along with a 9-bit TGID (TRUNK_GROUP[8:0]), which indexes into a trunk group table. The TGID references the trunk to be used for forwarding the packet. PRAM entries sharing a trunk are programmed with the trunk's TGID.
In one embodiment, the trunk group table stores information for one or more trunks. A trunk group table may store one or more entries corresponding to trunks and the entries are addressed by TGIDs stored in the PRAM entries. The information stored for each trunk includes information identifying the current number of active ports associated with the trunk. In one implementation, each trunk group table entry stores information for a trunk and comprises a value representing the number of currently active trunk ports for the trunk. In such an implementation, when the number of active member ports in a trunk changes, the information in the corresponding trunk group table entry is updated to reflect the change. In this manner, the information in the PRAM entries for the trunk does not have to be changed. PRAM entries sharing a trunk may be programmed with the trunk's TGID, which provides an index to an entry in the trunk group table storing information for that trunk. Updates to the trunk information are made in the trunk group table, rather than in the PRAM entries.
The TGID obtained in 604 is used to access an entry in the trunk group table (step 606). The number of active ports of the trunk is then determined from the trunk group table entry accessed in 606 (step 608). In one embodiment, a 4-bit number (TRUNK_PORTS[4:0]) represents a number from zero to the number of currently active member ports of the trunk minus one. Accordingly, TRUNK_PORTS[4:0] ranges from 0 to one less than the number of currently active member ports. Thus, an adjustment may be made in 608 by adding one to the TRUNK_PORTS to obtain the number of currently active ports as follows:
TRUNK_PORTS_ADJ[5:0]=TRUNK_PORTS[4:0]+5′h1
TRUNK_PORTS_ADJ represents the number of active trunk ports.
An output port for forwarding the packet is then determined from the multiple ports associated with the trunk based upon the number of ports determined in 608 and the rotated trunk index (step 610). In one embodiment, this is done by first determining a Trunk_Adjust value based upon the number of active trunk ports determined in 608 and the trunk index previously obtained (as determined above in step 208 of
Trunk_Adjust[5:0]=Trunk Index[15:0]%TRUNK_PORTS_ADJ[5:0]
As shown above, a modulo operation is used to select one of the currently active ports of the trunk represented by Trunk_Adjust. A trunk_FID is then obtained using the PRAM FID determined in 604 and the Trunk_Adjust. In one embodiment, a 16-bit trunk_FID is obtained using a bit-wise OR operation (|) as follows:
TRUNK_FID[15:0]=PRAM_FID[15:0]|Trunk_Adjust[4:0]
In one embodiment, the trunk_FID points to information related to the output port from the trunk to be used for forwarding the packet. Various other techniques may also be used in alternative embodiments.
In embodiments wherein a path has to be determined from multiple paths available for forwarding the packet and the selected path is a trunk, then the processing depicted in
As described above, embodiments of the present invention provide techniques for generating an index (path index) for selecting a path from multiple paths available for forwarding a packet and for generating an index (trunk index) for selecting a port from multiple ports associated with a port. A result is generated and portions of the result are used as the path index and a trunk index such that the portion used as the path index is not the same as the portion used for the trunk index, although the two portions may have some overlaps. In this manner, the path index and the trunk index are not dependent on one another. Making the indices independent of each other enhances the selection diversification provided by the indices.
Embodiments of the present invention ensure that packets belonging to the same “flow” are forwarded using the same path and/or same trunk port. A “flow” may be characterized by information selected from a packet to be forwarded. For example, one or more fields selected from the header of a packet may define a flow. The definition of a flow may change from one environment to another. In one embodiment, a flow means a combination of the source and destination fields in the packet. In such an environment, two packets may be considered to belong to the same flow if they both have the same source address and destination address. For a given flow, as long as the region boundary (e.g., the number of ports configured) is fixed, the same next-hop will be chosen for packets belonging to the flow. This is useful for several networking protocol and applications. For example, for a connected TCP flow, diverting packets from the same flow to different paths/ports will introduce additional overhead due to path/port setup requirements which will degrade the performance of the network. As a result, embodiments of the present invention ensure that packets belonging to the same flow are forwarded using the same path and/or same trunk port.
Embodiments of the present invention may be used for various applications. For example, service providers and datacenters looking for ECMP and trunk diversification may use embodiments of the present invention. Embodiments of the present invention may be used in various different network topologies including single and multi-stage networks. Embodiments of the present invention provide improved diversification in the selection of paths and/or trunk ports and as a result provide improved data load balancing across paths and trunk ports in a network.
As depicted in
Network device 702-1 may also provide three different possible ECMP paths for forwarding packets belonging to flow X. Network device 702-1 may use the same technique for generating an ECMP index and a trunk index as used by network device 701. Based upon the ECMP index, network device 702-1 may select ECMP path 2 for forwarding packets belonging to flow X and forward the flow X packets along ECMP path 2 to network device 703-2.
Network device 702-2 may also provide three different possible ECMP paths for forwarding packets belonging to flow Y. Network device 702-2 may use the same technique for generating an ECMP index and a trunk index as used by network device 701. Based upon the ECMP index, network device 702-1 may select ECMP path 3 for forwarding packets belonging to flow Y and forward the flow Y packets along ECMP path 3 to network device 703-6.
Network device 702-3 may also provide three different possible ECMP paths for forwarding packets belonging to flow Z. Network device 702-3 may use the same technique for generating an ECMP index and a trunk index as used by network device 701. Based upon the ECMP index, network device 702-3 may select ECMP path 1 for forwarding packets belonging to flow Z and forward the flow Z packets along ECMP path 1 to network device 703-7.
As can be seen from the above example, the ECMP paths selected for forwarding a particular flow of packets at the different stages are different, even though the method used by each network device for generating the ECMP index and the trunk index is the same. For example, for packets belonging to flow X, at stage one, ECMP path 1 is selected, whereas, at stage two, ECMP path 2 is selected. This is due to the fact that the amount of rotation applied by network device 701 may be different from the amount of rotation applied by network device 702-1. As a result, the generated result after applying the three functions may be different at network device 702 from the result generated at network device 702-1. Due to this, a traffic flow may be diverted to different paths at different stages of the network while ensuring that, at a particular network device, all packets belonging to a particular traffic flow are all forwarded using the same path. This is different from conventional selection techniques, wherein the same path is likely to be selected at each network device for a traffic flow. Likewise, for packets belonging to flow Y, at stage one, ECMP path 2 is selected, whereas, at stage two, ECMP path 3 is selected. Further, for packets belonging to flow Z, at stage one, ECMP path 3 is selected, whereas, at stage two, ECMP path 1 is selected.
Accordingly, different ECMP paths are selected at different stages, thereby enhancing the diversity of the selection, using the same technique for generating path and trunk indices. Embodiments of the present invention may thus be used in a multistage network to enhance diversity in the selection of paths at the different stages. Since the same technique is used for generating the path index and the trunk index at the various network devices at the various network stages, the solution is scalable for a multistage network.
If the selected path is a trunk, then the trunk index may be used to select a particular port from the multiple ports associated with the trunk for forwarding the packet. As with selection of paths, the selected port for a particular flow of traffic may be different at different stages of the network.
Although specific embodiments of the invention have been described, various modifications, alterations, alternative constructions, and equivalents are also encompassed within the scope of the invention. For example, while embodiments have been described for using a path index to select an ECMP path from multiple ECMP paths, the path index may also be used to select other types of paths. Embodiments of the present invention are not restricted to operation within certain specific data processing environments, but are free to operate within a plurality of data processing environments. Additionally, although embodiments of the present invention have been described using a particular series of transactions and steps, it should be apparent to those skilled in the art that the scope of the present invention is not limited to the described series of transactions and steps.
Further, while embodiments of the present invention have been described using a particular combination of hardware and software, it should be recognized that other combinations of hardware and software are also within the scope of the present invention. Embodiments of the present invention may be implemented only in hardware, or only in software, or using combinations thereof.
The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that additions, subtractions, deletions, and other modifications and changes may be made thereunto without departing from the broader spirit and scope as set forth in the claims.
The present application claims the benefit and priority under 35 U.S.C. 119(e) from the following U.S. Provisional Applications, the entire contents of which are herein incorporated by reference for all purposes: (1) U.S. Provisional Application No. 61/015,151 filed Dec. 19, 2007 entitled ADVANCED LOAD BALANCING FOR TRAFFIC OVER TRUNK INTERFACES AND/OR EQUAL COST ROUTED PATHS; (2) U.S. Provisional Application No. 61/015,153 filed Dec. 19, 2007 entitled EQUAL COST MULTIPLE PATH AND TRUNK DIVERSIFICATION FOR SINGLE AND MULTI-STAGE NETWORK; and (3) U.S. Provisional Application No. 60/975,363 filed Sep. 26, 2007 entitled FAST AND EFFICIENT TRUNK MANAGEMENT. The present application also incorporates by reference for all purposes the entire contents of U.S. Non-Provisional application Ser. No. 12/198,697, entitled SELECTION OF TRUNK PORTS AND PATHS USING ROTATION filed Aug. 26, 2008.
Number | Name | Date | Kind |
---|---|---|---|
3866175 | Seifert, Jr. et al. | Feb 1975 | A |
4325119 | Grandmaison et al. | Apr 1982 | A |
4348725 | Farrell et al. | Sep 1982 | A |
4628480 | Floyd | Dec 1986 | A |
4667323 | Engdahl et al. | May 1987 | A |
4679190 | Dias | Jul 1987 | A |
4683564 | Young et al. | Jul 1987 | A |
4698748 | Juzswik et al. | Oct 1987 | A |
4723243 | Joshi et al. | Feb 1988 | A |
4754482 | Weiss | Jun 1988 | A |
4791629 | Burns et al. | Dec 1988 | A |
4794629 | Pastyr et al. | Dec 1988 | A |
4807280 | Posner et al. | Feb 1989 | A |
4876681 | Hagiwara et al. | Oct 1989 | A |
4896277 | Vercellotti et al. | Jan 1990 | A |
4985889 | Frankish et al. | Jan 1991 | A |
5101404 | Kunimoto et al. | Mar 1992 | A |
5136584 | Hedlund | Aug 1992 | A |
5195181 | Bryant et al. | Mar 1993 | A |
5208856 | Leduc et al. | May 1993 | A |
5224108 | McDysan et al. | Jun 1993 | A |
5231633 | Hluchyj et al. | Jul 1993 | A |
5280582 | Yang et al. | Jan 1994 | A |
5282196 | Clebowicz | Jan 1994 | A |
5287477 | Johnson et al. | Feb 1994 | A |
5299190 | LaMaire et al. | Mar 1994 | A |
5299195 | Shah | Mar 1994 | A |
5301192 | Henrion | Apr 1994 | A |
5307345 | Lozowick et al. | Apr 1994 | A |
5323386 | Wiher et al. | Jun 1994 | A |
5365512 | Combs et al. | Nov 1994 | A |
5377189 | Clark | Dec 1994 | A |
5390173 | Spinney et al. | Feb 1995 | A |
5392279 | Taniguchi | Feb 1995 | A |
5406643 | Burke et al. | Apr 1995 | A |
5408469 | Opher et al. | Apr 1995 | A |
5430442 | Kaiser et al. | Jul 1995 | A |
5436893 | Barnett | Jul 1995 | A |
5461615 | Henrion | Oct 1995 | A |
5490258 | Fenner | Feb 1996 | A |
5506840 | Pauwels et al. | Apr 1996 | A |
5506841 | Sandquist | Apr 1996 | A |
5521923 | Willmann et al. | May 1996 | A |
5546385 | Caspi et al. | Aug 1996 | A |
5550816 | Hardwick et al. | Aug 1996 | A |
5563948 | Diehl et al. | Oct 1996 | A |
5566170 | Bakke et al. | Oct 1996 | A |
5598410 | Stone | Jan 1997 | A |
5600795 | Du | Feb 1997 | A |
5619497 | Gallagher et al. | Apr 1997 | A |
5640504 | Johnson, Jr. | Jun 1997 | A |
5646878 | Samra | Jul 1997 | A |
5663952 | Gentry, Jr. | Sep 1997 | A |
5663959 | Nakagawa | Sep 1997 | A |
5666353 | Klausmeier et al. | Sep 1997 | A |
5721819 | Galles et al. | Feb 1998 | A |
5732080 | Ferguson et al. | Mar 1998 | A |
5734826 | Olnowich et al. | Mar 1998 | A |
5740176 | Gupta et al. | Apr 1998 | A |
5745708 | Weppler et al. | Apr 1998 | A |
5751710 | Crowther et al. | May 1998 | A |
5802287 | Rostoker et al. | Sep 1998 | A |
5815146 | Youden et al. | Sep 1998 | A |
5818816 | Chikazawa et al. | Oct 1998 | A |
5835496 | Yeung et al. | Nov 1998 | A |
5838684 | Wicki et al. | Nov 1998 | A |
5862350 | Coulson | Jan 1999 | A |
5864555 | Mathur et al. | Jan 1999 | A |
5867675 | Lomelino et al. | Feb 1999 | A |
5870538 | Manning et al. | Feb 1999 | A |
5872769 | Caldara et al. | Feb 1999 | A |
5872783 | Chin | Feb 1999 | A |
5875200 | Glover et al. | Feb 1999 | A |
5896380 | Brown et al. | Apr 1999 | A |
5907566 | Benson et al. | May 1999 | A |
5907660 | Inoue et al. | May 1999 | A |
5909686 | Muller et al. | Jun 1999 | A |
5915094 | Kouloheris et al. | Jun 1999 | A |
5920566 | Hendel et al. | Jul 1999 | A |
5920886 | Feldmeier | Jul 1999 | A |
5936939 | Des Jardins et al. | Aug 1999 | A |
5936966 | Ogawa et al. | Aug 1999 | A |
5956347 | Slater | Sep 1999 | A |
5999528 | Chow et al. | Dec 1999 | A |
6000016 | Curtis et al. | Dec 1999 | A |
6011910 | Chau et al. | Jan 2000 | A |
6016310 | Muller et al. | Jan 2000 | A |
6023471 | Haddock et al. | Feb 2000 | A |
6031843 | Swanbery et al. | Feb 2000 | A |
6035414 | Okazawa et al. | Mar 2000 | A |
6038288 | Thomas et al. | Mar 2000 | A |
6067298 | Shinohara | May 2000 | A |
6067606 | Holscher et al. | May 2000 | A |
6076115 | Sambamurthy et al. | Jun 2000 | A |
6081522 | Hendel et al. | Jun 2000 | A |
6088356 | Hendel et al. | Jul 2000 | A |
6094434 | Kotzur et al. | Jul 2000 | A |
6104696 | Kadambi et al. | Aug 2000 | A |
6104700 | Haddock et al. | Aug 2000 | A |
6104969 | Kadambi et al. | Aug 2000 | A |
6108306 | Kalkunte et al. | Aug 2000 | A |
6118787 | Kalkunte et al. | Sep 2000 | A |
6125417 | Bailis et al. | Sep 2000 | A |
6128666 | Muller et al. | Oct 2000 | A |
6144668 | Bass et al. | Nov 2000 | A |
6147996 | Laor et al. | Nov 2000 | A |
6151301 | Holden | Nov 2000 | A |
6151497 | Yee et al. | Nov 2000 | A |
6154446 | Kadambi et al. | Nov 2000 | A |
6157643 | Ma | Dec 2000 | A |
6160809 | Adiletta et al. | Dec 2000 | A |
6160812 | Bauman et al. | Dec 2000 | A |
6172990 | Deb et al. | Jan 2001 | B1 |
6178520 | DeKoning et al. | Jan 2001 | B1 |
6181699 | Crinion et al. | Jan 2001 | B1 |
6185222 | Hughes | Feb 2001 | B1 |
6195335 | Calvignac et al. | Feb 2001 | B1 |
6201492 | Amar et al. | Mar 2001 | B1 |
6222845 | Shue et al. | Apr 2001 | B1 |
6243667 | Kerr et al. | Jun 2001 | B1 |
6249528 | Kothary | Jun 2001 | B1 |
6263374 | Olnowich et al. | Jul 2001 | B1 |
6272144 | Berenbaum et al. | Aug 2001 | B1 |
6304903 | Ward | Oct 2001 | B1 |
6320859 | Momirov | Nov 2001 | B1 |
6333929 | Drottar et al. | Dec 2001 | B1 |
6335932 | Kadambi et al. | Jan 2002 | B2 |
6335935 | Kadambi et al. | Jan 2002 | B2 |
6343072 | Bechtolsheim et al. | Jan 2002 | B1 |
6351143 | Guccione et al. | Feb 2002 | B1 |
6356550 | Williams | Mar 2002 | B1 |
6356942 | Bengtsson et al. | Mar 2002 | B1 |
6359879 | Carvey et al. | Mar 2002 | B1 |
6363077 | Wong et al. | Mar 2002 | B1 |
6366557 | Hunter | Apr 2002 | B1 |
6369855 | Chauvel et al. | Apr 2002 | B1 |
6421352 | Manaka et al. | Jul 2002 | B1 |
6424658 | Mathur | Jul 2002 | B1 |
6424659 | Viswanadham et al. | Jul 2002 | B2 |
6427185 | Ryals et al. | Jul 2002 | B1 |
6430190 | Essbaum et al. | Aug 2002 | B1 |
6457175 | Lerche | Sep 2002 | B1 |
6459705 | Cheng | Oct 2002 | B1 |
6460088 | Merchant | Oct 2002 | B1 |
6463063 | Bianchini, Jr. et al. | Oct 2002 | B1 |
6466608 | Hong et al. | Oct 2002 | B1 |
6470436 | Croft et al. | Oct 2002 | B1 |
6473428 | Nichols et al. | Oct 2002 | B1 |
6473433 | Bianchini, Jr. et al. | Oct 2002 | B1 |
6477174 | Dooley et al. | Nov 2002 | B1 |
6480477 | Treadaway et al. | Nov 2002 | B1 |
6490280 | Leung | Dec 2002 | B1 |
6493347 | Sindhu et al. | Dec 2002 | B2 |
6496502 | Fite et al. | Dec 2002 | B1 |
6505281 | Sherry | Jan 2003 | B1 |
6510138 | Pannell | Jan 2003 | B1 |
6522656 | Gridley | Feb 2003 | B1 |
6532229 | Johnson et al. | Mar 2003 | B1 |
6532234 | Yoshikawa et al. | Mar 2003 | B1 |
6535504 | Johnson et al. | Mar 2003 | B1 |
6549519 | Michels et al. | Apr 2003 | B1 |
6553370 | Andreev et al. | Apr 2003 | B1 |
6556208 | Congdon et al. | Apr 2003 | B1 |
6567404 | Wilford | May 2003 | B1 |
6570884 | Connery et al. | May 2003 | B1 |
6577631 | Keenan et al. | Jun 2003 | B1 |
6587432 | Putzolu et al. | Jul 2003 | B1 |
6591302 | Boucher et al. | Jul 2003 | B2 |
6601186 | Fox et al. | Jul 2003 | B1 |
6606300 | Blanc et al. | Aug 2003 | B1 |
6628650 | Saito et al. | Sep 2003 | B1 |
6633580 | Torudbakken et al. | Oct 2003 | B1 |
6636483 | Pannell | Oct 2003 | B1 |
6643269 | Fan et al. | Nov 2003 | B1 |
6654342 | Dittia et al. | Nov 2003 | B1 |
6654346 | Mahalingaiah et al. | Nov 2003 | B1 |
6654370 | Quirke et al. | Nov 2003 | B1 |
6654373 | Maher, III et al. | Nov 2003 | B1 |
6658002 | Ross et al. | Dec 2003 | B1 |
6661791 | Brown | Dec 2003 | B1 |
6671275 | Wong et al. | Dec 2003 | B1 |
6678248 | Haddock et al. | Jan 2004 | B1 |
6681332 | Byrne et al. | Jan 2004 | B1 |
6683872 | Saito | Jan 2004 | B1 |
6687217 | Chow et al. | Feb 2004 | B1 |
6687247 | Wilford et al. | Feb 2004 | B1 |
6691202 | Vasquez et al. | Feb 2004 | B2 |
6696917 | Heitner et al. | Feb 2004 | B1 |
6697359 | George | Feb 2004 | B1 |
6697368 | Chang et al. | Feb 2004 | B2 |
6700894 | Shung | Mar 2004 | B1 |
6708000 | Nishi et al. | Mar 2004 | B1 |
6721229 | Cole | Apr 2004 | B1 |
6721268 | Ohira et al. | Apr 2004 | B1 |
6721313 | Van Duyne | Apr 2004 | B1 |
6721338 | Sato | Apr 2004 | B1 |
6731875 | Kartalopoulos | May 2004 | B1 |
6735218 | Chang et al. | May 2004 | B2 |
6745277 | Lee et al. | Jun 2004 | B1 |
6747971 | Hughes et al. | Jun 2004 | B1 |
6751224 | Parruck et al. | Jun 2004 | B1 |
6754881 | Kuhlmann et al. | Jun 2004 | B2 |
6765866 | Wyatt | Jul 2004 | B1 |
6775706 | Fukumoto et al. | Aug 2004 | B1 |
6778546 | Epps et al. | Aug 2004 | B1 |
6781990 | Puri et al. | Aug 2004 | B1 |
6785290 | Fujisawa et al. | Aug 2004 | B1 |
6788697 | Aweya et al. | Sep 2004 | B1 |
6792484 | Hook | Sep 2004 | B1 |
6792502 | Pandya et al. | Sep 2004 | B1 |
6798740 | Senevirathne et al. | Sep 2004 | B1 |
6804220 | Odenwalder et al. | Oct 2004 | B2 |
6804731 | Chang et al. | Oct 2004 | B1 |
6807179 | Kanuri et al. | Oct 2004 | B1 |
6807363 | Abiko et al. | Oct 2004 | B1 |
6810038 | Isoyama et al. | Oct 2004 | B1 |
6810046 | Abbas et al. | Oct 2004 | B2 |
6813243 | Epps et al. | Nov 2004 | B1 |
6813266 | Chiang et al. | Nov 2004 | B1 |
6816467 | Muller et al. | Nov 2004 | B1 |
6831923 | Laor et al. | Dec 2004 | B1 |
6831932 | Boyle et al. | Dec 2004 | B1 |
6836808 | Bunce et al. | Dec 2004 | B2 |
6839346 | Kametani | Jan 2005 | B1 |
6842422 | Bianchini, Jr. | Jan 2005 | B1 |
6854117 | Roberts | Feb 2005 | B1 |
6856600 | Russell et al. | Feb 2005 | B1 |
6859438 | Haddock et al. | Feb 2005 | B2 |
6865153 | Hill et al. | Mar 2005 | B1 |
6901072 | Wong | May 2005 | B1 |
6906936 | James et al. | Jun 2005 | B1 |
6912637 | Herbst | Jun 2005 | B1 |
6920154 | Achler | Jul 2005 | B1 |
6925516 | Struhsaker et al. | Aug 2005 | B2 |
6934305 | Duschatko et al. | Aug 2005 | B1 |
6937606 | Basso et al. | Aug 2005 | B2 |
6946948 | McCormack et al. | Sep 2005 | B2 |
6957258 | Maher, III et al. | Oct 2005 | B2 |
6959007 | Vogel et al. | Oct 2005 | B1 |
6973092 | Zhou et al. | Dec 2005 | B1 |
6975599 | Johnson et al. | Dec 2005 | B1 |
6978309 | Dorbolo | Dec 2005 | B1 |
6980552 | Belz et al. | Dec 2005 | B1 |
6982974 | Saleh et al. | Jan 2006 | B1 |
6990102 | Kaniz et al. | Jan 2006 | B1 |
6993032 | Dammann et al. | Jan 2006 | B1 |
6996663 | Marsteiner | Feb 2006 | B1 |
7005812 | Mitchell | Feb 2006 | B2 |
7009968 | Ambe et al. | Mar 2006 | B2 |
7012919 | So et al. | Mar 2006 | B1 |
7050430 | Kalkunte et al. | May 2006 | B2 |
7082133 | Lor et al. | Jul 2006 | B1 |
7103041 | Speiser et al. | Sep 2006 | B1 |
7120744 | Klein | Oct 2006 | B2 |
7126948 | Gooch et al. | Oct 2006 | B2 |
7126956 | Scholten | Oct 2006 | B2 |
7151797 | Limberg | Dec 2006 | B2 |
7161948 | Sampath et al. | Jan 2007 | B2 |
7167471 | Calvignac et al. | Jan 2007 | B2 |
7176911 | Kidono et al. | Feb 2007 | B1 |
7185141 | James et al. | Feb 2007 | B1 |
7185266 | Blightman et al. | Feb 2007 | B2 |
7187687 | Davis et al. | Mar 2007 | B1 |
7190696 | Manur et al. | Mar 2007 | B1 |
7191277 | Broyles | Mar 2007 | B2 |
7191468 | Hanner | Mar 2007 | B2 |
7203194 | Chang et al. | Apr 2007 | B2 |
7206283 | Chang et al. | Apr 2007 | B2 |
7212536 | Mackiewich et al. | May 2007 | B2 |
7218637 | Best et al. | May 2007 | B1 |
7219293 | Tsai et al. | May 2007 | B2 |
7228509 | Dada et al. | Jun 2007 | B1 |
7236490 | Chang et al. | Jun 2007 | B2 |
7237058 | Srinivasan | Jun 2007 | B2 |
7266117 | Davis | Sep 2007 | B1 |
7272611 | Cuppett et al. | Sep 2007 | B1 |
7272613 | Sim et al. | Sep 2007 | B2 |
7277425 | Sikdar | Oct 2007 | B1 |
7283547 | Hook et al. | Oct 2007 | B1 |
7284236 | Zhou et al. | Oct 2007 | B2 |
7286534 | Kloth | Oct 2007 | B2 |
7298752 | Moriwaki et al. | Nov 2007 | B2 |
7324509 | Ni | Jan 2008 | B2 |
7355970 | Lor | Apr 2008 | B2 |
7356030 | Chang et al. | Apr 2008 | B2 |
7366100 | Anderson et al. | Apr 2008 | B2 |
7373514 | Krueger et al. | May 2008 | B2 |
7391769 | Rajkumar et al. | Jun 2008 | B2 |
7414979 | Jarvis | Aug 2008 | B1 |
7468975 | Davis | Dec 2008 | B1 |
7512127 | Chang et al. | Mar 2009 | B2 |
7558193 | Bradbury et al. | Jul 2009 | B2 |
7561590 | Walsh | Jul 2009 | B1 |
7596139 | Patel et al. | Sep 2009 | B2 |
7609617 | Appanna et al. | Oct 2009 | B2 |
7613991 | Bain | Nov 2009 | B1 |
7624283 | Bade et al. | Nov 2009 | B2 |
7636369 | Wong | Dec 2009 | B2 |
7649885 | Davis | Jan 2010 | B1 |
7657703 | Singh | Feb 2010 | B1 |
7721297 | Ward | May 2010 | B2 |
7738450 | Davis | Jun 2010 | B1 |
7813367 | Wong et al. | Oct 2010 | B2 |
7817659 | Wong | Oct 2010 | B2 |
7821972 | Finn et al. | Oct 2010 | B1 |
7830884 | Davis | Nov 2010 | B2 |
7903654 | Bansal | Mar 2011 | B2 |
7933947 | Fleischer et al. | Apr 2011 | B2 |
7948872 | Patel et al. | May 2011 | B2 |
7953922 | Singh | May 2011 | B2 |
7953923 | Singh | May 2011 | B2 |
7978614 | Wong et al. | Jul 2011 | B2 |
7978702 | Chang et al. | Jul 2011 | B2 |
7995580 | Patel et al. | Aug 2011 | B2 |
8014278 | Subramanian et al. | Sep 2011 | B1 |
8090901 | Lin et al. | Jan 2012 | B2 |
8140044 | Villain et al. | Mar 2012 | B2 |
8149839 | Hsu et al. | Apr 2012 | B1 |
8155011 | Wong et al. | Apr 2012 | B2 |
8194666 | Davis | Jun 2012 | B2 |
8194686 | Davis et al. | Jun 2012 | B2 |
8201180 | Briscoe et al. | Jun 2012 | B2 |
8238255 | Suresh et al. | Aug 2012 | B2 |
8271859 | Wong et al. | Sep 2012 | B2 |
8448162 | Ramanathan et al. | May 2013 | B2 |
20010001879 | Kubik et al. | May 2001 | A1 |
20010007560 | Masuda et al. | Jul 2001 | A1 |
20010026551 | Horlin | Oct 2001 | A1 |
20010048785 | Steinberg | Dec 2001 | A1 |
20010053150 | Clear et al. | Dec 2001 | A1 |
20020001307 | Nguyen et al. | Jan 2002 | A1 |
20020040417 | Winograd et al. | Apr 2002 | A1 |
20020054594 | Hoof et al. | May 2002 | A1 |
20020054595 | Ambe et al. | May 2002 | A1 |
20020069294 | Herkersdorf et al. | Jun 2002 | A1 |
20020073073 | Cheng | Jun 2002 | A1 |
20020085499 | Toyoyama et al. | Jul 2002 | A1 |
20020087788 | Morris | Jul 2002 | A1 |
20020089937 | Venkatachary et al. | Jul 2002 | A1 |
20020091844 | Craft et al. | Jul 2002 | A1 |
20020091884 | Chang et al. | Jul 2002 | A1 |
20020126672 | Chow et al. | Sep 2002 | A1 |
20020131437 | Tagore-Brage | Sep 2002 | A1 |
20020141403 | Akahane et al. | Oct 2002 | A1 |
20020146013 | Karlsson et al. | Oct 2002 | A1 |
20020161967 | Kirihata et al. | Oct 2002 | A1 |
20020169786 | Richek | Nov 2002 | A1 |
20020181476 | Badamo et al. | Dec 2002 | A1 |
20020191605 | Van Lunteren et al. | Dec 2002 | A1 |
20030009466 | Ta et al. | Jan 2003 | A1 |
20030012198 | Kaganoi | Jan 2003 | A1 |
20030043800 | Sonksen et al. | Mar 2003 | A1 |
20030043848 | Sonksen | Mar 2003 | A1 |
20030061459 | Aboulenein et al. | Mar 2003 | A1 |
20030074657 | Bramley, Jr. | Apr 2003 | A1 |
20030081608 | Barri et al. | May 2003 | A1 |
20030095548 | Yamano | May 2003 | A1 |
20030103499 | Davis et al. | Jun 2003 | A1 |
20030103500 | Menon et al. | Jun 2003 | A1 |
20030108052 | Inoue et al. | Jun 2003 | A1 |
20030110180 | Calvignac et al. | Jun 2003 | A1 |
20030115403 | Bouchard et al. | Jun 2003 | A1 |
20030120861 | Calle et al. | Jun 2003 | A1 |
20030128668 | Yavatkar et al. | Jul 2003 | A1 |
20030137978 | Kanetake | Jul 2003 | A1 |
20030152084 | Lee et al. | Aug 2003 | A1 |
20030152096 | Chapman | Aug 2003 | A1 |
20030156586 | Lee et al. | Aug 2003 | A1 |
20030159086 | Arndt | Aug 2003 | A1 |
20030165160 | Minami et al. | Sep 2003 | A1 |
20030169470 | Alagar et al. | Sep 2003 | A1 |
20030177221 | Ould-Brahim et al. | Sep 2003 | A1 |
20030198182 | Pegrum et al. | Oct 2003 | A1 |
20030200343 | Greenblat et al. | Oct 2003 | A1 |
20030214956 | Navada et al. | Nov 2003 | A1 |
20030223424 | Anderson et al. | Dec 2003 | A1 |
20030223466 | Noronha, Jr. et al. | Dec 2003 | A1 |
20030227943 | Hallman et al. | Dec 2003 | A1 |
20040022263 | Zhao et al. | Feb 2004 | A1 |
20040028060 | Kang | Feb 2004 | A1 |
20040054867 | Stravers et al. | Mar 2004 | A1 |
20040062130 | Chiang | Apr 2004 | A1 |
20040062245 | Sharp et al. | Apr 2004 | A1 |
20040062246 | Boucher et al. | Apr 2004 | A1 |
20040088469 | Levy | May 2004 | A1 |
20040128434 | Khanna et al. | Jul 2004 | A1 |
20040141504 | Blanc | Jul 2004 | A1 |
20040190547 | Gordy et al. | Sep 2004 | A1 |
20040205393 | Kitamom et al. | Oct 2004 | A1 |
20040208177 | Ogawa | Oct 2004 | A1 |
20040208181 | Clayton et al. | Oct 2004 | A1 |
20040223502 | Wybenga et al. | Nov 2004 | A1 |
20040235480 | Rezaaifar et al. | Nov 2004 | A1 |
20040264380 | Kalkunte et al. | Dec 2004 | A1 |
20050010630 | Doering et al. | Jan 2005 | A1 |
20050010849 | Ryle et al. | Jan 2005 | A1 |
20050041684 | Reynolds et al. | Feb 2005 | A1 |
20050097432 | Obuchi et al. | May 2005 | A1 |
20050120122 | Farnham | Jun 2005 | A1 |
20050132132 | Rosenbluth et al. | Jun 2005 | A1 |
20050132179 | Glaum et al. | Jun 2005 | A1 |
20050138276 | Navada et al. | Jun 2005 | A1 |
20050152324 | Benveniste | Jul 2005 | A1 |
20050152335 | Lodha et al. | Jul 2005 | A1 |
20050169317 | Pruecklmayer | Aug 2005 | A1 |
20050185577 | Sakamoto et al. | Aug 2005 | A1 |
20050185652 | Iwamoto | Aug 2005 | A1 |
20050193316 | Chen | Sep 2005 | A1 |
20050201387 | Willis | Sep 2005 | A1 |
20050226236 | Klink | Oct 2005 | A1 |
20050246508 | Shaw | Nov 2005 | A1 |
20050249124 | Elie-Dit-Cosaque et al. | Nov 2005 | A1 |
20060031610 | Liav et al. | Feb 2006 | A1 |
20060034452 | Tonomura | Feb 2006 | A1 |
20060050690 | Epps et al. | Mar 2006 | A1 |
20060077891 | Smith et al. | Apr 2006 | A1 |
20060092829 | Brolin et al. | May 2006 | A1 |
20060092929 | Chun | May 2006 | A1 |
20060114876 | Kalkunte | Jun 2006 | A1 |
20060146374 | Ng et al. | Jul 2006 | A1 |
20060165089 | Klink | Jul 2006 | A1 |
20060209685 | Rahman et al. | Sep 2006 | A1 |
20060221841 | Lee et al. | Oct 2006 | A1 |
20060268680 | Roberts et al. | Nov 2006 | A1 |
20070038798 | Bouchard et al. | Feb 2007 | A1 |
20070088974 | Chandwani et al. | Apr 2007 | A1 |
20070127464 | Jain et al. | Jun 2007 | A1 |
20070179909 | Channasagara | Aug 2007 | A1 |
20070208876 | Davis | Sep 2007 | A1 |
20070258475 | Chinn et al. | Nov 2007 | A1 |
20070280258 | Rajagopalan et al. | Dec 2007 | A1 |
20070288690 | Wang et al. | Dec 2007 | A1 |
20080025309 | Swallow | Jan 2008 | A1 |
20080031263 | Ervin et al. | Feb 2008 | A1 |
20080037544 | Yano et al. | Feb 2008 | A1 |
20080069125 | Reed et al. | Mar 2008 | A1 |
20080092020 | Hasenplaugh et al. | Apr 2008 | A1 |
20080095169 | Chandra et al. | Apr 2008 | A1 |
20080117075 | Seddigh et al. | May 2008 | A1 |
20080126652 | Vembu et al. | May 2008 | A1 |
20080159309 | Sultan et al. | Jul 2008 | A1 |
20080181103 | Davies | Jul 2008 | A1 |
20080205407 | Chang et al. | Aug 2008 | A1 |
20080307288 | Ziesler et al. | Dec 2008 | A1 |
20090175178 | Yoon et al. | Jul 2009 | A1 |
20090279423 | Suresh et al. | Nov 2009 | A1 |
20090279440 | Wong et al. | Nov 2009 | A1 |
20090279441 | Wong et al. | Nov 2009 | A1 |
20090279541 | Wong et al. | Nov 2009 | A1 |
20090279542 | Wong et al. | Nov 2009 | A1 |
20090279546 | Davis | Nov 2009 | A1 |
20090279549 | Ramanathan et al. | Nov 2009 | A1 |
20090279558 | Davis et al. | Nov 2009 | A1 |
20090279561 | Chang et al. | Nov 2009 | A1 |
20090282148 | Wong et al. | Nov 2009 | A1 |
20090282322 | Wong et al. | Nov 2009 | A1 |
20090287952 | Patel et al. | Nov 2009 | A1 |
20090290499 | Patel et al. | Nov 2009 | A1 |
20100034215 | Patel et al. | Feb 2010 | A1 |
20100046521 | Wong | Feb 2010 | A1 |
20100061393 | Wong | Mar 2010 | A1 |
20100100671 | Singh | Apr 2010 | A1 |
20100135313 | Davis | Jun 2010 | A1 |
20100161894 | Singh | Jun 2010 | A1 |
20100246588 | Davis | Sep 2010 | A1 |
20100293327 | Lin et al. | Nov 2010 | A1 |
20110002340 | Davis | Jan 2011 | A1 |
20110044340 | Bansal et al. | Feb 2011 | A1 |
20110069711 | Jha et al. | Mar 2011 | A1 |
20120163389 | Zhang et al. | Jun 2012 | A1 |
20120236722 | Patel et al. | Sep 2012 | A1 |
Number | Date | Country |
---|---|---|
1380127 | Jan 2004 | EP |
2003289359 | Oct 2003 | JP |
2004-537871 | Dec 2004 | JP |
WO 0184728 | Nov 2001 | WO |
WO 0241544 | May 2002 | WO |
Entry |
---|
Notice of Allowance for U.S. Appl. No. 11/779,778, mailed on Jul. 28, 2011, 9 pages. |
Final Office Action for U.S. Appl. No. 12/795,492, mailed on Jul. 20, 2011, 11 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 12/466,277, mailed on Aug. 9, 2011, 6 pages. |
Final Office Action for U.S. Appl. No. 11/646,845, mailed on Jun. 9, 2011, 22 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,742, mailed on Mar. 30, 2011, 23 pages. |
Notice of Allowance for U.S. Appl. No. 11/953,743, mailed on Apr. 28, 2011, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,751, mailed on Mar. 29, 2011, 29 pages. |
Final Office Action for U.S. Appl. No. 10/140,751, mailed on Jun. 28, 2011, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 12/702,031, mailed on Apr. 29, 2011, 5 pages. |
Non-Final Office Action for U.S. Appl. No. 12/198,697, mailed on May 20, 2011, 43 pages. |
Notice of Allowance for U.S. Appl. No. 12/400,594, mailed on Mar. 23, 2011, 11 pages. |
10 Gigabit Ethernet—Technology Overview White Paper, Sep. 2001, 16 pages. |
10 Gigabit Ethernet, Interconnection with Wide Area Networks, Version 1.0, Mar. 2002, 5 pages. |
ANSI/IEEE Standard 802.1D, 1998, 373 pages. |
Belhadj et al., “Feasibility of a 100GE MAC,” PowerPoint Presentation, IEEE Meeting, Nov. 13-15, 2006, 18 pages. |
Braun et al., “Fast incremental CRC updates for IP over ATM networks,” IEEE Workshop on High Performance Switching and Routing, 2001, 6 pages. |
Degermark, et al., “Small Forwarding Tables for Fast Routing Lookups,” ACM Computer Communications Review, Oct. 1997, pp. 3-14, vol. 27, No. 4. |
Foundry Networks, “BigIron Architecture Technical Brief,” Oct. 1998, 15 pages, version 1.0. |
Foundry Networks, “BigIron Architecture Technical Brief,” Oct. 1998, 15 pages, version 1.02. |
Foundry Networks, “BigIron Architecture Technical Brief,” Dec. 1998, 14 pages, version 1.03. |
Foundry Networks, “BigIron Architecture Technical Brief,” May 1999, 15 pages, version 2.0. |
Foundry Networks, “BigIron Architecture Technical Brief,” May 1999, 15 pages, Version 2.01. |
Foundry Networks, “BigIron Architecture Technical Brief,” Jul. 2001, 16 pages, Version 2.02. |
Foundry Networks, “Next Generation Terabit System Architecture—The High Performance Revolution for 10 Gigabit Networks,” Nov. 17, 2003, 27 pages. |
Gigabit Ethernet Alliance—“Accelerating the Standard for Speed,” Copyright 1999, 19 pages. |
Kichorowsky, et al., “Mindspeed.TM. Switch Fabric Offers the Most Comprehensive Solution for Multi-Protocol Networking Equipment,” Apr. 30, 2001, 3 pages. |
Matsumoto, et al., “Switch Fabrics Touted At Interconnects Conference,” Aug. 21, 2000, printed on Aug. 12, 2002, at URL: http://www.eetimes.com/story/OEG2000821S0011, 2 pages. |
McAuley, et al., “Fast Routing Table Lookup Using CAMs,” Proceedings of INFOCOM, Mar.-Apr. 1993, pp. 1382-1391. |
Foundry Networks, “JetCore™ Based Chassis Systems—An Architecture Brief on NetIron, BigIron, and FastIron Systems,” Jan. 17, 2003, 27 pages. |
Mier Communications, Inc., “Lab Testing Summary Report—Product Category: Layer-3 Switches, Vendor Tested:, Product Tested: Foundry Networks, BigIron 4000,” Report No. 231198, Oct. 1998, 6 pages. |
Mier Communications, Inc.,“Lab Testing Summary Report—Product Category: Gigabit Backbone Switches, Vendor Tested: Foundry Networks, Product Tested: BigIron 4000,” Report No. 210998, Sep. 1998, 6 pages. |
Mindspeed—A Conexant Business, “Switch Fabric Chipset—CX27300 iScale.TM.,” Apr. 30, 2001, 2 pages. |
Mindspeed—A Conexant Business, “17×17 3.2 Gbps Crosspoint Switch with Input Equalization—M21110,” Feb. 1, 2001, 2 pages. |
Newton, Newton's Telecom Dictionary, CMP Books, Mar. 2004, 20th Ed., p. 617. |
Satran, et al., “Out of Order Incremental CRC Computation,” IEEE Transactions on Computers, Sep. 2005, vol. 54, Issue 9, 11 pages. |
Spurgeon, “Ethernet, The Definitive Guide,” O'Reilly & Associates, Inc., Sebastapol, CA, Feb. 2000. |
The Tolly Group, “Foundry Networks, Inc.—BigIron 4000, Layer 2 & Layer 3 Interoperability Evaluation,” No. 199133, Oct. 1999, 4 pages. |
The Tolly Group, “Foundry Networks, Inc.—BigIron 8000 Gigabit Ethernet Switching Router, Layer 2 & Layer 3 Performance Evaluation,” No. 199111, May 1999, 4 pages. |
International Search Report for Application No. PCT/US2001/043113, mailed Dec. 13, 2002, 2 pages. |
Written Opinion of the International Searching Authority for Application No. PCT/US2001/043113, mailed May 1, 2003, 6 pages. |
International Preliminary Examination Report for Application No. PCT/US2001/043113, mailed Nov. 6, 2003, 6 pages. |
International Search Report for Application No. PCT/US03/08719, mailed Jun. 17, 2003. 1 page. |
U.S. Appl. No. 12/883,073, Flexible Method for Processing Data Packets in a Network Routing System for Enhanced Efficiency and Monitoring Capability, filed Sep. 15, 2010, Davis. |
U.S. Appl. No. 12/880,518, Method and Apparatus for Aggregating Input Data Streams, filed Sep. 13, 2010, Wong. |
U.S. Appl. No. 12/684,022, Provisioning Single or Multistage Networks Using Ethernet Service Instances (ESIs), filed Jan. 7, 2010, Jha et al. |
U.S. Appl. No. 12/417,913, Backplane Interface Adapter With Error Control and Redundant Fabric, filed Apr. 3, 2009, Patel et al. |
U.S. Appl. No. 12/198,697, Selection of Trunk Ports and Paths Using Rotation, filed Aug. 26, 2008, Hsu et al. |
U.S. Appl. No. 11/724,965, filed Mar. 15, 2007, Chang et al. |
U.S. Appl. No. 11/586,991, Hitless Management Failover, filed Oct. 25, 2006, Ramanathan et al. |
U.S. Appl. No. 10/832,086, System and Method for Optimizing Router Lookup, filed Apr. 26, 2004, Wong. |
U.S. Appl. No. 10/141,223, Apparatus & Method of Processing Packets Under the Gigabit Ethernet Protocol in a Communications Network, filed May 7, 2002, Veerabadran et al. |
U.S. Appl. No. 10/140,753, Integrated Adapter for a Network Routing System With Enhanced Efficiency and Monitoring Capability, filed May 6, 2002, Davis et al. |
U.S. Appl. No. 10/140,751, Method and Apparatus for Efficiently Processing Data Packets in a Computer Network, filed May 6, 2002, Davis. |
Non-Final Office Action for U.S. Appl. No. 09/855,024. mailed Jun. 4, 2002, 10 pages. |
Final Office Action for U.S. Appl. No. 09/855,024, mailed Jan. 15, 2003, 20 pages. |
Advisory Action for U.S. Appl. No. 09/855,024, mailed May 2, 2003. |
Notice of Allowance for U.S. Appl. No. 09/855,024, mailed Nov. 3, 2003. |
Notice of Allowance for U.S. Appl. No. 09/855,024, mailed Dec. 15, 2003. 6 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,301, mailed Mar. 17, 2005,11 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,301, mailed Feb. 16, 2006, 12 pages. |
Notice of Allowance for U.S. Appl. No. 10/810,301, mailed Jul. 28, 2006, 5 pages. |
Notice of Allowance for U.S. Appl. No. 10/810,301, mailed Feb. 6, 2007, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,025, mailed Nov. 23, 2004, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,031, mailed May 22, 2002. |
Non-Final Office Action for U.S. Appl. No. 09/855,031, mailed Dec. 10, 2002. |
Final Office Action for U.S. Appl. No. 09/855,031, mailed Jul. 30, 2003. |
Notice of Allowance for U.S. Appl. No. 09/855,031, mailed Nov. 4, 2003. |
Non-Final Office Action for U.S. Appl. No. 10/736,680, mailed Feb. 16, 2006, 18 pages. |
Final Office Action for U.S. Appl. No. 10/736,680, mailed Aug. 3, 2006, 10 pages. |
Notice of Allowance for U.S. Appl. No. 10/736,680, mailed Feb. 22, 2007, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Sep. 10, 2003, 12 pages. |
Final Office Action for U.S. Appl. No. 10/210,041, mailed Jan. 7, 2004, 14 pages. |
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Mar. 11, 2004, 12 pages. |
Final Office Action for U.S. Appl. No. 10/210,041, mailed Jul. 7, 2004, 13 pages. |
Non-Final Office Action for U.S. Appl. No. 10/210,041, mailed Feb. 9, 2005, 7 pages. |
Final Office Action for U.S. Appl. No. 10/210,041, mailed Aug. 24, 2005, 7 pages. |
Advisory Action for U.S. Appl. No. 10/210,041, mailed Dec. 13, 2005, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 10/210,108, mailed Jun. 12, 2003, 6 pages. |
Notice of Allowance for U.S. Appl. No. 10/210,108, mailed Oct. 7, 2003. |
Requirement for Restriction/Election for U.S. Appl. No. 10/438,545, mailed Oct. 31, 2003. |
Non-Final Office Action for U.S. Appl. No. 10/438,545, mailed Dec. 12, 2003, 7 pages. |
Notice of Allowance for U.S. Appl. No. 10/438,545, mailed Jun. 15, 2004, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 10/832,086, mailed Sep. 19, 2007, 12 pages. |
Final Office Action for U.S. Appl. No. 10/832,086, mailed May 1, 2008, 31 pages. |
Advisory Action for U.S. Appl. No. 10/832,086, mailed Jul. 21, 2008, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 10/832,086, mailed Sep. 18, 2008, 18 pages. |
Non Final Office Action for U.S. Appl. No. 10/832,086, mailed Apr. 1, 2009 , 17 pages. |
Final Office Action for U.S. Appl. No. 10/832,086, mailed Sep. 29, 2009, 26 pages. |
Non-Final Office Action for U.S. Appl. No. 11/586,991, mailed Oct. 2, 2008, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 11/646,845, mailed Oct. 4, 2010, 48 pages. |
Non-Final Office Action for U.S. Appl. No. 11/831,950, mailed Aug. 18, 2009, 49 pages. |
Final Office Action for U.S. Appl. No. 11/831,950, mailed Jan. 6, 2010, 21 pages. |
Advisory Action for U.S. Appl. No. 11/831,950, mailed Mar. 4, 2010, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,742, mailed on Nov. 19, 2009, 51 pages. |
Final Office Action for U.S. Appl. No. 11/953,742, mailed Jun. 14, 2010, 21 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,743, mailed Nov. 23, 2009, 47 pages. |
Final Office Action for U.S. Appl. No. 11/953,743, mailed Jul. 15, 2010, 21 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,745, mailed Nov. 24, 2009, 48 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,745, mailed Jun. 14, 2010, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 11/953,751, mailed Nov. 16, 2009, 55 pages. |
Final Office Action for U.S. Appl. No. 11/953,751, mailed Jun. 25, 2010, 24 pages. |
Non-Final Office Action for U.S. Appl. No. 11/779,778, mailed Feb. 2, 2011, 63 pages. |
Non-Final Office Action for U.S. Appl. No. 11/779,714, mailed Sep. 1, 2009, 58 pages. |
Non-Final Office Action for U.S. Appl. No. 11/779,714, mailed Mar. 31, 2010, 26 pages. |
Final Office Action for U.S. Appl. No. 11/779,714, mailed Nov. 9, 2010, 24 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Jul. 16, 2007, 24 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Dec. 18, 2007, 40 pages. |
Final Office Action for U.S. Appl. No. 10/810,208, mailed Jun. 11, 2008, 34 pages. |
Advisory Action for U.S. Appl. No. 10/810,208, mailed Aug. 27, 2008, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Feb. 13, 2009, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Aug. 24, 2009, 38 pages. |
Non-Final Office Action for U.S. Appl. No. 10/810,208, mailed Feb. 5, 2010, 13 pages. |
Notice of Allowance for U.S. Appl. No. 10/810,208, mailed Jul. 15, 2010, 15 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 10/140,752, mailed May 18, 2006, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Dec. 14, 2006, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Apr. 23, 2007, 6 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,752, mailed Jan. 24, 2008, 8 pages. |
Notice of Allowance of U.S. Appl. No. 10/140,752, mailed Jul. 24, 2008, 14 pages. |
Notice of Allowance of U.S. Appl. No. 10/140,752, mailed Sep. 10, 2008, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 11/668,322, mailed Mar. 23, 2009, 19 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 11/668,322, mailed Oct. 29, 2009, 6 pages. |
Final Office Action for U.S. Appl. No. 11/668,322, mailed Feb. 24, 2010, 33 pages. |
Non-Final Office Action for U.S. Appl. No. 11/668,322, mailed Jun. 22, 2010, 16 pages. |
Final Office Action for U.S. Appl. No. 11/668,322, mailed Feb. 1, 2011, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 11/854,486, mailed Jul. 20, 2009, 29 pages. |
Non-Final Office Action for U.S. Appl. No. 11/854,486, mailed Jan. 12, 2010, 23 pages. |
Notice of Allowance for U.S. Appl. No. 11/854,486, mailed Jul. 13, 2010, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Jan. 25, 2006, 14 pages. |
Final Office Action for U.S. Appl. No. 10/139,912, mailed Aug. 11, 2006, 26 pages. |
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Apr. 20, 2007, 20 pages. |
Final Office Action for U.S. Appl. No. 10/139,912, mailed Nov. 28, 2007, 20 pages. |
Non-Final Office Action for U.S. Appl. No. 10/139,912, mailed Aug. 1, 2008, 21 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed Feb. 5, 2009, 8 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed Jun. 8, 2009, 8 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,912, mailed Oct. 19, 2009, 17 pages. |
Supplemental Notice of Allowance for U.S Appl. No. 10/139,912, mailed Nov. 23, 2009, 4 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 10/140,751, mailed Apr. 27, 2006, 5 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Aug. 10, 2006, 15 pages. |
Final Office Action for U.S. Appl. No. 10/140,751, mailed Apr. 10, 2007, 16 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Oct. 30, 2007, 14 pages. |
Final Office Action for U.S. Appl. No. 10/140,751, mailed May 28, 2008, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Sep. 17, 2008, 15 pages. |
Final Office Action for U.S. Appl. No. 10/140,751, mailed Mar. 17, 2009, 17 pages. |
Advisory Action for U.S. Appl. No. 10/140,751, mailed Jun. 1, 2009, 3 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Sep. 28, 2009, 34 pages. |
Final Office Action for U.S. Appl. No. 10/140,751, mailed Mar. 25, 2010, 29 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,751, mailed Dec. 20, 2010, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 11/745,008, mailed May 14, 2009, 27 pages. |
Final Office Action for U.S. Appl. No. 11/745,008, mailed Dec. 30, 2009, 27 pages. |
Advisory Action for U.S. Appl. No. 11/745,008, mailed Apr. 21, 2010, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Feb. 23, 2006, 25 pages. |
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Feb. 13, 2007, 29 pages. |
Final Office Action for U.S. Appl. No. 10/141,223, mailed Aug. 21, 2007, 25 pages. |
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Dec. 28, 2007, 13 pages. |
Non-Final Office Action for U.S. Appl. No. 10/141,223, mailed Sep. 3, 2008, 22 pages. |
Non-Final Office Action for U.S. Appl. No. 10/139,831, mailed Oct. 17, 2005, 7 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Feb. 9, 2006, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 10/139,831, mailed Jun. 27, 2006, 9 pages. |
Final Office Action for U.S. Appl. No. 10/139,831, mailed Nov. 28, 2006, 17 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Jun. 14, 2007, 26 pages. |
Notice of Allowance for U.S. Appl. No. 10/139,831, mailed Jun. 26, 2007, 25 pages. |
Non-Final Office Action for U.S. Appl. No. 11/828,246, mailed Jun. 15, 2009, 26 pages. |
Notice of Allowance for U.S. Appl. No. 11/828,246, mailed Nov. 16, 2009, 20 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,088, mailed Apr. 27, 2006, 13 pages. |
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Sep. 7, 2006, 13 pages. |
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Oct. 24, 2006, 8 pages. |
Notice of Allowance for U.S. Appl. No. 10/140,088, mailed Jan. 11, 2007, 5 pages. |
Non-Final Office Action for U.S. Appl. No. 11/621,038, mailed Apr. 23, 2009, 44 pages. |
Final Office Action for U.S. Appl. No. 11/621,038, mailed Dec. 23, 2009, 27 pages. |
Notice of Allowance for U.S. Appl. No. 11/621,038, mailed Apr. 28, 2010, 15 pages. |
Non-Final Office Action for U.S. Appl. No. 12/795,492, mailed Mar. 17, 2011, 51 pages. |
Non-Final Office Action for U.S. Appl. No. 12/198,697, mailed Feb. 2, 2010, 50 pages. |
Final Office Action for U.S. Appl. No. 12/198,697, mailed Aug. 2, 2010, 55 pages. |
Non-Final Office Action for U.S. Appl. No. 12/198,697, mailed Oct. 25, 2010, 36 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed Aug. 10, 2006, 22 pages. |
Final Office Action for U.S. Appl. No. 10/140,749, mailed Jun. 27, 2007, 23 pages. |
Final Office Action for U.S. Appl. No. 10/140,749, mailed Jan. 8, 2008, 23 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed Jun. 6, 2008, 28 pages. |
Final Office Action for U.S. Appl. No. 10/140,749, mailed Dec. 8, 2008, 30 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,749, mailed May 27, 2009, 38 pages. |
Final Office Action for U.S. Appl. No. 10/140,749, mailed Jan. 13, 2010, 44 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Apr. 20, 2006, 11 pages. |
Final Office Action for U.S. Appl. No. 10/140,753, mailed Jan. 10, 2007, 27 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Aug. 22, 2007, 14 pages. |
Non-Final Office Action for U.S. Appl. No. 10/140,753, mailed Jan. 8, 2008, 14 pages. |
Final Office Action for U.S. Appl. No. 10/140,753, mailed Aug. 25, 2008, 22 pages. |
Non-Final Office Action for U.S. Appl. No. 12/198,710, mailed Sep. 28, 2010, 15 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 11/000,359, mailed Jun. 20, 2008, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/000,359, mailed Oct. 23, 2008, 28 pages. |
Non-Final Office Action for U.S. Appl. No. 11/000,359, mailed May 29, 2009, 14 pages. |
Notice of Allowance for U.S. Appl. No. 11/000,359, mailed Sep. 22, 2009, 17 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 11/118,697, mailed Jun. 2, 2009, 8 pages. |
Notice of Allowance for U.S. Appl. No. 11/118,697, mailed Sep. 30, 2009, 41 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 12/639,749, mailed Dec. 7, 2010, 3 pages. |
Notice of Allowance for U.S. Appl. No. 12/639,749, mailed Feb. 11, 2011, 51 pages. |
Non-Final Office Action for U.S. Appl. No. 12/639,762, mailed Sep. 1, 2010, 40 pages. |
Notice of Allowance for U.S. Appl. No. 12/639,762, mailed Mar. 4, 2011, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,038, mailed Jun. 2, 2005, 14 pages. |
Final Office Action for U.S. Appl. No. 09/855,038, mailed Feb. 7, 2006, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,038, mailed Oct. 4, 2006, 14 pages. |
Notice of Allowance for U.S. Appl. No. 09/855,038, mailed Apr. 26, 2007, 8 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 09/988,066, mailed Dec. 13, 2005, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 09/988,066, mailed Jul. 14, 2006, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 09/988,066, mailed Apr. 6, 2007, 22 pages. |
Final Office Action for U.S. Appl. No. 09/988,066, mailed Oct. 31, 2007, 16 pages. |
Advisory Action for U.S. Appl. No. 09/988,066, mailed May 28, 2008, 4 pages. |
Notice of Allowance for U.S. Appl. No. 09/988,066, mailed Oct. 30, 2008, 16 pages. |
Notice of Allowance for U.S. Appl. No. 09/988,066, mailed Jan. 9, 2009. |
Non Final Office Action U.S. Appl. No. 11/804,977, mailed Jan. 14, 2008, 13 pages. |
Notice of Allowance for U.S. Appl. No. 11/804,977, mailed Nov. 19, 2008, 17 pages. |
Non-Final Office Action for U.S. Appl. No. 12/400,594, mailed May 14, 2010, 53 pages. |
Final Office Action for U.S. Appl. No. 12/400,594, mailed Oct. 28, 2010, 13 pages. |
Non-Final Office for U.S. Appl. No. 12/400,645, mailed Sep. 1, 2010, 45 pages. |
Notice of Allowance for U.S. Appl. No. 12/400,645, mailed Jan. 26, 2011, 14 pages. |
Non-Final Office Action for U.S. Appl. No. 12/372,390, mailed Apr. 22, 2010, 46 pages. |
Non-Final Office Action for U.S. Appl. No. 12/372,390, mailed Sep. 13, 2010, 10 pages. |
Notice of Allowance for U.S. Appl. No. 12/372,390, mailed Mar. 9, 2011, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 12/505,390, mailed Oct. 28, 2010, 51 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,015, mailed Oct. 28, 2004, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 09/855,015, mailed Jan. 12, 2006, 6 pages. |
Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Sep. 8, 2006, 3 pages. |
Requirement for Restriction/Election for U.S. Appl. No. 09/855,015, mailed Nov. 3, 2006, 6 pages. |
Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Jan. 7, 2008, 4 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 09/855,015, mailed Feb. 4, 2008, 3 pages. |
Non-Final Office Action for U.S. Appl. No. 12/070,893, mailed Jun. 10, 2010, 44 pages. |
Final Office Action for U.S. Appl. No. 12/070,893, mailed Nov. 24, 2010, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 12/070,893, mailed Mar. 18, 2011, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 11/611,067, mailed Feb. 20, 2009, 11 pages. |
Final Office Action for U.S. Appl. No. 11/611,067, mailed Oct. 16, 2009, 35 pages. |
Non-Final Office Action for U.S. Appl. No. 11/611,067, mailed Dec. 8, 2009, 11 pages. |
Non-Final Office Action for U.S. Appl. No. 11/615,769, mailed Apr. 15, 2009, 11 pages. |
Final Office Action for U.S. Appl. No. 11/615,769, mailed Jan. 22, 2010, 34 pages. |
Advisory Action for U.S. Appl. No. 11/615,769, mailed May 25, 2010, 3 pages. |
Notice of Allowance for U.S. Appl. No. 11/615,769, mailed Jul. 12, 2010, 14 pages. |
Davis, et al., “Pipeline Method and System for Switching Packets,” U.S. Appl. No. 13/398,725, filed Feb. 16, 2012, 54 pages. |
Hsu, et al., “Selection of Trunk Ports and Paths Using Rotation,” U.S. Appl. No. 13/407,397, filed Feb. 28, 2012, 30 pages. |
Final Office Action for U.S. Appl. No. 11/831,950, mailed on Feb. 28, 2012, 20 pages. |
Notice of Allowance for U.S. Appl. No. 11/668,322, mailed on Feb. 10, 2012, 20 pages. |
Non-Final Office Action for U.S. Appl. No. 13/083,481, mailed on Dec. 1, 2011, 7 pages. |
Notice of Allowance for U.S. Appl. No. 11/953,751, mailed Dec. 7, 2011, 12 pages. |
Supplemental Notice of Allowance for U.S. Appl. No. 11/953,751, mailed Dec. 27, 2011, 6 pages. |
Notice of Allowance for U.S. Appl. No. 12/198,697, mailed Nov. 28, 2011, 12 pages. |
Notice of Allowance for U.S. Appl. No. 12/198,697, mailed Jan. 5, 2012, 4 pages. |
Non-Final Office Action for U.S. Appl. No. 11/646,845, mailed on Oct. 14, 2011, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 11/831,950, mailed Aug. 26, 2011, 45 pages. |
Final Office Action for U.S. Appl. No. 11/953,742, mailed on Oct. 26, 2011, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 11/668,322, mailed on Aug. 30, 2011 17 pages. |
Non-Final Office Action for U.S. Appl. No. 11/745,008, mailed on Sep. 14, 2011, 26 pages. |
Notice of Allowance for U.S. Appl. No. 12/795,492, mailed on Nov. 14, 2011, 10 pages. |
Final Office Action for U.S. Appl. No. 12/070,893, mailed on Sep. 21, 2011, 12 pages. |
Notice of Allowance for U.S. Appl. No. 12/466,277, mailed on Nov. 2, 2011, 47 pages. |
Notice of Allowance for U.S. Appl. No. 11/831,950, mailed May 16, 2012, 11 pages. |
Final Office Action for U.S. Appl. No. 11/646,845, mailed on Jul. 5, 2012, 21 pages. |
Notice of Allowance for U.S. Appl. No. 11/779,714, mailed on Jun. 18, 2012, 9 pages. |
Final Office Action for U.S. Appl. No. 11/745,008, mailed on Jun. 28, 2012. |
Requirement for Restriction/Election for U.S. Appl. No. 12/608,972, mailed May 17, 2012, 5 pages. |
Gupta et al., “Packet Classification on Multiple Fields,” SIGCOMM '99, Aug. 1999, pp. 147-160, ACM, Cambridge, MA. |
Non-Final Office Action for U.S. Appl. No. 12/684,022 mailed Jul. 30, 2012, 18 pages. |
Non-Final Office Action for U.S. Appl. No. 12/880,518 mailed Oct. 30, 2012, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 13/083,481 mailed Oct. 4, 2012, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 12/900,279 mailed Aug. 30, 2012, 9 pages. |
Non-Final Office Action for U.S. Appl. No. 13/398,725 mailed on Nov. 28, 2012, 10 pages. |
Non-Final Office Action for U.S. Appl. No. 13/152,715 mailed on Nov. 13, 2012, 6 pages. |
Final Office Action for U.S. Appl. No. 12/900,279 mailed on Dec. 5, 2012, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 13/083,481, mailed on Mar. 1, 2013, 19 pages. |
Non-Final Office Action for U.S. Appl. No. 12/900,279, mailed on Apr. 11, 2013, 12 pages. |
Non-Final Office Action for U.S. Appl. No. 13/548,116 mailed on Apr. 15, 2013, 8 pages. |
Non-Final Office Action for U.S. Appl. No. 12/900,279 mailed on Apr. 11, 2013, 7 pages. |
Non-Final Office Action for U.S. Appl. No. 12/608,985 mailed on May 31, 2013, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20120163389 A1 | Jun 2012 | US |
Number | Date | Country | |
---|---|---|---|
61015151 | Dec 2007 | US | |
61015153 | Dec 2007 | US | |
60975363 | Sep 2007 | US |