This continuation application is related to, and claims priority to, U.S. patent application Ser. No. 11/324,159, entitled “METHOD OF PROVIDING VIRTUAL ROUTER FUNCTIONALITY” filed on Dec. 30, 2005, which is hereby incorporated by reference herein as though set forth in full.
This continuation application is related to U.S. patent application Ser. No. 11/324,209 entitled “MAC ADDRESS DETECTION DEVICE FOR VIRTUAL ROUTERS,” filed on Dec. 30, 2005, U.S. patent application Ser. No. 11/323,998, entitled “METHOD OF PROVIDING VIRTUAL ROUTER FUNCTIONALITY THROUGH ABSTRACTED VIRTUAL IDENTIFIERS,” filed on Dec. 30, 2005, U.S. patent application Ser. No. 11/324,205, entitled “METHOD OF EXTENDING DEFAULT FIXED NUMBER OF PROCESSING CYCLES IN PIPELINED PACKET PROCESSOR ARCHITECTURE,” filed on Dec. 30, 2005, each of which is hereby incorporated by reference herein as though set forth in full.
This application relates generally to networking devices, and, specifically, to methods for configuring such devices so that they provide virtual router functionality, i.e., present different virtual router configurations to different end users, classes of service or packets.
Virtual router functionality refers to the capability of the same physical networking device to present different virtual router configurations to different end users, classes of desired service, or packets. As a result of this capability, the same physical device appears as a plurality of different virtual routers. To implement this capability, current routers directly map a packet field of interest, typically the VLAN field, into the identifier of a particular routing table, and then use the particular routing table to route the packet. The VLAN field designates a virtual LAN, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same LAN for OSI layer two routing/switching purposes. For example, all the network elements in a particular VLAN receive broadcasts from any other element in the VLAN at OSI layer two.
This approach, whereby the VLAN of the incoming packet is directly mapped into an identifier of a routing table, worked fine as long as different end users used non-overlapping VLANs, so that the VLAN could be used to present different virtual routers to different end users. However, as VLAN usage proliferated, different end users began using overlapping sets of VLANs, so the VLAN could no longer be used to present different virtual routers to different end users.
Another problem is that the number of virtual routers that are possible is limited by the size of the VLAN field. A VLAN of 12 bits, for example, identifies only 4K different routing tables, which may not be sufficient for certain applications.
A third problem is the lack of flexibility in this approach. If, for example, the VLAN type or format changes as network usage evolves or as network standards change, the approach would be rendered obsolete as it is tied to a particular VLAN type and format.
A fourth problem is the lack of scalability of this approach with an increase in the number of virtual routers that may need to be accommodated. With this approach, for example, an increase in the size of the VLAN field to allow for an increase in virtual routers multiplies in direct proportion the number of routing tables that need to be maintained.
The invention provides a method of presenting different virtual routers to different end users, classes of service, or packets. The method may be performed in any networking device, and enables the device to provide virtual router functionality.
The method begins when a packet is received having a VLAN field and at least one additional field. Upon receipt of the packet, a key is formed from the VLAN field and at least one additional packet field, for example, a VMAN field.
The key is then mapped into a virtual router identifier (VRID) using an indirection mapping process. According to this indirect mapping process, a table having a plurality of entries, each having a content value and an index value, is accessed to locate an entry having a content value that matches the key. The index value of the matching entry is then mapped into the VRID using an associated data store element. The result is a virtual router identifier that identifies a particular virtual router configuration from a plurality of possible virtual router configurations.
Other systems, methods, features and advantages of the invention will be or will become apparent to one with skill in the art upon examination of the following figures and detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the accompanying claims.
The invention can be better understood with reference to the following figures. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention. Moreover, in the figures, like reference numerals designate corresponding parts throughout the different views.
a illustrates an example of a key format, and
a, 6b and 6c illustrate examples of alternative data types that may apply depending on the type of VLAN field detected in the ingress packet.
Referring to
As previously explained, the VLAN field 106 designates a virtual LAN, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same LAN for OSI layer two routing/switching purposes. Presently, the primary usage of the VLAN terminology is to uniquely identify logically related end user equipment within a VMAN (see below).
The VMAN field 108 designates a virtual metropolitan network, a collection of network elements that may be physically disparate but are logically related such that they may be considered part of the same network. Although the term originally applied only to metropolitan networks, that usage has evolved such that the term is now used to designate any network, metropolitan or non-metropolitan. In fact, as VMAN usage has proliferated, the term is now primarily used by service providers to designate logically related infrastructure equipment. At the same time, as explained above, the VLAN terminology is now primarily used to uniquely identify logically related end user equipment within a VMAN. Significantly, as a VLAN value uniquely identifies a VLAN within a VMAN, the same VLAN value may not be used to refer to different end user equipment within a VMAN.
The ingress port number 110 is an identifier of the physical port on which the packet was received at the device.
Returning to
The method begins when key generation logic 112 forms a key from the VLAN 106, VMAN 108 and ingress port 110 fields. In the particular embodiment illustrated, the key is formed by concatenating these three fields together, although it should be appreciated that other methods of forming the key are possible. Thus, for example, in one embodiment, an incoming packet received over ingress port X, having a VLAN of Y, and a VMAN of Z, has a key 200 formatted as illustrated in
Concurrently, in one embodiment, the ingress port 110 is input to a lookup table 114 to determine a key type 116. In this embodiment, the key type functions as a mask, by indicating which of the three fields of the key are to be wildcarded, i.e., ignored in the subsequent processing, and which are to be used. In this particular embodiment, each of the three fields can be independently wild-carded or not. Thus, for example,
In the embodiment illustrated in
a illustrates an implementation where the key type is a 3 bit field, identified with numeral 602, that is appended to the key, and indicates both the format of the key and which fields of the key are to be wildcarded. For example, the key type for key 604 indicates both that the key is 9 bits, and that the VLAN and VMAN fields are to be wildcarded; the key type for key 606 indicates both that the key is 15 bits, and that the ingress port and VMAN fields are to be wildcarded; the key type for key 608 indicates both that the key is 15 bits, and that the ingress port and VLAN fields are to be wildcarded; the key type for key 610 indicates both that the key is 21 bits, and that the VMAN field is to be wildcarded; the key type for key 612 indicates both that the key is 27 bits, and that the ingress port field is to be wildcarded; and the key type for key 614 indicates that the key is 33 bits, and that none of the fields are to be wildcarded.
Moreover, as will be discussed in greater detail below, in the case where a ternary CAM is used to perform the indirection mapping process, whereby the key is indirectly mapped into a virtual router identifier, just discussed key type generation and key masking processes are unnecessary as individual fields in the content values corresponding to the ternary CAM entries can be wildcarded, i.e., set as don't care values. In the case where a binary CAM is used to perform the indirection mapping process, the just discussed key type generation and key masking processes should generally be retained.
Referring again to
In the second step, the index value 122 of the matching entry 120b is mapped into the virtual router identifier 102 using an associated data store element 124. The associated data store element 124 has a plurality of entries 124a, 124b, each having an index value and a content value. In one embodiment, the mapping is performed by selecting the entry in the associated data store element 124 whose index value matches the index value 122 for the matching entry in the table 120. In the particular example illustrated in
In one implementation, the table 120 is stored on a CAM, and the first step of the two-step process occurs by having the CAM search for and locate the entry 120b whose content value matches the key 118. In the case where the CAM is a binary CAM, i.e., a CAM where each bit in the content value of an entry can only take on the binary values “0” and “1,” the previously described key type generation and masking processes should generally be performed as these functions are not available through the CAM. However, in the case where the CAM is a ternary CAM, i.e., a CAM where each bit in the content value of an entry can take on the binary values “0” and “1,” but also a “don't care” value, the previously described key type generation and masking processes are optional as these functions may be performed through suitable settings of the content values of the CAM entries.
In a second implementation, the table 120 is stored in RAM, and the first step of the two-step process occurs by applying a hash function to the key 118 to determine a table index for a starting entry, and then searching the table 120, beginning with the starting entry, to locate the entry 120b whose content value matches the key 118.
Logic 128 configures the device in accordance with the VRID 102, and the configured device then forwards the packet. In one embodiment, as will be discussed in more detail later, logic 128 selects or generates a CAM searching key responsive to the VRID 102. The CAM searching key is used in making a classification and forwarding decision for the packet. By setting the key that is used throughout the classification and forwarding process responsive to the VRID 102, the logic 128 in effect selects the routing table that is used to route the packet.
The foregoing embodiment overcomes the problems identified at the outset with the conventional approach for providing virtual router functionality. First, since a key can be formed from a combination of a VLAN and VMAN field, and a VLAN is a unique identifier within a particular VMAN, the embodiment allows the VLAN to be used once again for virtual routing purposes.
Second, the embodiment dramatically increases the number of virtual routers that are possible. In the case, for example, where the table 120 is stored on a CAM, the number of virtual routers that can be presented is limited only by the size of the CAM. No longer does the size of the VLAN field limit the number of virtual routers than can be supported.
Third, the embodiment is flexible and easily accommodates changes in network usage or standards. Consider, for example, the recent addition of a super-wide (24 bit) VLAN field, i.e., the ESID field, to the list of permissible Ethertypes. That is handled simply by defining a new key type in the lookup table 114. For example, while the normal data type might have the format illustrated in
Fourth, the embodiment is scaleable as an increase in the number of possible virtual routers would not necessarily require a commensurate increase in the number of routing tables that are maintained. Instead, many different key values could be mapped into the same VRID through appropriate settings of the index values associated with the entries 120a, 120b, 120c in the table 120. For example, in
Step 306 comprises the two-step indirection mapping process, wherein the first step involves searching or having performed a search through table 120, which may or may not be stored on a CAM, to find the entry 120b whose content value matches the key 118, and the second step involves locating the entry 124b in the associated data store 124, typically a RAM, whose index value matches the index value 122 of the matching entry in the table 120. Step 308 comprises outputting the virtual router identifier (VRID) 102. In
Steps 306 and 308 are performed by logic 126 (illustrated in
Step 310 comprises configuring the device to have the particular configuration identified by the virtual router identifier. In one embodiment, this step is performed by logic 128 (illustrated in
Referring back to
The ingress portion 406 of the packet classification/forwarding system 402 is coupled, through interface 418, to one or more network-side devices 414, and the egress portion 408 of the packet classification/forwarding system 402 is coupled, through interface 420, to one or more switch-side devices 416. Similarly, the ingress portion 410 of the packet modification system 404 is coupled, through interface 422, to the one or more switch-side devices 416, and the egress portion 412 of the packet modification system 404 is coupled, through interface 423, to the one or more network-side devices 414.
In addition to the ingress and egress portions 406, 408, the packet classification system 402 further comprises a first packet parser 104 (the same packet parser 104 illustrated in
Parser 104 is configured to parse an ingress packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
Packet processor 428 is configured to classify and forward the packet, responsive to the context pointer provided by parser 104.
Content Addressable Memory (CAM) 442 is used by the packet classification/forwarding system 402 to perform packet searches to arrive at a classification/forwarding decision for a packet. The CAM 442 may be ternary, binary, or a combination of binary and ternary.
The associated RAMs (ARAMs) 444a, 44b provide associated data for each entry in the CAM 442. The ARAMs 444a, 444b are accessed using the address (index value) returned by the CAM 442 as a result of a search operation. The ARAM 444a, 444b entry data is used to supply intermediate classification/forwarding information for the packet that is used by the packet processor 428 in making a final classification/forwarding decision for the packet.
The table 120, which may or may not be stored on a CAM, and the associated data store 124, which collectively may be referred to as a Virtual Router Indirection Mapper (VRIM), are the same elements previously discussed in relation to
In addition to the ingress and egress portions 410, 412, the packet modification system 404 further comprises a second packet parser 430 for parsing an egress packet, modification processor 432, a fragment processor 436, a third packet parser 436, Access Control Logic (“ACL”) 438a, and L3/L4 checksum logic 438b.
Parser 430 is configured to parse an egress packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
Modification processor 432 modifies some or all of an egress packet responsive to the context pointers provided by parser 430, in the process disassembling the packet into fragments. Fragment processor 436 re-assembles the fragmented packet.
The modification RAMs (“MRAMs”) 448a, 448b provides data and control structures for packet modification operations performed by the modification processors 432a, 432b.
Parser 436 is configured to parse the reassembled packet and provide context pointers to the beginning of the packet layers, for example, pointers to the beginning of OSI layers 2, 3, and 4.
ACL logic 438b arrives at an ACL decision with respect to a packet, such as CPU copy, mirror copy; and kill, responsive to the parsed packet layers provided by parser 436. The CPU copy action forwards a copy of the packet to a host 438 coupled to the system. The minor copy action implements an egress mirroring function, in which a copy of the packet is forwarded to mirror FIFO 440 and then on to the egress portion 408 of the packet classification/forwarding system 402. The kill action either kills the packet or marks it for killing by a downstream Medium Access Control (MAC) processor.
L3/L4 checksum logic 438b is configured to compute a checksum for a modified packet. In one embodiment, logic 438b is configured to independently calculate a layer three (IP) and layer four (TCP/UDP) checksum.
In one implementation, the interfaces 418, 420, 422, 424, and one or more of the CAM, VRIM, ARAM, or MRAM interfaces (not identified, may be a QDR- or DDR-type interface as described in U.S. patent application Ser. No. 10/655,742, filed Sep. 4, 2003, which is hereby fully incorporated by reference herein as though set forth in full.
In one embodiment, the logic elements depicted in
Packet processor 428 performs the configure device step 310 of
Packet processor 428 also performs step 312 by classifying and forwarding the ingress packet responsive to the CAM searching process that is performed, at least initially, with the key determined responsive to the VRID 102.
While various embodiments of the invention have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible that are within the scope of this invention. Accordingly, the invention is not to be restricted except in light of the attached claims and their equivalents.
Number | Name | Date | Kind |
---|---|---|---|
4025901 | Bachman et al. | May 1977 | A |
4042912 | Bachman et al. | Aug 1977 | A |
4480307 | Budde et al. | Oct 1984 | A |
4654654 | Butler et al. | Mar 1987 | A |
4755986 | Hirata | Jul 1988 | A |
5072443 | Hahne et al. | Dec 1991 | A |
5282270 | Oppenheimer et al. | Jan 1994 | A |
5367650 | Sharangpani et al. | Nov 1994 | A |
5473599 | Li et al. | Dec 1995 | A |
5524258 | Corby, Jr. et al. | Jun 1996 | A |
5577256 | Muramatsu et al. | Nov 1996 | A |
5710923 | Jennings et al. | Jan 1998 | A |
5764636 | Edsall | Jun 1998 | A |
5784569 | Miller et al. | Jul 1998 | A |
5790799 | Mogul et al. | Aug 1998 | A |
5852607 | Chin | Dec 1998 | A |
5923660 | Shemla et al. | Jul 1999 | A |
5943493 | Teich et al. | Aug 1999 | A |
5999518 | Nattkemper et al. | Dec 1999 | A |
6002881 | York et al. | Dec 1999 | A |
6034957 | Haddock et al. | Mar 2000 | A |
6098109 | Kotzur et al. | Aug 2000 | A |
6148381 | Jotwani | Nov 2000 | A |
6172980 | Flanders et al. | Jan 2001 | B1 |
6173333 | Jolitz et al. | Jan 2001 | B1 |
6178491 | Ben-Ephraim et al. | Jan 2001 | B1 |
6185214 | Schwartz et al. | Feb 2001 | B1 |
6208649 | Kloth | Mar 2001 | B1 |
6226291 | Chauvel et al. | May 2001 | B1 |
6256314 | Rodrig et al. | Jul 2001 | B1 |
6266705 | Ullum et al. | Jul 2001 | B1 |
6275861 | Chaudri et al. | Aug 2001 | B1 |
6292838 | Nelson | Sep 2001 | B1 |
6295299 | Haddock et al. | Sep 2001 | B1 |
6304924 | Varma | Oct 2001 | B1 |
6347347 | Brown et al. | Feb 2002 | B1 |
6351801 | Christie et al. | Feb 2002 | B1 |
6362990 | Gibson et al. | Mar 2002 | B1 |
6381162 | Peterson | Apr 2002 | B1 |
6381242 | Maher, III et al. | Apr 2002 | B1 |
6384750 | Brown | May 2002 | B1 |
6397260 | Wils et al. | May 2002 | B1 |
6463067 | Hebb et al. | Oct 2002 | B1 |
6466983 | Strazza | Oct 2002 | B1 |
6502185 | Keller et al. | Dec 2002 | B1 |
6515963 | Bechtolsheim et al. | Feb 2003 | B1 |
6530010 | Hung et al. | Mar 2003 | B1 |
6553002 | Bremer et al. | Apr 2003 | B1 |
6564238 | Kim et al. | May 2003 | B1 |
6570877 | Kloth et al. | May 2003 | B1 |
6631465 | Chen et al. | Oct 2003 | B1 |
6643821 | Karim et al. | Nov 2003 | B2 |
6650642 | Sugai et al. | Nov 2003 | B1 |
6650644 | Colley et al. | Nov 2003 | B1 |
6658002 | Ross et al. | Dec 2003 | B1 |
6661791 | Brown | Dec 2003 | B1 |
6665755 | Modelski et al. | Dec 2003 | B2 |
6697751 | Skingsley et al. | Feb 2004 | B2 |
6714987 | Amin et al. | Mar 2004 | B1 |
6721316 | Epps et al. | Apr 2004 | B1 |
6731652 | Ramfelt et al. | May 2004 | B2 |
6735670 | Bronstein et al. | May 2004 | B1 |
6738892 | Coon et al. | May 2004 | B1 |
6763023 | Gleeson et al. | Jul 2004 | B1 |
6765881 | Rajakarunanayake | Jul 2004 | B1 |
6771594 | Upadrasta | Aug 2004 | B1 |
6775280 | Ma et al. | Aug 2004 | B1 |
6781601 | Cheung | Aug 2004 | B2 |
6781992 | Rana et al. | Aug 2004 | B1 |
6792502 | Pandya et al. | Sep 2004 | B1 |
6795435 | Jouppi et al. | Sep 2004 | B1 |
6798746 | Kloth et al. | Sep 2004 | B1 |
6807156 | Veres et al. | Oct 2004 | B1 |
6807175 | Jennings et al. | Oct 2004 | B1 |
6807183 | Chow et al. | Oct 2004 | B1 |
6842457 | Malalur | Jan 2005 | B1 |
6842791 | Navada et al. | Jan 2005 | B2 |
6871262 | Oren et al. | Mar 2005 | B1 |
6882642 | Kejriwal et al. | Apr 2005 | B1 |
6888797 | Cao et al. | May 2005 | B1 |
6914905 | Yip et al. | Jul 2005 | B1 |
6917617 | Jin et al. | Jul 2005 | B2 |
6918053 | Thatte et al. | Jul 2005 | B1 |
6957258 | Maher, III et al. | Oct 2005 | B2 |
6975581 | Medina et al. | Dec 2005 | B1 |
6976158 | Catherwood et al. | Dec 2005 | B2 |
6980552 | Belz et al. | Dec 2005 | B1 |
6993663 | Paya et al. | Jan 2006 | B1 |
6999462 | Acharya | Feb 2006 | B1 |
7002974 | Deerman et al. | Feb 2006 | B1 |
7006438 | West et al. | Feb 2006 | B2 |
7007151 | Ely et al. | Feb 2006 | B1 |
7016979 | He et al. | Mar 2006 | B2 |
7042848 | Santiago et al. | May 2006 | B2 |
7062398 | Rothberg | Jun 2006 | B1 |
7062641 | Devanagondi et al. | Jun 2006 | B1 |
7079407 | Dimitrelis | Jul 2006 | B1 |
7079538 | Gazsi et al. | Jul 2006 | B2 |
7092354 | Jensen | Aug 2006 | B2 |
7111101 | Bourke et al. | Sep 2006 | B1 |
7114053 | Goss | Sep 2006 | B2 |
7116680 | Kramer et al. | Oct 2006 | B1 |
7117126 | Floyd et al. | Oct 2006 | B2 |
7120733 | Mick, Jr et al. | Oct 2006 | B1 |
7139271 | Parruck et al. | Nov 2006 | B1 |
7149216 | Cheriton | Dec 2006 | B1 |
7152191 | Kessler et al. | Dec 2006 | B2 |
7154902 | Sikdar | Dec 2006 | B1 |
7159030 | Elzur | Jan 2007 | B1 |
7177276 | Epps et al. | Feb 2007 | B1 |
7187694 | Liao | Mar 2007 | B1 |
7190696 | Manur et al. | Mar 2007 | B1 |
7206430 | Pelly et al. | Apr 2007 | B2 |
7212837 | Calhoun et al. | May 2007 | B1 |
7224701 | Ozguner | May 2007 | B2 |
7236492 | Davis et al. | Jun 2007 | B2 |
7248584 | Hooper | Jul 2007 | B2 |
7248585 | Kohn et al. | Jul 2007 | B2 |
7260648 | Tingley et al. | Aug 2007 | B2 |
7274693 | Kloth et al. | Sep 2007 | B1 |
7286520 | Takeda et al. | Oct 2007 | B2 |
7286565 | Carr | Oct 2007 | B1 |
7292591 | Parker et al. | Nov 2007 | B2 |
7293113 | Krishna et al. | Nov 2007 | B1 |
7295576 | Chauvel | Nov 2007 | B2 |
7296100 | Venkatesh et al. | Nov 2007 | B1 |
7304991 | Basso et al. | Dec 2007 | B2 |
7304996 | Swenson et al. | Dec 2007 | B1 |
7340535 | Alam | Mar 2008 | B1 |
7385984 | Parker et al. | Jun 2008 | B2 |
7444405 | Gangadharan | Oct 2008 | B2 |
7453874 | Nguyen | Nov 2008 | B1 |
7463628 | Parker et al. | Dec 2008 | B2 |
7487938 | Brady, Jr. et al. | Feb 2009 | B2 |
7489699 | Sindhu et al. | Feb 2009 | B2 |
7502374 | Parker et al. | Mar 2009 | B1 |
7515589 | Bacher et al. | Apr 2009 | B2 |
7522516 | Parker | Apr 2009 | B1 |
7522592 | Kanetake et al. | Apr 2009 | B2 |
7539750 | Parker et al. | May 2009 | B1 |
7554978 | Parker | Jun 2009 | B1 |
7561531 | Lewites et al. | Jul 2009 | B2 |
7580350 | Parker | Aug 2009 | B1 |
7606263 | Parker | Oct 2009 | B1 |
7613209 | Nguyen et al. | Nov 2009 | B1 |
7649879 | Parker | Jan 2010 | B2 |
7675915 | Parker et al. | Mar 2010 | B2 |
20010005876 | Srinivasan et al. | Jun 2001 | A1 |
20010015976 | Harasawa et al. | Aug 2001 | A1 |
20010020266 | Kojima et al. | Sep 2001 | A1 |
20010025315 | Jolitz | Sep 2001 | A1 |
20010028651 | Murase | Oct 2001 | A1 |
20010036196 | Blightman et al. | Nov 2001 | A1 |
20010043610 | Nemirovsky et al. | Nov 2001 | A1 |
20010048661 | Clear et al. | Dec 2001 | A1 |
20020037729 | Kitazawa et al. | Mar 2002 | A1 |
20020061012 | Thi et al. | May 2002 | A1 |
20020075805 | Gupta et al. | Jun 2002 | A1 |
20020085560 | Cathey et al. | Jul 2002 | A1 |
20020095512 | Rana et al. | Jul 2002 | A1 |
20020103925 | Sheth et al. | Aug 2002 | A1 |
20020103942 | Comeau | Aug 2002 | A1 |
20020105909 | Flanagan et al. | Aug 2002 | A1 |
20020107908 | Dharanikota | Aug 2002 | A1 |
20020109615 | Abdat | Aug 2002 | A1 |
20020122386 | Calvignac et al. | Sep 2002 | A1 |
20020126673 | Dagli et al. | Sep 2002 | A1 |
20020147961 | Charters et al. | Oct 2002 | A1 |
20020163909 | Sarkinen et al. | Nov 2002 | A1 |
20020163935 | Paatela et al. | Nov 2002 | A1 |
20020184387 | Yamaya et al. | Dec 2002 | A1 |
20020191605 | Lunteren et al. | Dec 2002 | A1 |
20020194363 | Jha | Dec 2002 | A1 |
20030005143 | Elzur et al. | Jan 2003 | A1 |
20030005210 | Thummalapally et al. | Jan 2003 | A1 |
20030026259 | Brown | Feb 2003 | A1 |
20030028713 | Khanna et al. | Feb 2003 | A1 |
20030036896 | Skingsley et al. | Feb 2003 | A1 |
20030037227 | Nomura | Feb 2003 | A1 |
20030046423 | Narad et al. | Mar 2003 | A1 |
20030056014 | Verberkt et al. | Mar 2003 | A1 |
20030067903 | Jorgensen | Apr 2003 | A1 |
20030069973 | Ganesan et al. | Apr 2003 | A1 |
20030126286 | Lee | Jul 2003 | A1 |
20030154380 | Richmond et al. | Aug 2003 | A1 |
20030165144 | Wang | Sep 2003 | A1 |
20030169612 | Hu | Sep 2003 | A1 |
20030169737 | Lavigne et al. | Sep 2003 | A1 |
20030185220 | Valenci | Oct 2003 | A1 |
20030193949 | Kojima et al. | Oct 2003 | A1 |
20030196081 | Savarda et al. | Oct 2003 | A1 |
20030204840 | Wu | Oct 2003 | A1 |
20030214905 | Solomon et al. | Nov 2003 | A1 |
20030214956 | Navada et al. | Nov 2003 | A1 |
20030223361 | Hussain et al. | Dec 2003 | A1 |
20030225907 | Krishnan | Dec 2003 | A1 |
20040003110 | Ozguner | Jan 2004 | A1 |
20040015683 | Emma et al. | Jan 2004 | A1 |
20040049582 | Noel, Jr. et al. | Mar 2004 | A1 |
20040066780 | Shankar et al. | Apr 2004 | A1 |
20040100956 | Watanabe | May 2004 | A1 |
20040105423 | Koehler et al. | Jun 2004 | A1 |
20040120173 | Regev et al. | Jun 2004 | A1 |
20040120435 | Yang et al. | Jun 2004 | A1 |
20040174898 | Kadambi et al. | Sep 2004 | A1 |
20040202162 | Vu | Oct 2004 | A1 |
20040205056 | Mori et al. | Oct 2004 | A1 |
20040205753 | Moore | Oct 2004 | A1 |
20040208197 | Viswanathan | Oct 2004 | A1 |
20040246981 | He et al. | Dec 2004 | A1 |
20040258062 | Narvaez | Dec 2004 | A1 |
20050015423 | D'Arcy et al. | Jan 2005 | A1 |
20050021740 | Bar et al. | Jan 2005 | A1 |
20050033941 | Joyce et al. | Feb 2005 | A1 |
20050044199 | Shiga et al. | Feb 2005 | A1 |
20050044338 | Goss | Feb 2005 | A1 |
20050055339 | Richardson | Mar 2005 | A1 |
20050074009 | Kanetake et al. | Apr 2005 | A1 |
20050086353 | Shirakawa et al. | Apr 2005 | A1 |
20050094572 | Mimura et al. | May 2005 | A1 |
20050111360 | Jin et al. | May 2005 | A1 |
20050117576 | McDysan et al. | Jun 2005 | A1 |
20050149633 | Natarajan et al. | Jul 2005 | A1 |
20050159166 | Jonsson et al. | Jul 2005 | A1 |
20050180429 | Ghahremani et al. | Aug 2005 | A1 |
20050190639 | Hu | Sep 2005 | A1 |
20050198362 | Navada et al. | Sep 2005 | A1 |
20050220011 | Parker et al. | Oct 2005 | A1 |
20050220094 | Parker et al. | Oct 2005 | A1 |
20050226242 | Parker | Oct 2005 | A1 |
20050281191 | McGee et al. | Dec 2005 | A1 |
20060007917 | Saito et al. | Jan 2006 | A1 |
20060034292 | Wakayama et al. | Feb 2006 | A1 |
20060039374 | Belz et al. | Feb 2006 | A1 |
20060056420 | Okuda et al. | Mar 2006 | A1 |
20060092950 | Arregoces et al. | May 2006 | A1 |
20060106934 | Figaro et al. | May 2006 | A1 |
20060209796 | Scott | Sep 2006 | A1 |
20060233168 | Lewites et al. | Oct 2006 | A1 |
20070153808 | Parker et al. | Jul 2007 | A1 |
20070204036 | Mohaban et al. | Aug 2007 | A1 |
20070266374 | Grisenthwaite et al. | Nov 2007 | A1 |
20070291754 | Okagawa et al. | Dec 2007 | A1 |
20070291791 | English et al. | Dec 2007 | A1 |
20080034112 | Imai et al. | Feb 2008 | A1 |
20080043628 | Parker et al. | Feb 2008 | A1 |
20080049774 | Swenson et al. | Feb 2008 | A1 |
20080075078 | Watanabe | Mar 2008 | A1 |
20080186968 | Farinacci et al. | Aug 2008 | A1 |
20080205264 | Rorie | Aug 2008 | A1 |
20080222094 | Cox | Sep 2008 | A1 |
20090213856 | Paatela et al. | Aug 2009 | A1 |
20100054256 | Parker | Mar 2010 | A1 |
Number | Date | Country |
---|---|---|
1604568 | Apr 2005 | CN |
101352003 | Jan 2009 | CN |
1601137 | Nov 2005 | EP |
2001345864 | Dec 2001 | JP |
2002176431 | Jun 2002 | JP |
2002325090 | Nov 2002 | JP |
2002335265 | Nov 2002 | JP |
2003244185 | Aug 2003 | JP |
2004187282 | Jul 2004 | JP |
2005117171 | Apr 2005 | JP |
WO-03081857 | Oct 2003 | WO |
WO-2005069551 | Jul 2005 | WO |
WO-2005094343 | Oct 2005 | WO |
WO-2005099178 | Oct 2005 | WO |
WO-2005099179 | Oct 2005 | WO |
WO-2005099192 | Oct 2005 | WO |
WO-2007079035 | Jul 2007 | WO |
WO2007079035 | Jul 2007 | WO |
Entry |
---|
European Search Report and Written Opinion for European Patent Application No. 11162449.0, Mailed Jul. 7, 2011, 11 pages. |
Non-Final Office Action for Japanese Patent Application No. 2008-548656, Mailed Apr. 5, 2011, 4 pages. |
Non-Final Office Action for Chinese Patent Application No. 200680050164.9 Mailed Mar. 16, 2011, 11 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,552, Mailed Nov. 14, 2007, 13 Pages. |
Supplemental Notice of Allowance and Fees for U.S. Appl. No. 10/814,552, Mailed Dec. 18, 2007, 8 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/860,045 Mailed Nov. 18, 2009, 9 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 11/850,045 Mailed Mar. 29, 2010, 11 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,774 Mailed Dec. 3, 2009, 19 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,774 Mailed Nov. 9, 2007, 20 Pages. |
Final Office Action for U.S. Appl. No. 10/814,774 Mailed Aug. 19, 2008, 18 Pages. |
Final Office Action for U.S. Appl. No. 10/814,774 Mailed Aug. 3, 2009, 16 Pages. |
Final Office Action for U.S. Appl. No. 10/814,774 Mailed Apr. 21, 2010, 7 pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/813,731 Mailed Aug. 1, 2007, 11 Pages. |
Supplemental Notice of Allowance and Fees for U.S. Appl. No. 10/813,731 Mailed Aug. 20, 2007, 4 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/924,500 Mailed Aug. 12, 2009, 9 Pages. |
Final Office Action for U.S. Appl. No. 11/924,500 Mailed Feb. 4, 2010, 10 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,725 Mailed Sep. 6, 2007, 15 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 11/924,523 Mailed Dec. 18, 2009, 10 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,556 Sep. 17, 2007, 19 Pages. |
Final Office Action for U.S. Appl. No. 10/814,556 Mailed Apr. 29, 2008, 20 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,556 Mailed Jan. 5, 2009, 24 Pages. |
Final Office Action for U.S. Appl. No. 10/814,556 Mailed Jun. 22, 2009, 28 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,556 Mailed Jan. 5, 2010, 28 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,598 Mailed Mar. 24, 2009, 14 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,598 Mailed Jun. 20, 2008, 22 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/835,598 Mailed Nov. 5, 2009, 8 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,728 Mailed Dec. 17, 2008, 4 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,728 Mailed May 5, 2008, 38 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,545 Mailed Jul. 18, 2007, 8 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,545 Mailed Feb. 19, 2008, 6 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,545 Mailed Sep. 11, 2008, 8 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,729, Mailed Oct. 20, 2008, 23 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,729 Mailed Jul. 10, 2009, 11 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,729 Mailed Sep. 3, 2009, 9 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,727 Mailed Aug. 22, 2007, 6 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,727 Mailed Feb. 29, 2008, 6 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/814,727 Mailed Oct. 20, 2008, 13 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,532 Mailed May 5, 2008, 25 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,532 Mailed Jan. 21, 2009, 14 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/835,532 Mailed Jun. 25, 2009, 7 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,272 Mailed Mar. 12, 2008, 26 Pages. |
Final Office Action for U.S. Appl. No. 10/835,272 Mailed Dec. 23, 2008, 19 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/835,272 Mailed Jul. 9, 2009, 6 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,205 Mailed Oct. 2, 2008, 18 Pages. |
Final Office Action for U.S. Appl. No. 11/324,205 Mailed Jun. 1, 2009, 23 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,205 Mailed Dec. 28, 2009, 29 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/834,566 Mailed Oct. 3, 2007, 11 Pages. |
Final Office Action for U.S. Appl. No. 10/834,566 Mailed Apr. 29, 2008, 13 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/834,566 Mailed Dec. 19, 2008, 10 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,271 Mailed Jan. 29, 2008, 16 Pages. |
Final Office Action for U.S. Appl. No. 10/835,271 Mailed Jul. 22, 2008, 12 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,271 Mailed Mar. 13, 2009, 14 pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/835,271 Mailed Sep. 2, 2009, 4 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/834,576 Mailed Jan. 11, 2008, 13 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/834,576 Mailed Oct. 1, 2008, 14 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/834,576 Mailed May 14, 2009, 8 Pages. |
Restriction Requirement for U.S. Appl. No. 10/834,573 Mailed Aug. 11, 2008, 6 Pages. |
Final Office Action for U.S. Appl. No. 10/834,573 Mailed Jul. 7, 2009, 22 Pages. |
Advisory Action for U.S. Appl. No. 10/834,573 Mailed Oct. 27, 2009, 6 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,252 Mailed Jul. 20, 2007, 14 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/835,252 Mailed Mar. 25, 2008, 26 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 10/835,252 Mailed Jan. 5, 2009, 4 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,209 Mailed Oct. 30, 2008, 23 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/323,998 Mailed Feb. 18, 2009, 22 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,159 Mailed Sep. 4, 2008, 33 Pages. |
Final Office Action for U.S. Appl. No. 11/324,159 Mailed Apr. 3, 2009, 28 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,159 Mailed Nov. 12, 2009, 31 Pages. |
Notice of Restriction Requirement for U.S. Appl. No. 10/814,552, Mailed Aug. 10, 2007, 5 Pages. |
Notice of Restriction Requirement for U.S. Appl. No. 11/814,552, Mailed Oct. 11, 2007, 5 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/814,774 Mailed Mar. 23, 2009, 10 Pages. |
International Preliminary Report on Patentability for PCT Application PCT/US2005/010541 Mailed Oct. 2, 2008, 6 Pages. |
International Search Report and WO for PCT Application PCT/US2005/010541 Mailed Aug. 25, 2008, 10 Pages. |
International Preliminary Report on Patentability for PCT Application PCT/US2005/010544 Mailed Oct. 12, 2006, 5 Pages. |
International Search Report and WO for PCT Application PCT/US2005/010544 Mailed Jun. 29, 2006, 9 Pages. |
International Preliminary Report on Patentability for PCT Application PCT/US2005/010543 Mailed Oct. 12, 2006, 7 Pages. |
International Search Report and WO for PCT Application PCT/US2005/010543 Mailed Apr. 24, 2006, 11 Pages. |
International Preliminary Report on Patentability for PCT Application PCT/US2005/010435 Mailed Oct. 2, 2008, 7 Pages. |
International Search Report and WO for PCT Application PCT/US2005/010435 Mailed Aug. 25, 2008, 10 Pages. |
Non-Final Office Action for European Application No. 06846017.9 Mailed Apr. 16, 2009, 5 Pages. |
International Search Report and WO for PCT Application PCT/US2005/049107 Mailed May 15, 2007, 14 Pages. |
International Preliminary Report on Patentability for PCT Application PCT/US2006/049107 Mailed Jul. 10, 2008, 8 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,159 Mailed Jun. 8, 2010, 17 Pages. |
Notice of Allowance and Fees for U.S. Appl. No. 11/324,209 Mailed Jul. 9, 2010, 12 Pages. |
Non-Final Office Action for Chinese Patent Application No. 200680050164.9 Mailed Aug. 4, 2010, 19 Pages. |
Non-Final Office Action for European Application No. 06846017.9 Mailed Apr. 21, 2010, 6 Pages. |
Notice of Allowance for U.S. Appl. No. 11/324,159 Mailed Nov. 15, 2010, 13 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/324,209 Mailed Jan. 21,2010, 23 Pages. |
Non-Final Office Action for U.S. Appl. No. 11/323,998 Mailed Sep. 4, 2008, 28 Pages. |
Final Office Action for U.S. Appl. No. 11/324,209 Mailed Jul. 21, 2009, 19 Pages. |
Non-Final Office Action for U.S. Appl. No. 10/834,573 Mailed Jan. 21, 2010, 20 Pages. |
Final Office Action for U.S. Appl. No. 11/323,998 Mailed Mar. 4, 2010, 27 Pages. |
Braden, R., et al., “RFC 1071—Computing the Internet Checksum”, Sep. 1988 available at http://www.faqs.org/rfcs/rfc1071.html, 20 Pages. |
Mallory, T., et al., “RFC 1141—Incremental Updating of the Internet Checksum”, Jan. 1990, available at: htt;://www.faqs.org/rfcs/rfc1141.html, 3 Pages. |
Netlogic Microsystems, “Product Brief NSE5000GLQ”, Copyright 2004, available at: http://www.netlogicmicro.com/datasheets/nse5000glg.html, 3 Pages. |
Rijsinghani, A., et al., “RFC 1624—Computation of the Internet Checksum via Incremental Update”, May 1994, available at: htt;://www.faqs.org/rfcs/rfc1624.html, 5 Pages. |
Van Ess, D., “A Circular FIFO, PSoC Style”, Cypress Microsystems, Application Note AN2036, Rev. B, Jun. 21, 2002, 5 Pages. |
Zhang, Zheng, “Recovery of Memory and Process in SDM Systems: HA Issue #1”, Hewlett-Packard Co. HPL-2001-76, Mar. 30, 2001, 16 Pages. |
Non-Final Office Action for EP Patent Application No. 06846017.9, Mailed Jul. 1, 2011. |
Final Office Action for Chinese Patent Application No. 200680050164.9, Mailed Jul. 26, 2011. |
Non-Final Office Action for Japanese Patent Application No. 2008-548656, mailed May 15, 2012. |
Notice of Allowance for European Patent Application No. 11162449.0, mailed Jun. 26, 2012. |
Non-Final Office Action for Japanese Patent Application No. 2008-548656, mailed Feb. 26, 2013. |
Number | Date | Country | |
---|---|---|---|
20120207169 A1 | Aug 2012 | US |