1. Field of the Invention
The present invention relates to storage area networks, and more particularly, to a Fibre Channel Switch that enables the end devices in different Fabrics to communicate with one another while retaining their unique Fibre Channel IDs.
2. Background of the Invention
With the increasing popularity of Internet commerce and network centric computing, businesses and other organizations are becoming more and more reliant on information. To handle all of this data, storage area networks or SANs have become very popular. A SAN typically includes a number of storage devices, a plurality of Hosts, and a number of Switches arranged in a Switching Fabric that connects the storage devices and the Hosts.
Most SANs rely on the Fibre Channel protocol for communication within the Fabric. For a detailed explanation of the Fibre Channel protocol and Fibre Channel Switching Fabrics and Services, see the Fibre Channel Framing and Signaling Standard, Rev 1.70, American National Standard of Accredited Standards Committee (NCITS), Feb. 8, 2002, and the Fibre Channel Switch Fabric—2, Rev. 5.4, NCITS, Jun. 26, 2001, and the Fibre Channel Generic Services—3, Rev. 7.01, NCITS, Nov. 28, 2000, all incorporated by reference herein for all purposes.
In Fibre Channel, each device (Hosts, storage devices and Switches) is identified by a globally unique, eight (8) byte wide World Wide Name (WWN) assigned by the manufacturer. There are two kinds of WWNs used in FC networks. If you consider a device with one or more FC adapters (or HBAs or ports) to connect to a FC network, every device is assigned a node WWN (nWWN) and each adapter is assigned a port WWN (pWWN). The nWWN and pWWN are different from each other. When the Fibre Channel devices are interconnected to form a SAN, the WWN (along with other parameters) is the primary mechanism to identify each device. Fibre Channel frames are used for communication among the devices in the SAN. The WWN, however, is not used by the frames. Each adapter or port must login to the FC network. At this time, each port is dynamically assigned a unique Fibre Channel address (FC_ID) by the Fabric. The FC_ID is used in FC networks for end devices to address each other.
The three byte wide Fibre Channel addresses are hierarchically structured in three fields, each one byte long: Domain_ID, Area_ID, and Port_ID. Each Switch within the Fabric is assigned a Domain_ID. The end devices attached to a particular Switch are assigned the Domain_ID of that Switch. The Switch manages the allocation of the Area_ID and Port_ID fields for each end device to guarantee the uniqueness of the assigned addresses in that Domain. For example, if a Switch is assigned a Domain number five and the Switch subdivides its address space in two areas each having three connected end devices, then a possible Fibre Channel address allocation is: 5:1:1, 5:1:2, 5:1:3, 5:2:1, 5:2:2, and 5:2:3.
Fibre Channel based SANs are often organized into zones. Within each zone, Hosts can see and access only storage devices or other Hosts belonging to that zone. This allows the coexistence on the same SAN of different computing environments. For example, it is possible to define on a SAN a Unix zone and a separate Windows zone. Unix servers belonging to the Unix zone may access only storage or Hosts devices within the Unix zone, and do not interfere with the other devices connected to the SAN. In the same manner, Windows servers belonging to the Windows zone may access storage or Hosts devices only within the Windows zone, without interfering with the other devices connected to the SAN. The SAN administrator may define in a SAN multiple zones, as required or dictated by the computing and storage resources connected to it. The Switching Fabric allows communications only between devices belonging to the same zone, preventing a device of one zone from seeing or accessing a device of another zone.
The information infrastructure within a large enterprise will typically have a number of SANs, each dedicated for a different organization or application within the enterprise. For example, a large corporation may have different SANs for corporate, for the sales department, the marketing department, etc. Each SAN will typically include redundant Fibre Channel fabrics connecting a plurality of Hosts and storage devices. The redundant Switches in the Fibre Channel fabrics are provided in the event a Switch or link in one Fabric goes down. If this were to occur, the redundant fabric would be used enabling normal operation of SAN. Another example is the use of a dedicated SAN for managing a mail server such as Microsoft Exchange.
The aforementioned arrangement has a number of disadvantages. Foremost, the Hosts in a given SAN can communicate only with the storage devices in that same SAN. There is no way that a Host in one SAN can directly communicate with a storage device in a second SAN. This arrangement is not only inefficient, it is expensive. Since storage devices cannot be shared among SANs, separate storage devices are required for each SAN.
The above-identified parent application partially addresses this problem by introducing the concept of a Virtual SAN or “VSAN”. The implementation of a VSAN is based on the concept of dividing the switching fabric of a single physical SAN into logical SANs, each called a VSAN. The properties of each VSAN are similar to a standard SAN, in particular: (i) unicast, broadcast and multicast traffic is confined to a VSAN and does not span multiple VSANs; (ii) Fibre Channel identifiers (FC_IDs) are assigned per VSAN. This means that a given FC address may be assigned to two different Hosts in two different VSANs; and (iii) routing and distributed Fabric Services, such as Name Server, Zone Server, etc. are maintained independently for each VSAN. This results in constraining the effect of a configuration or topology change to only the affected VSAN. Within each VSAN, a frame is forwarded as in any normal SAN, using the FC_ID.
One known solution for enabling end devices in different VSANs to communicate with one another involves the virtualization of the end devices so that there are “local instances” of each end device in the Fabric within each VSAN. See for example US Patent Publication 2003/0012204. One problem with this approach is that the border Switches between the VSANs perform FC_ID translations (i.e., Network Address translations or NATs) for the source and destination end devices. If a border Switch goes down, an alternative or fail-over path needs to be created. In addition, with certain frames, both the source and/or destination FC_IDs may be defined in the payload. A mechanism that identifies and translates these IDs must therefore be provided. This solution also does not work if encryption or a proprietary protocol is used between the source and destination end devices because there is no way for the border Switches to process the proprietary payloads or de-crypt the frames to identify the source and destination FC_IDs.
A Fibre Channel Switch and Fabric is needed which enables end devices in different Fabrics to communicate with one another while retaining their unique Fibre Channel Domain_IDs.
To achieve the foregoing, and in accordance with the purpose of the present invention, a Switch is disclosed which enables end devices in different Fabrics to communicate with one another while retaining their unique Fibre Channel Domain_IDs. The Switch is coupled to a first fabric having a first set of end devices and a second fabric having a second set of end devices. The Switch is configured to enable communication by the first set of end devices associated with the first fabric with the second set of end devices associated with the second fabric using the unique Domain_IDs of each of the first set and the second set of end devices. In one embodiment of the invention, the first and second fabrics are first and second Virtual Storage Area Networks (VSANs) respectively. In an alternative embodiment, the first fabric and the second fabric are separate physical fabrics.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be obvious, however, to one skilled in the art, that the present invention may be practiced without some or all of these specific details. In other instances, well known process steps have not been described in detail in order not to unnecessarily obscure the present invention.
In a Fibre Channel SAN, the main services provided by the fabric include: Dynamic Address Allocation, Routing, Name Service Zone Service, and event notification. The present invention relates to Inter-VSAN and/or Inter-Fabric routing using unique Domain_IDs. Terminology specific to the present invention and defined herein includes:
Referring to
With the present invention, the end devices pWWN1 and pWWN4 can communicate with one another while retaining their respective FC_ID addresses. This is accomplished through the Border Switch B1 that straddles both VSANs. In a single step process, packets originating from end device pWWN1 are injected from VSAN 102 to VSAN 104 and pWWN4, and vice-versa, through the border Switch B1.
It should be noted that as used herein, the term “Fabric” generally implies a single physical Fabric that is divided into separate Virtual SANs. The two VSANs 102 and 104 as illustrated in
The Inter-VSAN routing using unique Domain_IDs of the present invention initially requires an administrator to define one or more Inter-VSANs and the end devices that can communicate with one another in the Fabric. After the Fabric is configured, the Border Switches: (i) exchange the Inter-VSAN routing protocol (IVRP) messages with the other Border Switches in the fabric in order to determine the topology and shortest paths to the different VSANs. In the absence of a routing protocol, a static configuration is needed to decide the set of VSANs that must be transited by frames from an origination Edge VSAN to a terminating Edge VSAN; (ii) exchange Fabric Shortest Path First (FSPF) information between the neighbor Switches in each VSAN and the neighbor VSANs. Specifically, Border Switches inject routes into either Transit VSANs; and/or Edge VSANs connected to the Border Switch; (iii) propagate FSPF updates between the Edge and Transit VSANs only if the updates affect routes and link cost to any of the exported Domain_IDs; (iv) exchange zoning information with its neighbor Switches on linkup; (v) exchange name server databases with its neighbor Switches. Only those entries in the Inter-VSAN zone relevant to a VSAN are exchanged across VSANs; (vi) proxy as the name server for each switch in a remote Edge VSAN for queries received from Switches in the local VSAN; (vii) translates the VSAN of a frame received from an Edge VSAN to the Transit VSAN for outbound traffic and conversely translates the VSAN of a received frame from the Transit VSAN to the appropriate Edge VSAN; and (viii) terminates all control traffic including FSPF, zone server, and name server in the adjacent Edge VSAN. Each of the functions performed by the Border Switches is defined in more detail below.
Referring to
The Transit VSAN 12 switches traffic from the disconnected Edge VSAN pairs 1-3 and 2-3 and vice-versa. The link between the Switches B and C can be according to various embodiments a standard FC link or remote (e.g., FCIP, FC over DWDM, etc) link. The transit VSAN 12 is similar to any other VSAN and can potentially have its own end devices attached to it. The Transit VSAN 12 does not care about the nature of the neighbor Edge VSANs that it is switching traffic either to or from. In other words, a transit VSAN can switch traffic to or from another transit VSAN.
Referring to
Referring to
The EISL CRC value differs or is a modification of a standard CRC value calculated for a regular ISL frame due to the corresponding longer length of the EISL frame 30 with the appended EISL header field 34. The EOF field 40 delineates the end of the frame 30.
Referring to
Priority field 50 indicate the user priority of the EISL frame 30. Priority may be defined in a number of ways. As one example, the user priority may be a generic numeric priority, without a guaranteed level of service. For instance, higher values represent higher user priority while lower values may represent lower priority. Higher priorities receive available bandwidth first, regardless of how much total bandwidth is available. As another example, the user priority may indicate a quality of service (QoS) of the payload of the EISL frame. Generally, the width of the Priority field 50 depends on the priority type and/or the number of priority levels.
The VSAN identifier field 52 or “tag” is used to identify the frame 30 as belonging to a particular VSAN. More particularly, the VSAN identifier field 52 identifies the payload of the EISL frame 30 as belonging to a particular VSAN. In accordance with one embodiment, the VSAN identifier field 412 is a twelve-bit wide field. The format of the identifier may be identical to or similar to VLAN identifiers as well as similar to addresses employed in certain standard protocols such as Ethernet.
In some SANs, there may be topology as well as routing problems that could cause a frame to traverse a loop within the network. Such a loop will consume bandwidth unnecessarily. In order to address this problem, a Time To Live (TTL) field 54 may be used to indicate a TTL value specifying the number of remaining hops that can be traversed before the frame is dropped. The TTL value inserted into field 54 is initialized by the network device (e.g., a Switch) that generates the EISL frame 30. A TTL default value is initially set to an arbitrary number, for example sixteen. With each hop, subsequent network devices (e.g., Switches) receiving the EISL frame decrement the TTL value by one. A TTL value of one indicates to the receiving network device (e.g., Switch) that the EISL frame should be dropped. When the EISL frame is dropped, an error message may be sent to the intended recipient of the frame as well as to the sender of the frame. Similarly, a TTL value of 0 may indicate that the TTL field 54 should be ignored, allowing the EISL frame to be forwarded by the switch.
On a link carrying multiple VSANs, Switches communicate using frames 30. Each frame 30 also includes, in addition to the above, the Fibre Channel addresses (FC_IDs) of the source and destination end devices. The VSAN ID 52 qualifies a particular frame 30 as belonging to a particular VSAN, transparent to the end devices. For more information on the switching of frames 30 within a VSAN, see the aforementioned parent application.
Referring to
Using the inter-VSAN zone, Border Switches decide: (i) the content of the name server database that is exported into the Transit VSAN from the adjacent Edge VSAN and vice versa; (ii) the set of FSPF domains to export in Link State Update (LSU) messages; (iii) the set of addresses to switch from adjacent Edge VSANs to Transit VSANs and vice versa; (iv) the set of adjacent Edge VSANs to which SW_RSCNs received from a Transit VSAN are propagated; (v) the set of SW_RSCNs received from adjacent Edge VSANs to propagate into the Transit VSAN. In other words, the Inter-VSAN zone is the point from which the import and export data and control traffic occurs. Since zone configuration is a well known concept, the configuration of Inter-VSAN routing via Inter-VSAN zones simplifies management and administration in the Fabric.
Similar to a regular zone in a VSAN, Inter-VSAN zones are contained within a zoneset and there is an active zoneset. The Border Switches thus determine the import and export traffic from the Inter-VSAN zones in the active zoneset.
In a typical SAN, a number of protocols are implemented when a link is established between two Switches. These include the Port Manager; Domain Manager; Zone Server; Fabric Shortest Path First (FSPF); Name_Server; and Switch Register State Change Notification (SW_RSCN) protocols, as described in the above-referenced NCITS documents. The aforementioned protocols have been modified for Inter-VSAN routing as contemplated with the present invention as described below.
Port Manager Protocol: The Port manager protocol negotiates parameters between two Switches and determines if the link is an Inter-Switch Link (ISL) or an Extended Inter-Switch Link (EISL). If the link is EISL, then it means that the link is capable of carrying VSAN frames. Otherwise, the Port Manager protocol operates the same with VSANs as with a regular SAN.
Domain Manager Protocol: The Domain Manager Protocol is responsible for the allocation of Domain_IDs and/or Fibre Channel addresses (FC_ID) for each Switch, Host and storage device in the SAN. As noted above, a FC_ID includes three components, a Domain_ID, an Area_ID, and a Port_ID. During initialization, a Principal Switch is selected for the SAN. The Principal Switch is responsible for assigning a Domain_ID for each Switch. Each Switch is then responsible for selecting the Area_ID and Port_ID for each end device connected to that Switch.
According to the present invention, the domain number space must be unique across the VSANs that are going to communicate with one another. There are a number of ways in which this uniqueness can be maintained, including: (i) administratively partitioning the domain number space across the VSANs; or (ii) associate a set of Domain_IDs to be used only for Inter-VSAN routing. For example, Domain_IDs between 200-239 (or any other arbitrary range) can be dedicated for VSAN routing. A Switch that needed to communicate across VSANs could administratively be configured to request Domain_IDs in the dedicated number space range.
Zone Server Protocol: In a standard SAN, the Zone Server Protocol is responsible for creating and maintaining a database within each Switch that defines each zone in the SAN. The zones in the table are defined in terms of the Host(s) and storage device(s) in each zone. A Host and/or storage device can belong to multiple zones. To ensure a consistent zoning database across a SAN, when an ISL link comes up between two switches, the zone database is exchanged between the switches to ensure consistency and to prevent conflicting zone definitions. If there are no conflicts, the zone databases are merged. If there are conflicts, the link is isolated and no data traffic can flow through that link until the conflicts are resolved. As part of the zone server protocol, whenever a zone is added, deleted or modified, the changes are propagated throughout the Fabric.
To support Inter-VSAN routing, the Zone Server Protocol is modified to accommodate Inter-VSAN zones having members in different VSANs. Further, existing mechanisms or new mechanisms can be devised to ensure consistency of inter-VSAN zones. Since VSANS are terminated at the border switches, intra-domain zones are not propagated to the Transit VSAN.
Fabric Shortest Path First (FSPF) Protocol: The FSPF is a link state path selection protocol. FSPF keeps track of the state of the links on all the Switches in the Fabric and associates the cost with each link. The protocol computes paths from each Switch to all the other Switches in the Fabric by adding the cost of all the links traversed by the path, and choosing or selecting the path that minimizes the cost. The collection of the link state records (LSR's) (including the cost) of all the Switches in the Fabric constitutes the topology database of the Fabric, called the Link State Database.
The FSPF protocol has four major components, including: (i) a “Hello” protocol used to establish connectivity between neighbor Switches, to establish the identity of neighbor Switches, and to exchange FSPF parameters and capabilities between the neighbor Switches; (ii) a replicated fabric topology or Link State Database, with protocols and mechanisms to keep the databases synchronized across the Fabric; (iii) a path computation algorithm; and (iv) a routing table update.
The Link State Database synchronization in turn consists of two major components, an initial database synchronization and an update mechanism. The initial database synchronization is used when a Switch is initialized or when an inter-Switch Link (ISL) comes up. The update mechanism is used when either (i) there is a link state change, for example when an ISL goes up or down; or (ii) on a periodic basis, to prevent Switches from deleting topology information from the database.
With the FSPF protocol, the term “path selection” indicates the lowest cost or “best” path between a source and destination in the Fabric. The term “routing” indicates the actual forwarding of frames to a specific destination. FSPF performs hop-by-hop routing, which means that a Switch in the Fabric only needs to know the next hop on the best path to the destination. The replicated topology database insures that every Switch in the Fabric has the same definition of the Fabric, and therefore, all the Switches will make consistent routing decisions. Typically, a Switch needs to know, for each destination domain in the Fabric, which path should be used to route a frame to a domain. A routing table entry therefore requires at a minimum a destination Domain_ID and an E_Port to which frames are forwarded.
Since the FSPF protocol is contained within a VSAN, in order to support routing for domains that are in other VSANs, the following modifications are implemented:
For each Domain_ID of a device that is part of an inter-VSAN zone, a border switch considers the Domain_ID for announcement into the adjacent VSANs. An adjacent VSAN may be a transit VSAN or an edge VSAN. A thus selected Domain ID is announced into an adjacent VSAN if either that VSAN is a transit VSAN or there is a device in the VSAN that is part of the same inter-VSAN zone.
In addition to this, a border switch rewrites the VSAN of a frame that is being routed across VSANs to that of the adjacent VSAN. So, for frames being routed from an edge VSAN to a transit VSAN, a border switch rewrites the VSAN from the edge VSAN to the transit VSAN.
Referring to
Name Server Protocol: With the Name Server Protocol, each Switch exchanges information regarding its locally attached end devices with the other Switches in the SAN. The information that is exchanged for each end device includes the world wide name (pWWN), the Fibre Channel address (FC_ID), the type of protocol (SCSI, IP, etc.) the end device supports, and if the end device is an initiator (i.e., a Host) or a target (i.e., a storage device).
To support Inter-VSAN routing, the changes to the name server on a Border Switch are: (i) build the list of name server entries to be exported to a Transit VSAN or Edge VSAN. This list is created from the defined Inter-VSAN zones, and (ii) terminate and proxy name server queries for the domains associated with the remote domain and respond on behalf of the name server of the queried Switch.
Referring again to
SW_RSCNs are exchanged between switches whenever the name server database changes. The change is usually due to a change in the state of a locally connected port, a locally connected switch or to the zone server database. SW_RSCNs are originated by the Switch detecting the change and sent to every other Switch in the VSAN. The SW_RSCN contains information about the affected end devices or Domain_ID (Domain_ID is used when changes affect the entire switch as specified in the FC-MI Technical Report, incorporated by reference herein for all purposes. This information includes the port WWN of the end device and its FC_ID. An SW_RSCN can contain notification about multiple end devices.
With Inter-VSAN routing, changes in one VSAN must be propagated to other VSANs if the change affects a device in an Inter-VSAN zone. Consider the topology in
The replication of SW_RSCN frames can be prevented by selecting a single Switch to be responsible for distributing SW_RSCN from one VSAN to another. The selection of such a switch can be done in multiple ways, for example, either: (i) statically configured by a system administrator; (ii) selecting the principal Switch in a VSAN to be designated as the Switch for distributing SW_RSCNs; (iii) the border switches can then announce the SW_RSCN from an adjacent VSAN to only the principal switch which then distributes the SW_RSCN within its VSAN or (iv) one of the Border Switches can be selected based on some scheme such as shortest path to the VSAN for which it is advertising, the switch with the highest “switch WWN” etc. Regardless of the responsible Switch, each switch receiving a SW_RSCN notifies registered end hosts of the change as per normal RSCN rules.
When the transits VSANs are the same, in order to have pWWN1 communicate with pWWN3, an Inter-VSAN zone is defined containing the two devices. There must be one or more links connecting switches S2 and S3 that carry the Transit VSAN traffic. If the link between the switches is not direct, all the switches in the path between S2 and S3 must carry the transit VSAN.
When the transit VSANs are not the same, the Inter-VSAN zones must be defined such that frames can be switched from one Transit VSAN to the other. In
Referring to
The embodiments of the present invention described above are to be considered as illustrative and not restrictive. The various change commands described herein are only exemplary and any other types of commands may be used. The invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.
This Application is a Continuation under U.S. 35 §120 to patent application Ser. No. 12/343,843 filed Dec. 24, 2008, now U.S. Pat. No. 7,876,711, entitled “A Fibre Channel Switch That Enables End Devices In Different Fabrics To Communicate With One Another While Retaining Their Unique Fibre Channel Domain_IDs,” all of which is incorporated herein for all purposes by this reference.
Number | Name | Date | Kind |
---|---|---|---|
5428471 | McDermott | Jun 1995 | A |
5506838 | Flanagan | Apr 1996 | A |
5617421 | Chin et al. | Apr 1997 | A |
5619497 | Gallagher et al. | Apr 1997 | A |
5675741 | Aggarwal et al. | Oct 1997 | A |
5682479 | Newhall et al. | Oct 1997 | A |
5708659 | Rostoker et al. | Jan 1998 | A |
5740159 | Ahmad et al. | Apr 1998 | A |
5740171 | Mazzola et al. | Apr 1998 | A |
5742604 | Edsall et al. | Apr 1998 | A |
5764636 | Edsall | Jun 1998 | A |
5793976 | Chen et al. | Aug 1998 | A |
5805924 | Stoevhase | Sep 1998 | A |
5809285 | Hilland | Sep 1998 | A |
5818603 | Motoyama | Oct 1998 | A |
5819112 | Kusters | Oct 1998 | A |
5862125 | Russ | Jan 1999 | A |
5959972 | Hamami | Sep 1999 | A |
5959990 | Frantz et al. | Sep 1999 | A |
5964841 | Rekhter | Oct 1999 | A |
5999930 | Wolff | Dec 1999 | A |
6035105 | McCloghrie et al. | Mar 2000 | A |
6046985 | Aldred | Apr 2000 | A |
6101497 | Ofek | Aug 2000 | A |
6160813 | Banks et al. | Dec 2000 | A |
6188668 | Brewer et al. | Feb 2001 | B1 |
6188694 | Fine et al. | Feb 2001 | B1 |
6202135 | Kedem et al. | Mar 2001 | B1 |
6205488 | Casey et al. | Mar 2001 | B1 |
6208623 | Rochberger et al. | Mar 2001 | B1 |
6208649 | Kloth | Mar 2001 | B1 |
6209059 | Ofer et al. | Mar 2001 | B1 |
6219699 | McCloghrie et al. | Apr 2001 | B1 |
6226771 | Hilla et al. | May 2001 | B1 |
6243358 | Monin | Jun 2001 | B1 |
6260120 | Blumenau et al. | Jul 2001 | B1 |
6262977 | Seaman et al. | Jul 2001 | B1 |
6266705 | Ullum et al. | Jul 2001 | B1 |
6269381 | St. Pierre et al. | Jul 2001 | B1 |
6269431 | Dunham | Jul 2001 | B1 |
6295296 | Tappan | Sep 2001 | B1 |
6295575 | Blumenau et al. | Sep 2001 | B1 |
6310884 | Odenwald, Jr. | Oct 2001 | B1 |
6330614 | Aggarwal et al. | Dec 2001 | B1 |
6337861 | Rosen | Jan 2002 | B1 |
6388995 | Gai et al. | May 2002 | B1 |
6401128 | Stai et al. | Jun 2002 | B1 |
6408001 | Chuah et al. | Jun 2002 | B1 |
6426952 | Francis et al. | Jul 2002 | B1 |
6438612 | Ylonen et al. | Aug 2002 | B1 |
6473421 | Tappan | Oct 2002 | B1 |
6493349 | Casey | Dec 2002 | B1 |
6529963 | Fredin et al. | Mar 2003 | B1 |
6532212 | Soloway et al. | Mar 2003 | B1 |
6597663 | Rekhter | Jul 2003 | B1 |
6604407 | Kano | Aug 2003 | B2 |
6643287 | Callon et al. | Nov 2003 | B1 |
6661773 | Pelissier et al. | Dec 2003 | B1 |
6674760 | Walrand et al. | Jan 2004 | B1 |
6728220 | Behzadi | Apr 2004 | B2 |
6728848 | Tamura et al. | Apr 2004 | B2 |
6766482 | Yip et al. | Jul 2004 | B1 |
6775230 | Watanabe et al. | Aug 2004 | B1 |
6804776 | Lothberg et al. | Oct 2004 | B1 |
6848007 | Reynolds et al. | Jan 2005 | B1 |
6859435 | Lee et al. | Feb 2005 | B1 |
6879560 | Cahn | Apr 2005 | B1 |
6904053 | Berman | Jun 2005 | B1 |
6915358 | Horton et al. | Jul 2005 | B2 |
6920133 | Boodaghians | Jul 2005 | B1 |
6920153 | Ellis et al. | Jul 2005 | B2 |
6920154 | Achler | Jul 2005 | B1 |
6947379 | Gleichauf et al. | Sep 2005 | B1 |
6959151 | Cotter et al. | Oct 2005 | B1 |
6975589 | Luft et al. | Dec 2005 | B2 |
6985490 | Czeiger et al. | Jan 2006 | B2 |
6993593 | Iwata | Jan 2006 | B2 |
7006525 | Jha | Feb 2006 | B1 |
7026288 | Judice et al. | Apr 2006 | B2 |
7027406 | Shabtay et al. | Apr 2006 | B1 |
7046679 | Sampath et al. | May 2006 | B2 |
7050392 | Valdevit | May 2006 | B2 |
7054304 | Wang | May 2006 | B2 |
7061858 | Di Benedetto et al. | Jun 2006 | B1 |
7072298 | Paul et al. | Jul 2006 | B2 |
7076594 | Benedetto et al. | Jul 2006 | B2 |
7079544 | Wakayama et al. | Jul 2006 | B2 |
7082140 | Hass et al. | Jul 2006 | B1 |
7085846 | Jenne et al. | Aug 2006 | B2 |
7155494 | Czeiger et al. | Dec 2006 | B2 |
7161935 | Alonso et al. | Jan 2007 | B2 |
7206288 | Cometto et al. | Apr 2007 | B2 |
7216158 | Revanuru et al. | May 2007 | B2 |
7221652 | Singh et al. | May 2007 | B1 |
7275103 | Thrasher et al. | Sep 2007 | B1 |
7301898 | Martin | Nov 2007 | B1 |
7302494 | Hayashi et al. | Nov 2007 | B2 |
7319669 | Kunz et al. | Jan 2008 | B1 |
7328260 | Muthiyan et al. | Feb 2008 | B1 |
7330892 | Ibrahim | Feb 2008 | B2 |
7355983 | Scudder et al. | Apr 2008 | B2 |
7366194 | Yu et al. | Apr 2008 | B2 |
7376755 | Pandya | May 2008 | B2 |
7406034 | Cometto et al. | Jul 2008 | B1 |
7433326 | Desai et al. | Oct 2008 | B2 |
7443799 | Varanasi et al. | Oct 2008 | B2 |
7447224 | Dropp et al. | Nov 2008 | B2 |
7499410 | Dutt et al. | Mar 2009 | B2 |
7586947 | Miki et al. | Sep 2009 | B2 |
7593324 | Jain et al. | Sep 2009 | B2 |
7599360 | Edsall et al. | Oct 2009 | B2 |
7616637 | Lee et al. | Nov 2009 | B1 |
7649844 | Bector et al. | Jan 2010 | B2 |
8060630 | Jancaitis et al. | Nov 2011 | B1 |
20010020254 | Blumenau et al. | Sep 2001 | A1 |
20010049739 | Wakayama et al. | Dec 2001 | A1 |
20020009081 | Sampath et al. | Jan 2002 | A1 |
20020034178 | Schmidt et al. | Mar 2002 | A1 |
20020075873 | Lindhorst-Ko et al. | Jun 2002 | A1 |
20020085493 | Pekkala et al. | Jul 2002 | A1 |
20020101868 | Clear et al. | Aug 2002 | A1 |
20020110125 | Banks et al. | Aug 2002 | A1 |
20020133740 | Oldfield et al. | Sep 2002 | A1 |
20020150039 | Valdevit et al. | Oct 2002 | A1 |
20020152338 | Elliott et al. | Oct 2002 | A1 |
20020156918 | Valdevit et al. | Oct 2002 | A1 |
20020156924 | Czeiger et al. | Oct 2002 | A1 |
20020176434 | Yu et al. | Nov 2002 | A1 |
20020188754 | Foster et al. | Dec 2002 | A1 |
20030012204 | Czeiger et al. | Jan 2003 | A1 |
20030016624 | Bare | Jan 2003 | A1 |
20030067925 | Choe et al. | Apr 2003 | A1 |
20030101239 | Ishizaki | May 2003 | A1 |
20030107987 | Kinstler | Jun 2003 | A1 |
20030118053 | Edsall et al. | Jun 2003 | A1 |
20030142628 | Alonso et al. | Jul 2003 | A1 |
20030145116 | Moroney et al. | Jul 2003 | A1 |
20030149848 | Ibrahim et al. | Aug 2003 | A1 |
20030163727 | Hammons et al. | Aug 2003 | A1 |
20030189929 | Matsuzaki et al. | Oct 2003 | A1 |
20030198247 | Gardner et al. | Oct 2003 | A1 |
20040028060 | Kang | Feb 2004 | A1 |
20040085908 | Balasubramanian et al. | May 2004 | A1 |
20040100910 | Desai et al. | May 2004 | A1 |
20040151174 | Del Signore et al. | Aug 2004 | A1 |
20040151188 | Maveli et al. | Aug 2004 | A1 |
20040230787 | Blumenau et al. | Nov 2004 | A1 |
20040233921 | Krieg et al. | Nov 2004 | A1 |
20050018606 | Dropps et al. | Jan 2005 | A1 |
20050018663 | Dropps et al. | Jan 2005 | A1 |
20050018701 | Dropps | Jan 2005 | A1 |
20050036499 | Dutt et al. | Feb 2005 | A1 |
20050080903 | Valenci | Apr 2005 | A1 |
20050088969 | Carlsen et al. | Apr 2005 | A1 |
20050108444 | Flauaus | May 2005 | A1 |
20050117562 | Wrenn | Jun 2005 | A1 |
20050177634 | Scudder et al. | Aug 2005 | A1 |
20050249123 | Finn | Nov 2005 | A1 |
20050267965 | Heller | Dec 2005 | A1 |
20060034302 | Peterson | Feb 2006 | A1 |
20060038263 | Eigner et al. | Feb 2006 | A1 |
20060087963 | Jain et al. | Apr 2006 | A1 |
20060092932 | Ghosh et al. | May 2006 | A1 |
20060117212 | Meyer et al. | Jun 2006 | A1 |
20060153186 | Bector | Jul 2006 | A1 |
20060159081 | Dropps | Jul 2006 | A1 |
20070153816 | Cometto et al. | Jul 2007 | A1 |
20080028096 | Henderson et al. | Jan 2008 | A1 |
20080316942 | Desai et al. | Dec 2008 | A1 |
20100008375 | Lee et al. | Jan 2010 | A1 |
Number | Date | Country |
---|---|---|
0772121 | May 1997 | EP |
0858036 | Aug 1998 | EP |
1134938 | Sep 2001 | EP |
1187406 | Mar 2002 | EP |
2-20944 | Aug 1990 | JP |
08111693 | Apr 1996 | JP |
10-293633 | Nov 1998 | JP |
2000-22699 | Feb 2000 | JP |
2001-154929 | Jun 2001 | JP |
2001-320420 | Nov 2001 | JP |
2001-345865 | Dec 2001 | JP |
2001-0083125 | Jan 2001 | KR |
WO 0031925 | Jun 2000 | WO |
WO 0119027 | Mar 2001 | WO |
0169834 | Sep 2001 | WO |
WO 0195565 | Dec 2001 | WO |
WO0271224 | Dec 2002 | WO |
Entry |
---|
“Fibre Channel Switch Fabric-2 (FC-SW-2)”, Jun. 26, 2001; NCITS; Rev 5.4; pp. 1-206. |
ATM Forum Committee, Chapter 10, Flush Message Protcol Procedures and Frame Formats,: Lan Emulation Over ATM Version 2—LUNI Specification, Af-Lane-0084.000, Jul. 1997, pp. 111-115. |
Cisco Systems, Inc. (1992-2003), “Cisco MDS 9000 Family of Multilayer Directors and Fabric Switches,” pp. 1-4. |
Cisco Systems, Inc. (1992-2003), “Cisco SAN-OS,” pp. 1-7. |
Cisco Systems, Inc. (1992-2004), “Cisco SAN-OS Reference Guide,” pp. 1-13. |
Cometto et al. (Apr. 1, 2002), “Methods and Apparatus for Fibre Channel Frame Delivery,” U.S. Appl. No. 10/114,568. |
Cometto et al., Allowed Claims for U.S. Appl. No. 10/170,855. |
Cometto et al., Notice of Allowance for U.S. Appl. No. 10/170,855. |
Desanti, “Extended—Headers,” VF N—Port Model T11/04-627v1, 1 page, Oct. 2004. |
Desanti, “Virtual Fabrics N—Port Support,” VF N—Support, T11/04-494v2, 14 pages, Oct. 2004. |
Desanti (Oct. 2004), “Virtual Fabrics Switch Support”, VF Switch Support, T11/04-395v3, 15 pages. |
Desanti (Apr. 2003), “Virtual Fabrics,” T11/03-220v0, 11 pages (Microsoft PowerPoint presentation). |
Desanti (Jul. 2004), “Virtual Fabrics N—Port Support,” VF N—Support, T11/04-49v0, 13 pages. |
Desanti et al. (May 2003), “Tagged Frame Specification,” Tagged Frame Spec., T11/03-353v0, 4 pages. |
D1: Yasumori Takizawa, “Technology Scope IP Storage Disk Divided by IP Network Wide Area Ethernet Encouraging the Same,” Nikkei Communication, Mar. 4, 2000, No. 361, pp. 106-113. |
D2: Glenn Sulllivan, “Building of Long Distance SAN,” UNIX Magazine, Apr. 1, 2000, vol. a6, No. 4, pp. 133-137. |
D4: Fujita, et al., “SSE98-225 QoS Control Using MPLS over ATM,” Technical Report of IEICE, Mar. 19, 1999, vol. 98, No. 668, pp. 81-86. |
Guan et al. (May 30, 2003), “Inter-fabric FC Architecture,” Brocade—The Intelligent Platform for Network Storage. |
IEEE Std 802.3-2002, Chapter 43.5 Marker Protcol, Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Detection (CSMA/CD Access Method and Physical Layer Specifications, 2002, pp. 329-345. |
Kiiskila, “Implementation of LAN Emulation of ATM in Linux,” Tampereen Teknillinen Korkeakoulu, Oct. 1996, 57 pages. |
Lee et al. (4/12002), “Label Switching in Fibre Channel Networks,” U.S. Appl. No. 10/114,394. |
Listanti et al. (Sep. 2000), “Architectural and Technological Issues for Future Optical Internet Networks,” Optical Solutions for Next-Generation Internet Networks, IEEE Communication Magazine. |
Mearian et al., “What's After Fibre Channel?,” ComputerWorld (webprint), XP002246206. |
Mills, “Network Working Group Request for Comments 1059, Network Time Protocol (Version 1) Specification and Implementation,” University of Delaware, pp. 1-50, Jul. 1988. |
Monia, “iFCP—A Protocol for Internet Fibre Channel Storage Networking” Nishan Systems (webprint), P002246205, Dec. 12, 2000. |
Monia et al., “iFCP—A Protocol for Internet Fibre Channel Storage Networking,” Feb. 2002. |
NCITS , “Fibre Channel Generic Services-3 (FC-GS-3),” working draft, Nov. 28, 2000. |
NCITS, “Fibre Channel Switch Fabric-3 (FC-SW-3),” working draft (XP002300830 (A,B,C)), Feb. 29, 2003. |
NCITS, “Fibre Channel Switch Fabric-2 (FC-SW-2).” working draft, Jun. 26, 2001. |
Rajagopal et al., “IP and ARP Over Fibre Channel,” Request for Comments: 2625 (webprint), XP002246207, Jun. 30, 1999. |
Rangan, “Re: FCIP/1FCP: Gurantee In-Order delivery for FC N/NL—ports,” IP Storage—Mailing List Archive (http://www.pdl.emu/edu/mailinglists/ips/mail/msg03069.html webprint), Sep. 4, 2001. |
Rosen et al. (Jan. 2001), “Multiprotocol Label Switching Architecture,” Network Working Group, RFC 3031, XP002251364. |
Valdevit, “Fabric Shortest Path First Version (FSPF) Rv. 0.2”, Fabric Shortest Path (http://t11.org/index.htm webprint), XP002959525, May 23, 2000. |
White, RFC 2925, IBM Corp, Sep. 2000. |
Fabric Shortest Path First (FSPF) Project 1508-D Switch Fabric -3 Rev. 6.5, (http://t11/org/index.htm webprint), pp. 117-140 (Oct. 31, 2003). |
AU Office Action (Mar. 16, 2007) from AU Patent Application No. 2002364204. |
AU Office Action (May 23, 2007) from AU Patent Application No. 2003226093. |
AU Office Action dated May 30, 2007 from AU Patent Application No. 2003226022. |
AU Office Action, Application No. 2003245492, mailed Oct. 4, 2007. |
AU Examination Report, Application No. 2003296301, mailed Jul. 14, 2008. |
CN Office Action (Dec. 1, 2006) from CN Patent Application No. 02828262.0. |
CN Office Action (Mar. 7, 2008) from CN Patent Application No. 03807560.1 |
CN Office Action (Sep. 8, 2006) from CN Patent Application No. 03807600.4. |
CN Office Action (Jun. 22, 2007) from CN Application No. 03813264.8. |
EP Office Action (Jan. 18, 2005) from EP Patent Application No. 02799279.1-1525. |
EP Office Action (Oct. 18, 2005) from EP Patent Application No. 02799279.1-1525. |
EP Office Action (Feb. 20, 2006) from EP Patent Application No. 02799279.1-1525. |
EP Office Action (Mar. 28, 2007) from EP Patent Application No. 03746053.2-2416. |
EP Office Action (Apr. 5, 2006) from EP Patent Application No. 03739 127.3-2416. |
EP Search Report (Feb. 10, 2006) from EP Patent Application No. 03746053.2-2416. |
EP Search Report (Mar. 28, 2007) from EP Patent Application No. 03746053.2-2416. |
EP Search Report (May 19, 2005) from EP Patent Application No. 03746062.3-1249. |
EP Search Report (Apr. 5, 2006) from EP Patent Application No. 03 739 127.3-2416. |
US Office Action (Oct. 17, 2006) from U.S. Appl. No. 10/114,394. |
Japanese Application No. 2003-559086, Office Action dated May 19, 2008. |
Japanese Application No. 2003-582973, Office Action dated Jun. 2, 2008. |
Japanese Application No. 2003-582964, Office Action dated May 12, 2008. |
US Office Action (Aug. 22, 2005) from U.S. Appl. No. 10/034,160. |
US Final Office Action (Dec. 13, 2005) from U.S. Appl. No. 10/034,160. |
U.S. Office Action (Jul. 30, 2007) from related U.S. Appl. No. 10/034,160. |
US Office Action (Feb. 23, 2007) from U.S. Appl. No. 10/430,491. |
US Final Office Action (Aug. 9, 2007) from U.S. Appl. No. 10/430,491. |
U.S. Appl. No. 10/430,491 Notice of Allowance, Nov. 23, 2007. |
U.S. Appl. No. 10/430,491 Notice of Allowance, Apr. 23, 2008. |
U.S. Appl. No. 10/430,491 Notice of Allowance, Aug. 8, 2008. |
U.S. Appl. No. 10/430,491 Supplemental Notice of Allowance, Aug. 26, 2008. |
US Office Action (Feb. 5, 2007) from U.S. Appl. No. 10/034,160. |
US Office Action (Nov. 19, 2008) from U.S. Appl. No. 10/034,160. |
US Office Action (Mar. 28, 2007) from U.S. Appl. No. 10/609,442. |
US Final Office Action (Sep. 5, 2007) from U.S. Appl. No. 10/609,442. |
US Office Action (Mar. 28, 2008) from U.S. Appl. No. 10/609,442. |
US Office Action (Mar. 28, 2007) from U.S. Appl. No. 10/791,143. |
US Office Action (Apr. 4, 2007) from U.S. Appl. No. 10/114,394. |
US Office Action (Feb. 6, 2008) from U.S. Appl. No. 10/114,394. |
US Office Action (Apr. 6, 2007) from U.S. Appl. No. 10/114,568. |
US Office Action (May 22, 2006) from U.S. Appl. No. 10/114,568. |
US Office Action (May 22, 2006) from U.S. Appl. No. 10/170,855. |
Notice of Allowance (Dec. 6, 2006) from U.S. Appl. No. 10/170,855. |
US Office Action (May 31, 2006) from U.S. Appl. No. 10/034,160. |
US Office Action (Sep. 26, 2006) from U.S. Appl. No. 10/034,160. |
US Office Action (Jan. 29, 2008) from U.S. Appl. No. 10/034,160. |
WO Search Report (May 23, 2003) from International Patent Application No. PCT/US02/41072. |
WO Search Report (Oct. 17, 2003) from International Patent Application No. PCT/US03/09328. |
WO Search Report (Jul. 15, 2003) from International Patent Application No. PCT/US03/09442. |
WO Search Report (Nov. 4, 2003) from International Patent Application No. PCT/US03/18765. |
WO Search Report (Jul. 12, 2004) from International Patent Application No. PCT/US03/36452. |
WO Written Opinion (Oct. 25, 2006) from International Patent Application No. PCT/US05/37763. |
Armitage, Grenville, “MPLS: The Magic Behind the Myths,” Jan. 2000, IEEE Communications Magazine, pp. 124-131. XP000908346. |
U.S. Office Action dated Oct. 23, 2006 from related U.S. Appl. No. 10/114,568. |
U.S. Final Office Action dated Sep. 20, 2007 from related U.S. Appl. No. 10/114,568. |
U.S. Appl. No. 10/114,568 Notice of Allowance mailed Mar. 26, 2008. |
U.S. Appl. No. 10/114,568 Allowed claims, Mar. 26, 2008. |
Brocade Communication Systems, Inc. “Optimizing the performance and management of 2Gbit/sec SAN fabrics with ISL trunking”, White paper, Online!, Mar. 2002. |
Brocade Communication Systems, Inc. “Increasing Intelligence with the SAN Fabric”, White paper, Online!, Jun. 2001 XP002251362. |
Molero et al., “On the effect of link failure in fibre channel sotrage area networks”, Parallel Architectures, Algorithms and Networks 2000, I-Span 2000 Proceedings, Int'l Symposium, Dec. 7-9, 2000. |
U.S. Office Action dated Aug. 22, 2007 from related U.S. Appl. No. 10/114,394. |
U.S. Final Office Action mailed Sep. 20, 2007. |
U.S. Appl. No. 10/114,394, Final Office Action mailed Aug. 21, 2008. |
U.S. Appl. No. 10/034,160, Office Action mailed Nov. 19, 2008. |
U.S. Appl. No. 10/974,368 Office Action mailed Sep. 10, 2007. |
U.S. Appl. No. 10/974,368 Notice of Allowance mailed May 1, 2008. |
U.S. Appl. No. 10/974,368 Office Action mailed Sep. 12, 2008. |
U.S. Appl. No. 10/979,886 Office Action mailed Nov. 25, 2008. |
U.S. Appl. No. 10/979,886 Office Action mailed May 13, 2008. |
U.S. Appl. No. 11/027,252, Final Office Action mailed Aug. 7, 2008. |
U.S. Appl. No. 11/027,252 Office Action mailed Oct. 29, 2007. |
U.S. Appl No. 11/027,252 Office Action mailed Dec. 12, 2008. |
White Paper, Link Aggregation According to IEEE Standard 802.3ad, Oct. 10, 2002, v. 1.10, pp. 1-21. |
Notice of Allowance dated May 29, 2009 from U.S. Appl. No. 10/034,160. |
Second Office Action issued on Apr. 28, 2009 for Canadian Patent Application No. 2,472,056. |
EP Office Action dated May 30, 2006 from related EP Application No. 02799279.1-1525. |
Notification of Provisional Rejection issued on Apr. 15, 2009 for KR Patent Application No. 2004-7010143. |
Canadian Office Action issued on Jan. 30, 2008 for Patent Application No. 2,480,461. |
Chinese Office Action issued on Dec. 26, 2008 for Patent Application No. 03807560.1. |
Japanese Office Action dated Dec. 22, 2008 from related JP Application No. 2003-582973. |
Japanese Office Action issued on May 25, 2009 for Patent Application No. 2003-582964. |
Canadian Office Action issued on Aug. 13, 2008 for Patent Application No. 2,480,462. |
Chinese Office Action, Chinese Patent Application No. 03807600.4, Issued May 8, 2009. |
Office Action mailed for U.S. Appl. No. 10/114,394, Mar. 23, 2009. |
Notice of Allowance dated Jun. 25, 2009 from U.S. Appl. No. 10/114,394. |
U.S. Appl. No. 11/713,341 filed on Mar. 2, 2007. |
Second Office Action issued on Apr. 24, 2009 for Chinese Patent Application No. 200380104466.6. |
U.S Office Action mailed Aug. 18, 2009 in U.S. Appl. No. 12/202,004. |
USPTO Notice of Allowance for U.S. Appl. No. 10/609,442, mailed Sep. 26, 2008. |
Office Action for AU Patent Application No. 20043000680, dated Sep. 26, 2008. |
Office Action for CA Patent Application No. 2,521,463 dated Sep. 24, 2008. |
Canadian Office Action mailed Jun. 17, 2009 in Application No. 2,472,056. |
Chinese Office Action for Patent Application No. 200480010826.0, dated Nov. 7, 2008. |
U.S. Appl. No. 10/974,368, Notice of Allowance dated Apr. 21, 2009. |
U.S. Office Action dated Jul. 10, 2009 from U.S. Appl. No. 10/979,886. |
Notice of Allowance dated Jun. 26, 2009 from U.S. Appl. No. 11/027,252. |
M. Rajagopal, R. et al., “Fibre Channel Over TCP/IP” DRAFT-IETF-IPS-FCOVERTCPIP-06.TXT, Mar. 1, 2002, pp. 1-46, XP015021184. |
Monia, et al., “iFCP—A Protocol for Internet Fibre Channel Storage”, DRAFT-MONIA-IPS-IFCP-01.TXT, Jan. 1, 2001, pp. 1-48, XP01502633. |
International Preliminary Examination Report dated Aug. 7, 2003 issued to PCT/US02/41072. |
PCT Written Opinion dated Oct. 27, 2004 from corresponding PCT/US2004/020518. |
International Preliminary Report on Patentability dated Jan. 12, 2006 from corresponding PCT Application No. PCT/US2004/020518. |
PCT International Preliminary Report on Patentability dated May 10, 2007 from related PCT/US05/037763. |
CA Second Office Action dated May 11, 2009 for Canadian Application No. 2,480,462. |
CA Third Office Action dated Feb. 8, 2010 for Canadian Application No. 2,480,462. |
CA Third Office Action dated Apr. 30, 2010 for Canadian Application No. 2,521,463. |
CN Third Office Action mailed Aug. 28, 2009 for Application No. 03807600.4. |
CN Fourth Office Action mailed Feb. 5, 2010 for Application No. 03807600.4. |
CN Second Office Action dated Oct. 16, 2009 for Application No. 03813264.8. |
CN Third Office Action dated Nov. 20, 2009 for Application No. 200380104466.6. |
EP Office Action dated Oct. 8, 2009 from related EP Application No. 03746053.2-2416. |
EP Office Action dated Feb. 9, 2010 from related EP Application No. 03746062.3-1249. |
JP Office Action mailed Jul. 27, 2009 for Japanese Application No. 2003-582973. |
KR Notification of Provisional Rejection dated Sep. 18, 2009 issued for KR Patent Application No. 2004-7015587 as stated in the letter from Kim and Cho dated Sep. 29, 2009. |
KR Notification of Provisional Rejection dated Oct. 22, 2009 for Application No. 2004-7015583 as stated in the letter from Kim and Cho dated Oct. 28, 2009. |
U.S. Notice of Allowance issued Jul. 7, 2010 from related U.S. Appl. No. 11/713,341. |
U.S. Office Action dated Feb. 17, 2010 from related U.S. Appl. No. 12/202,004. |
U.S. Notice of Allowance dated Feb. 13, 2009 from related U.S. Appl. No. 10/974,368. |
U.S. Office Action dated Jan. 29, 2010 from related U.S. Appl. No. 10/979,886. |
U.S. Notice of Allowance mailed Nov. 9, 2009 from related U.S. Appl. No. 11/027,252. |
U.S. Notice of Allowance dated Jul. 26, 2010 from related U.S. Appl. No. 10/979,886. |
U.S. Office Action dated Oct. 1, 2010, U.S. Appl. No. 12/566,013. |
CA patent application No. 2,472,056, Office Action mailed Aug. 13, 2008. |
CA patent application No. 2,487,071, Office Action mailed Jun. 15, 2006. |
CA patent application No. 2,487,071, Notice of Allowance mailed Sep. 10, 2007. |
CN patent application No. 200580034140.X, Office Action mailed Jun. 6, 2008. |
CN patent application No. 200380104466.6, Office Action mailed Sep. 5, 2008. |
CN patent application No. 200380104466.6, Office Action mailed Apr. 24, 2009. |
CN patent application No. 200380104466.6, Office Action mailed Nov. 20, 2009. |
CN patent application No. 200380104466.6, Notice of Grant mailed Apr. 20, 2010. |
CN patent application No. 200480010826.0, Office Action mailed Nov. 7, 2008. |
EP patent application No. 04756162.6, Office Action mailed Jan. 26, 2012. |
EP patent application No. 03746053.2, Office Action mailed Oct. 1, 2007. |
EP patent application No. 03746053.2, Office Action mailed Oct. 8, 2009. |
EP patent application No. 03789766.7, Office Action mailed Nov. 6, 2007. |
WO patent application No. PCT/US05/44726, Written Opinion mailed Sep. 25, 2006. |
CN patent application No. 201010141491.3, Office Action mailed Dec. 21, 2010. |
CN patent application No. 201010141491.3, Office Action mailed Jun. 9, 2011. |
CN patent application No. 201010141491.3, Notice of Grant mailed Sep. 27, 2011. |
Number | Date | Country | |
---|---|---|---|
20110090816 A1 | Apr 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12343843 | Dec 2008 | US |
Child | 12975072 | US | |
Parent | 10609442 | Jun 2003 | US |
Child | 12343843 | US |