1. Field of the Invention
The present invention relates to fibre channel networks. More specifically, the present invention relates to methods and apparatus for label switching in fibre channel networks.
2. Description of Related Art
In connectionless networks such as packet-switched networks, label switching has conventionally been used to allow for various features. However, it has been difficult to extend label switching into fibre channel network because of particular characteristics of fibre channel networks.
It is therefore desirable to provide methods and apparatus for using label switching in fibre channel networks not only to allow faster access to routing table entries, but also to generally improve fibre channel frame delivery.
Methods and apparatus are provided for label switched routing in fibre channel networks. Techniques are provided for implementing label switching based on particular characteristics of fibre channel networks. By using label switching, mechanisms such as traffic engineering, security, and tunneling through networks that do not support fibre channel frames can be implemented.
These and other features and advantages of the present invention will be presented in more detail in the following specification of the invention and the accompanying figures, which illustrate by way of example the principles of the invention.
The invention may best be understood by reference to the following description taken in conjunction with the accompanying drawings, which are illustrative of specific embodiments of the present invention.
Reference will now be made in detail to some specific embodiments of the invention including the best modes contemplated by the inventors for carrying out the invention. Examples of these specific embodiments are illustrated in the accompanying drawings. While the invention is described in conjunction with these specific embodiments, it will be understood that it is not intended to limit the invention to the described embodiments. On the contrary, it is intended to cover alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims.
Methods and apparatus of the present invention provide for label switching of fibre channel frames. According to various embodiments, fibre channel frames include label stacks that allow fibre channel frames to be tunneled through networks that do not support fibre channel frames and rerouted around downed links. Fibre channel frames can also be delivered in order using label switching. In a typical connectionless fibre channel network such as a class two or class three fibre channel network, a packet travels from one network entity to the next network entity based on an independent forwarding decision at each switch. The next hop for a frame is determined based on information including a destination address in the frame header. In a label switching domain, however, label switching routers make forwarding decisions based not on the destination address in the frame header but instead based on label information associated with a frame. No analysis of the packet header or frame header is needed at each hop.
Instead, the label in the packet or frame is used to index an entry in a forwarding table that contains the next hop information and a set of one or more new labels to be used as the packet is forwarded. The next hop can then use a new label to forward the frame. Although label switching was originally developed in TCP/IP networks to simplify access to routing table entries, the techniques of the present invention contemplate using label switching in fibre channel networks to enable features such has traffic engineering, tunneling, and in order delivery in addition to facilitating routing table access. Label switching as Multiprotocol Label Switching (MPLS) for IP networks is described in RFC 3031.
Several obstacles prevent the implementation of label switching in fibre channel networks. One obstacle is that some fibre channel devices require that fibre channel frames be delivered in order. Label switching used in TCP/IP networks often can deliver packets out of order. However, network entities in TCP/IP networks can handle out of order packets. Destination nodes typically reorder packets received out of sequence. Some fibre channel devices, however, can not handle out of order frames. Furthermore, fibre channel frames do not have a mechanism for carrying labels.
Using label switching however, an edge label switching router 111 adds a label to the frame from switch 101. The label can then be used at a subsequent hop, core label switching router 113, to access a routing table to again determine where to transmit the frame. Instead of using the destination address at router 113, a label is used at router 113 to access a forwarding entry. When a label switching router is connected to a label unaware switch, the label switching router is referred to herein as an edge label switching router. Any device that does not support the use of labels for forwarding decisions is referred to herein as a label unaware switch. The edge label switching router can be an ingress label switching router when it handles traffic entering into the label switching domain. The edge label switching router can be an egress label switching router when it handles traffic leaving the label switching domain. In one example where a frame is transmitted from switch 101 to switch 105, edge label switching router 111 would be the ingress label switching router while edge label switching router 121 would be the egress label switching router. It should be noted that some label switching routers could be core and edge label switching routers.
The label switching routers connected to other label switching enabled routers are referred to herein as core label switching routers. According to various embodiments, all the incoming packets or frames received at core label switching routers include labels. Consequently, core label switching routers only need to look at the incoming label in order to make the forwarding decision. According to other embodiments, some incoming packets or frames received at a core label switching router do not include labels. Consequently, some packets and frames are switched without the use of labels.
It should be noted that a switch can be both a core label switching router and an edge label switching router. Edge label switching router 121 is connected to label switching router 117 and 119 while it is connected to label unaware router 105 and label unaware storage device 107.
According to specific embodiments, the label switching header 207 includes a stack of 32-bit words. Each label includes a 20-bit label for accessing an entry in a routing table, a 3-bit experimental field, a 1-bit EOS field, and an 8-bit time-to-live (TTL) field. The label value is used at a label switching router to determine the next hop, the stack bit is used to indicate that the bottom of a stack of labels has been reached. It should be noted that the label switching header can include more than one label. The time-to-live field is decremented at each hop like the time-to-live field in a conventional TCP/IP packet.
Although the label switching header described above is included between an EISL header and a fibre channel header 207, it should be noted that a label switching header can be included in a variety of different fields associated with the frame. For example, a label switching header can be included in a frame that does not include an EISL header 203. In this example, the label switching indicator can be provided in a fibre channel header 211, and label switching information can be included in the fibre channel payload. However, it should be noted that a label switching indicator and label switching information can instead be included in an extended fibre channel header.
According to various embodiments, a LIB with routing table information includes entries pairing a destination identifier with a next hop. That is, the routing tables include a destination identifier column 303 and a next hop column 305. To support label switching, an in or incoming label column in 301 as well as an out or outgoing label column 307 is included. When a frame is received, a label can be used to access an entry in the routing table corresponding to the label in the frame. In one example, if the label in the frame is 2000, the switch recognizes that the next hop is switch 43 and the out label should be 3000. In this example the destination ID is not used to determine the next hop.
In still other examples, the number of labels to push or pop and a determination of which labels to insert can be made not only using the destination ID, but also by policies that are configured in the switch. Some policies include the port number and source and destination pair. It should be noted that routing tables are provided on a per virtual network basis (virtual storage area network (VSAN) or virtual local area network (VLAN)). That is, a routing table is available for each VSAN/VLAN the label switching router is a part of. A SAN (or a VSAN) may be a network such as an Infiniband network.
A variety of techniques can be used for generating a LIB. In one embodiment, a LIB is generated upon the receipt of link state update packets under the FSPF protocol. According to other embodiments, a LIB is generated upon receiving augmented link state update packets. Link state packets with additional information such as bandwidth availability allowing traffic engineering are referred to herein as augmented link state update packets. A LIB can be generated periodically or upon the identification of a change in link state. According to various embodiments, a newly generated LIB is associated with an incarnation number. A combination of all the incarnation numbers in a fibre channel fabric is herein referred to as a topology version number. Using a topology version number can allow for in order delivery of fibre channel frames. Using a topology version number to allow for in order delivery is described in concurrently filed U.S. patent application Ser. No. 10/114,568 by Maurilio Cometto and Scott S. Lee and titled Methods and Apparatus For Fibre Channel Frame Delivery, the entirety of which is incorporated by reference for all purposes.
In one embodiment, every time a new routing table is generated at a switch, the incarnation number is incremented by one. According to various embodiments, each label switching router in a fibre channel network not only generates new forwarding routes toward each destination, but each label switching router also generates new in labels different from the previous set of in labels.
The augmented link state update packets can be used to generate conventional routing tables and/or LIBs. Packets received at a label switching router can then be routed to a next hop by using labels instead of next hop information in a routing table. Alternatively, packets can be forwarded to a next hop using label information in place of routing table information. Accordingly, label switching routers can be implemented without routing tables entirely. However, augmented link state update packets can also be used to traffic engineer and select routes not found using conventional routing table mechanisms. In one example, a traffic engineered route may forward a received next packet to a different next hop than a routing table would. Furthermore, augmented link state update packets can be used to specify a route from a source to a destination, whereas routing table information can only specify a next hop.
According to various embodiments, a source label switching router determines the best route to a particular destination. The source then sends a frame explicitly routed to each hop between the source and the destination on the selected route. A mechanism such as Resource Reservation Protocol (RSVP-TE) can be used to configure routes. RSVP-TE is described in RFC 3209, the entirety of which is incorporated by reference for all purposes.
In one example, a tunnel established is a virtual private network or VPN tunnel. In another embodiment the tunnel established is an IP tunnel. At 407, the ingress label switching router receives a response message corresponding to the tunnel set up message sent at 405. According to various embodiments, the response to the tunnel set up message originated from the destination. At 409, the label provided in the response message is programmed into the LIB.
Once a tunnel is established, label switching operations may vary based on whether a label switch is an ingress label switching router, a core label switching router, or an egress label switching router.
At 507, the number of labels and the labels to be pushed onto the label stack are determined. Any mechanism for holding labels and information associated with labels is referred to herein as a label stack. A label stack can be a stack, a linked list, an array, or any structure containing label information. The frame is then modified at 509 to include the one or more labels. Modifying the frame can include updating an EISL header to show that a label is available and placing the label information into a label header.
According to various embodiments, the label switching routers in the TCP/IP network 655 only operate on the topmost label 675 and do not need to access any other labels in the label stack. Accordingly, the entities in the TCP/IP network 655 do not need to be aware that the fibre channel frame is being tunneled through the TCP/IP network 655. Instead, the TCP/IP network entities merely forward frames through the network based on the topmost label.
Unlike conventional TCP/IP networks, fibre channel frames cannot be delivered out of sequence. Accordingly, a control word 671 including a sequence number is included after the label stack, or beneath second label 673, so that the gateway 657 can detect packets arriving out of sequence. It should be noted that a control word can be included in different fields in the fibre channel frame, such as in the fibre channel header. Any mechanism allowing a fibre channel gateway to detect out of order fibre channel frames after transmission through a non fibre channel network is referred to herein as a control word.
Also unlike conventional TCP/IP networks, fibre channel network frames are typically not allowed to be dropped for performance reasons. Techniques of the present invention contemplates a gateway 657 detecting that frames from gateway 653 were dropped and requesting retransmission in order to provide for efficient frame delivery. It should be noted that by tunneling using labels, security can also be provided by using network protocols such as Virtual Private Network or VPN.
The downed link between label switching router 783 and label switching router 789 is bypassed. It should be noted that traffic engineering using label switching can be implemented in a variety of different manners. In one example, a system administrator can manually set up alternative routes at a label switching router 783. A switch 783 is manually configured to replace a label stack with a value of 10 with a label stack with a top label value of 100 and a second label value of 20. Link state information can also be passed into the network automatically.
Although the techniques of the present invention can be used to provide features such as fast failover, explicit source routing, and traffic engineering as noted above, the techniques of the present invention can also be used to provide for in order delivery.
In addition to containing the destination address, a frame includes as a destination identifier an input label that allows a switch to quickly access an entry in a routing table. For example, a label switching router 804 can receive a frame with a destination of 2 and an in label of 420. The label switching router 804 can access its routing table 814 to recognize that the next hop is label switching router 802 and the output should be 220. According to various embodiments, the label switching router 804 replaces the frame label value of 420 corresponding to the in label in the routing table with a frame label of 220 corresponding to the out label in the routing table 814.
By replacing the label value, the label switching router 804 provides label information to the next hop router 802, to allow the label switching router 802 to similarly access a routing table entry quickly. It should be noted that although label switching can be provided for fast access of entries in a routing table, label switching can be used for a variety of reasons. The techniques of the present invention provide that frames can be delivered in order by using labels.
When a label switching router 802 receives a frame from label switching router 804, the label switching router uses the label 220 to access an entry in the routing table 812. Using the in label 220, the label switching router 802 recognizes that the frame no longer needs to be forwarded, as the frame has actually arrived at its destination.
As described above, label switching may be performed in a variety of network devices. According to various embodiments, the switch includes a processor, network interfaces, and memory for maintaining LIBs. A variety of input and output ports, Media Access Control (MAC) blocks, and buffers can also be provided as will be appreciated by one of skill in the art.
In addition, although an exemplary switch is described, the above-described embodiments may be implemented in a variety of network devices (e.g., servers) as well as in a variety of non-transitory mediums. For instance, instructions and data for implementing the above-described invention may be stored on a disk drive, a hard drive, a floppy disk, a server computer, or a remotely networked computer. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and 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.
The present application is a continuation of and claims priority under 35 U.S.C. §120 to U.S. patent application Ser. No. 10/114,394 by Scott S. Lee, Dinesh G. Dutt, and Thomas J. Edsall and titled Label Switching In Fibre Channel Networks, filed Apr. 1, 2004, now issued U.S. Pat. No. 7,616,637, issued Nov. 10, 2009, the entirety of which is incorporated by reference for all purposes. The present application is related to U.S. patent application Ser. No. 10/114,568 by Maurilio Cometto and Scott S. Lee and titled Methods and Apparatus For Fibre Channel Frame Delivery, filed Apr. 1, 2004, now issued U.S. Pat. No. 7,406,034, issued Jul. 29, 2008, the entirety of which is incorporated by reference for all purposes.
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 |
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 |
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 |
6535489 | Merchant 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 |
7006525 | Jha | Feb 2006 | B1 |
7026288 | Judice et al. | Apr 2006 | B2 |
7027406 | Shabtay et al. | Apr 2006 | B1 |
7046679 | Sampath | 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 | 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 et al. | 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 | Dropps | 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 |
7830809 | Cometto et al. | Nov 2010 | B2 |
7876711 | Dutt et al. | Jan 2011 | B2 |
7916628 | Ghosh et al. | Mar 2011 | B2 |
7990975 | Dropps et al. | Aug 2011 | B1 |
8072988 | Dropps et al. | Dec 2011 | B2 |
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 |
20030084219 | Yao et al. | May 2003 | A1 |
20030101239 | Ishizaki | May 2003 | A1 |
20030107987 | Kinstler | Jun 2003 | A1 |
20030118053 | Edsall et al. | Jun 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 |
20030208618 | Mor et al. | Nov 2003 | A1 |
20040028060 | Kang | Feb 2004 | A1 |
20040100910 | Desai et al. | May 2004 | A1 |
20040151174 | Del Signore et al. | Aug 2004 | A1 |
20040151188 | Maveli et al. | Aug 2004 | A1 |
20040210656 | Beck et al. | Oct 2004 | A1 |
20040230787 | Blumenau et al. | Nov 2004 | A1 |
20040233921 | Krieg et al. | Nov 2004 | A1 |
20050018606 | Dropps | Jan 2005 | A1 |
20050018663 | Dropps | 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 |
20050169188 | Cometto et al. | Aug 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 |
20090141657 | Dutt et al. | Jun 2009 | 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-209044 | 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 | Aug 2001 | KR |
WO0031925 | Jun 2000 | WO |
WO0119027 | Mar 2001 | WO |
WO0169834 | Sep 2001 | WO |
WO0195565 | Dec 2001 | WO |
WO02071224 | Dec 2002 | WO |
Entry |
---|
“Fibre Channel Switch Fabric-3 (FC-SW-3)”, NCITS working draft, Feb. 19, 2003. XP002300830 (A,B,C). |
Guan et al., Inter-fabric FC Architecture, May 30, 2003, Brocade—The Intelligent Platform for Network Storage. |
“Fibre Channel Switch Fabric-2 (FC-SW-2)”, NCITS working draft, Jun. 26, 2001. |
Fibre Channel Generic Services-3 (FC-GS-3), NCITS working draft, Nov. 28, 2000. |
K. White, IBM Corp, RFC 2925, Sep. 2000. |
Armitage, Grenville, “MPLS: The Magic Behind the Myths,” Jan. 2000, IEEE Communications Magazine, pp. 124-131. XP000908346. |
Listanti et al., “Architectural and Technological Issues for Future Optical Internet Networks”, Optical Solutions for Next-Generation Internet Networks, IEEE Communication Magazine, Sep. 2000. |
Cisco Systems, “Cisco SAN-OS Reference Guide”, 1992-2004 Cisco Systems, Inc. pp. 1-13. |
Cisco Systems, “Cisco SAN-OS”, 1992-2003 Cisco Systems, Inc. pp. 1-7. |
Cisco Systems, “Cisco MDS 9000 Family of Multilayer Directors and Fabric Switches”, 1992-2003 Cisco Systems, Inc., pp. 1-4. |
Ezio Valdevit, http://t11.org/index.htm, “Fabric Shortest Path First Version (FSPF) Rv. 0.2”, Fabric shortest Path, May 23, 2000 XP002959525. |
http://t11/org/index.htm, Fabric Shortest Path First (FSPF) Project 1508-D Switch Fabric-3 Rev. 6.5, Oct. 31, 2003, pp. 117-140. |
DeSanti et al., “Tagged Frame Specification,” Tagged Frame Spec., T11/03-353v0, May 2003, 4 pages. |
Claudio DeSanti, “Virtual Fabrics”, T11/03-220v0, PowerPoint presentation, Apr. 2003, 11 pages. |
Claudio DeSanti, “Virtual Fabrics N—Port Support”, VF N—Support, T11/04-49v0, Jul. 2004, 13 pages. |
Claudio DeSanti, “Extended—Headers”, VF N—Port Model, T11/04-627v1, Oct. 2004, 1 page. |
Claudio DeSanti, “Virtual Fabrics Switch Support”, VF Switch Support, T11/04-395v3, Oct. 2004, 15 pages. |
Claudio DeSanti, “Virtual Fabrics N—Port Support”, VF N—Support, T11/04-494v2, Oct. 2004, 14 pages. |
Brocade Communication Systems, Inc. “Increasing Intelligence with the SAN Fabric”, White paper, Online!, Jun. 2001 XP002251362. |
Brocade Communication Systems, Inc. “Optimizing the performance and management of 2Gbit/sec SAN fabrics with ISL trunking”, White paper, Online!, Mar. 2002. |
Rosen et al., “Multiprotocol Label Switching Architecture”, Network working group, RFC 3031, Jan. 2001 XP002251364. |
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. |
VenKat Rangan: “Re: FCIP/1FCP: Gurantee In-Order delivery for FC N/NL—ports”, IP Storage—Mailing List Archive, Online! http://www.pdl.cmu/edu/mailinglists/ips/mail/msg03069.html Sep. 4, 2001. |
D. Mills, Network Working Group Request for Comments 1059, Network Time Protocol (Version 1) Specifiction and Implementation, University of Delaware, Jul. 1988, pp. 1-50. |
M. Rajagopal, R. et al., “IP and ARP Over Fibre Channel” Request for Comments: 2625, ′Online!, Jun. 30, 1999, XP002246207. |
Charles Monia: “iFCP—A Protocol for Internet Fibre Channel Storage Networking” Nishan Systems, ′Online!, Dec. 12, 2000, XP002246205. |
Mearian et al., “What's After Fibre Channel?”, Computerworld, ″Online!, Oct. 15, 2001, XP002246206. |
Monia et al., “iFCP—A Protocol for Internet Fibre Channel Storage Networking” Feb. 2002. |
ATM Forum Committee, Chapter 10, “Flush Message Protocol Procedures and Frame Formats,” Lan Emulation Over ATM Version 2—LUNI Specification, AF-Lane-0084.000, Jul. 1997, pp. 111-115. |
White Paper, Link Aggregation According to IEEE Standard 802.3ad, Oct. 10, 2002, v.1.10, pp. 1-21. |
Kiiskilä, Marko, “Implementation of LAN Emulation of ATM in Linux,” Tampereen Teknillinen Korkeakoulu, Oct. 1996, 57 pages. |
IEEE STD 802.3-2002, Chapter 43.5 Marker Protocol, Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifications, 2002, pp. 329-345. |
D1: Yasumori Takizawa, “Technology Scope IP Storage Disk Divided by IP Network Wide Area Ethernet Encouraging the Same,” Nikkei Communication, Mar. 4, 200, No. 361, pp. 106-113. |
D2: Glenn Sullivan, “Building of Long Distance SAN”, UNIX Magazine, Apr. 1, 2000, vol. 15, 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. |
Non-Final Office Action dated Aug. 22, 2005 from related U.S. Appl. No. 10/034,160. |
Final Office Action dated Dec. 13, 2005 from related U.S. Appl. No. 10/034,160. |
Non-Final Office Action dated May 31, 2006 from related U.S. Appl. No. 10/034,160. |
Non-Final Office Action dated Sep. 26, 2006 from related U.S. Appl. No. 10/034,160. |
Final Office Action dated Feb. 5, 2007 from related U.S. Appl. No. 10/034,160. |
Non-Final Office Action dated Jul. 30, 2007 from related U.S. Appl. No. 10/034,160. |
U.S. Final Office Action dated Jan. 29, 2008 from related U.S. Appl. No. 10/034,160. |
Non-Final Office Action datedNov. 18, 2008 from related U.S. Appl. No. 10/034,160. |
U.S. Office Action dated May 22, 2006 from related U.S. Appl. No. 10/114,568. |
U.S. Office Action dated Oct. 23, 2006 from related U.S. Appl. No. 10/114,568. |
U.S. Office Action dated Apr. 6, 2007 from related U.S. Appl. No. 10/114,568. |
Final Office Action mailed Sep. 20, 2007. |
U.S. Appl. No. 10/114,568, Notice of Allowance mailed Mar. 26, 2008. |
U.S. Appl. No. 10/114,568, Allowed claims. |
U.S. Office Action dated Oct. 17, 2006 from related U.S. Appl. No. 10/114,394. |
Final Office Action mailed Apr. 4, 2007 from related U.S. Appl. No. 10/114,394. |
U.S. Office Action dated Aug. 22, 2007 from related U.S. Appl. No. 10/114,394. |
U.S. Appl. No. 10/114,394, Office Action mailed Feb. 6, 2008. |
U.S. Appl. No. 10/114,394, Final Office Action mailed Aug. 21, 2008. |
Office Action mailed for U.S. Appl. No. 10/114,394, Mar. 23, 2009. |
U.S. Office Action dated May 22, 2006 from related U.S. Appl. No. 10/170,855. |
Notice of Allowance issued Dec. 6, 2006 for U.S. Appl. No. 10/170,855. |
Cometto et al., Allowed Claims for U.S. Appl. No. 10/170,855. |
U.S. Office Action dated Feb. 23, 2007 from related U.S. Appl. No. 10/430,491. |
U.S. Final Office Action dated Aug. 9, 2007 from related U.S. Appl. No. 10/430,491. |
Notice of Allowance for U.S. Appl. No. 10/430,491 dated Nov. 23, 2007. |
Notice of Allowance for U.S. Appl. No. 10/430,491 dated Apr. 23, 2008. |
Notice of Allowance for U.S. Appl. No. 10/430,491 dated Aug. 8, 2008. |
Supplemental Notice of Allowance for U.S. Appl. No. 10/430,491 dated Aug. 26, 2008. |
Allowed claims for U.S. Appl. No. 10/430,491. |
U.S. Office Action U.S. Appl. No. 10/609,442, mailed Mar. 28, 2007. |
U.S. Final Office Action U.S. Appl. No. 10/609,442, mailed Sep. 5, 2007. |
U.S. Office Action U.S. Appl. No. 10/609,442, mailed Mar. 28, 2008. |
USPTO Notice of Allowance U.S. Appl. No. 10/609,442, mailed Sep. 26, 2008. |
U.S. Office Action dated Mar. 28, 2007 from related U.S. Appl. No. 10/791,143. |
U.S. Appl. No. 10/974,368, Office Action dated Sep. 10, 2007. |
U.S. Appl. No. 10/974,368, Notice of Allowance dated May 1, 2008. |
U.S. Appl. No. 10/974,368, Office Action dated Sep. 12, 2008. |
US Office Action dated May 13, 2008 in related U.S. Appl. No. 10/979,886. |
US Office Action dated Nov. 25, 2008 in related U.S. Appl. No. 10/979,886. |
U.S. Appl. No. 11/027,252, Office Action mailed Oct. 29, 2007. |
U.S. Appl. No. 11/027,252, Final Office Action mailed Aug. 7, 2008. |
U.S. Appl. No. 11/027,252, Office Action mailed Dec. 12, 2008. |
PCT International Search Report mailed May 23, 2003 from related PCT/US02/41072, 5 pages. |
Intl. Search Report, PCT/US03/09328 mailed Oct. 17, 2003. |
International Search Report from related PCT Application No. PCT/US03/09442, mailed Jul. 15, 2003 4 pages. |
International Search Report mailed Nov. 4, 2003 from related PCT Application No. PCT/US03/18765 3 pages. |
PCT International Search Report mailed Jul. 12, 2004 from PCT Application No. PCT/US03/36452. |
PCT International Search Report dated Oct. 27, 2004 from related PCT/US2004/020518. |
PCT International Search Report mailed Oct. 25, 2006 from PCT Application No. PCT/US05/37763. |
PCT Written Opinion dated Oct. 25, 2006 from related PCT/US05/37763. |
PCT International Preliminary Report on Patentability dated Dec. 29, 2004 from related PCT/US05/044726. |
EP Office Action dated Jan. 18, 2005 from related EP Application No. 02799279.1-1525. |
EP Office Action dated Oct. 18, 2005 from related EP Application No. 02799279.1-1525. |
EP Office Action dated Feb. 20, 2006 from related EP Application No. 02799279.1-1525. |
EP Office Action dated May 30, 2006 from related EP Application No. 02799279.1-1525. |
EPO Search Report dated Feb. 10, 2006, from related EP Application No. 03746053.2-2416. |
EP Office Action dated Oct. 1, 2007 from related EP Application No. 03746053.2-2416. |
EP Office Action dated Mar. 28, 2007 from related EP Application No. 03746053.2-2416. |
EPO Search Report dated May 19, 2005 from related EP Application No. 03 746062.3-1249. |
EP Office Action dated Apr. 5, 2006 from related EP Application No. 03 739 127.3-2416. |
EP Office Action Application No. 03789766.7, mailed Nov. 6, 2007. |
Australian Office Action dated Mar. 16, 2007 from related AU Application No. 2002364204. |
Australian Office Action dated May 30, 2007 from related AU Application No. 2003226022. |
Australian Office Action dated May 23, 2007 from related AU Application No. 2003226093. |
Australian Office Action dated Oct. 4, 2007 from related Australian Application No. 2003245492. |
Examination Report dated Jul. 14, 2008 from Australian Patent Application No. 2003296301. |
CA Office Action 2,487,071, dated Jun. 15, 2006. |
China Office Action issued Dec. 1, 2006 from related China Application No. 02828262.0. |
China Office Action dated Mar. 7, 2008 from related China Application No. 03807560.1. |
Chinese Office Action, Chinese Patent Application No. 03807600.4, Issued Sep. 8, 2006. |
China Office Action dated Jun. 22, 2007 from related China Application No. 03813264.8. |
Office Action for CN Patent Application No. 200480010826.0, dated Oct. 19, 2007. |
CN Office Action 200580034140.X, dated Jun. 6, 2008. |
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-582973, Office Action dated Dec. 22, 2008. |
Japanese Application No. 2003-582964, Office Action dated May 12, 2008. |
Lee et al., “Label Switching in Fibre Channel Networks” U.S. Appl. No. 10/114,394, filed Apr. 1, 2002. |
Canadian Office Action dated Aug. 13, 2008 from related CA Application No. 2,472,056, 2 pgs. |
Office Action issued on Sep. 5, 2008 for CN Patent Application No. 200380104466.6. |
U.S. Office Action dated Nov. 19, 2008 from U.S. Appl. No. 10/034,160. |
Office Action issued on Dec. 26, 2008 for CN Patent Application No. 03807560.1. |
U.S. Office Action dated Nov. 25, 2008 from U.S. Appl. No. 10/979,886. |
U.S. Office Action dated Jul. 10, 2009 from U.S. Appl. No. 10/979,886. |
Office Action issued on Aug. 13, 2008 for Canadian Patent Application No. 2,480,462. |
U.S. Appl. No. 10/974,368, Notice of Allowance dated Feb. 13, 2009. |
U.S. Appl. No. 12/343,843, filed Dec. 24, 2008. |
Office Action issued on Jan. 30, 2008 for Canadian Patent Application No. 2,480,461. |
Office Action for CN Patent Application No. 200480010826.0, dated Nov. 7, 2008. |
Office Action for AU Patent Application No. 20043000650, dated Sep. 26, 2008. |
Office Action for CA Patent Application No. 2,521,463 dated Sep. 24, 2008. |
Notification of Provisional Rejection issued on Apr. 15, 2009 for KR Patent Application No. 2004-7010143. |
Second Office Action issued on Apr. 28, 2009 for Canadian Patent Application No. 2,472,056. |
Second Office Action issued on Apr. 24, 2009 for Chinese Patent Application No. 200380104466.6. |
Chinese Office Action, Chinese Patent Application No. 03807600.4, Issued May 8, 2009. |
U.S. Appl. No. 10/974,368, Notice of Allowance dated Apr. 21, 2009. |
Allowed Claims for U.S. Appl. No. 10/974,368. |
Notice of Allowance dated May 29, 2009 from U.S. Appl. No. 10/034,160. |
Allowed Claims for U.S. Appl. No. 10/034,160. |
Notice of Allowance dated Jun. 25, 2009 from U.S. Appl. No. 10/114,394. |
Allowed Claims for U.S. Appl. No. 10/114,394. |
Notice of Allowance dated Jun. 26, 2009 from U.S. Appl. No. 11/027,252. |
Allowed Claims for U.S. Appl. No. 11/027,252. |
U.S Office Action mailed Aug. 18, 2009 in U.S. Appl. No. 12/202,004. |
Japanese Office Action issued on May 25, 2009 for Patent Application No. 2003-582964. |
Canadian Office Action mailed Jun. 17, 2009 in Application No. 2,472,056. |
U.S. Appl. No. 11/713,341, filed Mar. 2, 2007. |
Chinese Office Action mailed Aug. 28, 2009 for Application No. 03807600.4. |
Canadian Office Action mailed May 11, 2009 for Application No. T8469284CA. |
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, XP015032633. |
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 1, 2007 from related PCT/US05/037763. |
CA 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 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. 03 746062.3-1249. |
EP Office Action dated Dec. 16, 2010 from related EP Application No. 03 746062.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. Office Action dated Apr. 28, 2010, from related U.S. Appl. No. 12/343,843. |
Notice of Allowance dated Sep. 20, 2010, from related U.S. Appl. No. 12/343,843. |
U.S. Office Action dated Jan. 29, 2010 from related U.S. Appl. No. 10/979,886. |
Notice of Allowance dated Jul. 26, 2010 from related U.S. Appl. No. 10/979,886. |
Notice of Allowance dated Nov. 19, 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. |
CN Office Action dated Dec. 21, 2010 for Application No. 201010141491.3. |
CN Office Action dated Jun. 9, 2011 for Application No. 201010141491.3. |
EP Office Action mailed Mar. 10, 2011 for EP Application No. 05810274.0. |
JP Office Action mailed Apr. 4, 2011 for Japanese Application No. 2009-221174. |
EP Office Action mailed Jan. 26, 2012 for EP Application No. 04756162.6. |
EP Search Report dated Sep. 9, 2011 from related EP Application No. 05853608.7. |
U.S. Office Action dated Dec. 6, 2011 from related U.S. Appl. No. 12/202,004. |
Number | Date | Country | |
---|---|---|---|
20100008375 A1 | Jan 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10114394 | Apr 2004 | US |
Child | 12566013 | US |