US 7,319,669 B1Grant
Method and system for controlling packet flow in networks
Issue Date:2008-01-15
•15 Claims
•5 Drawing Sheets
Abstract
A system and method for transmitting and bundling network packets is provided. The incoming network packet size is determined and if the remote buffer space is sufficient to hold the network packet it is transmitted to the destination port. If the remote buffer space is not enough to hold the network packet it is discarded. The system includes an arbitration module that receives remote buffer space information and transmits the network packet if the remote buffer space has enough space to hold the packet. The arbitration module also determines if a second network packet is from a same source port having a same source virtual lane, and has the same destination virtual lane (bundling conditions). If the second network packet meets the bundling conditions, then it is transmitted after the first network packet, even if other packets were received before the second network packet.
Metadata
Assignee
- QLogic, Corporation
Inventors
- James A. Kunz
- Leonard W. Haseman
- Mark A. Owen
- William J. Gustafson
Application Information
Application Number:US 10/302,149
Filing Date:2002-11-22
Priority Date:2002-11-22
Art Unit:2619
Classifications
IPC:
H04L12/28H04L12/54H04L12/56
Patent Drawings (5 sheets)
Description
Background
[0001] 1. Field of the Invention
[0002] The present invention relates to networks, and more particularly to routing network packets in switches.
[0003] 2. Background of the Invention
[0004] Switches are commonly used in networks. A typical switch routes network packets (may also be referred to herein as “packets”) from one port to another port. Various industry standards and protocols are used to monitor and manage data packet transmission through networks and switches. One such standard is Infiniband published by the Infiniband Trade Association and incorporated herein by reference in its entirety. Infiniband provides an architecture that allows a single unified input/output (I/O) fabric. The standard provides a virtual lane (VL) mechanism that allows network data packets from different sources and bound for different destinations, to flow through a single channel. The standard also describes how data packets are processed for delivery within each virtual lane.
[0005] Switches in networks typically use a central arbitration unit that selects input/out ports for initiating packet transfer. Various algorithms are used by arbitration units for selecting (or not selecting) a particular port for packet transfer.
[0006] Typically, arbitration units arbitrate port “requests” without any knowledge of remote port buffer space and size where the packets are stored after delivery. Hence, in conventional switches, the arbitration unit transfers data packets without knowing how much remote buffer space is available for storing the transferred packet(s). This can result in packet dropping, port stalling and remote buffer overrun.
[0007] In addition, most arbitration units select packets for transmission based on a first in-first out (FIFO) model. This is inefficient if packets are received from the same source and are meant for the same destination using the same virtual lane. In this case, the FIFO model is inefficient because packets with the foregoing conditions should be sent in close proximity to each other rather than waiting to satisfy the FIFO requirements.
[0008] Another drawback in conventional switch fabrics is that packets are accumulated, bundled and then transmitted. This increases latency based on the number of packets.
[0009] Therefore, what is needed is a process and system, such that switches can efficiently transmit packets and also arbitrate and select packets for transmission with minimum packet dropping, port stalling and remote buffer overrun.
Summary of the Invention
[0010] In one aspect of the present invention, a method for transmitting network packets is provided. The method includes, determining a network packet size; determining a remote buffer space size at a destination port where the network packet is to be sent; determining if the remote buffer space size is sufficient to hold the network packet; and then transmitting the network packet to the destination port. If there is not enough remote buffer space to hold the network packet, it may be discarded.
[0011] In another aspect of the present invention, a system for transmitting network packets is provided. The system includes a receiving port that receives the network packet and generates a packet descriptor and packet size descriptor; a transmit port that receives packet tags with packet descriptor and packet size information; and an arbitration module that receives remote buffer space size information and transmits the network packet if the remote buffer space has enough space to hold the packet.
[0012] The system also includes an arbitration priority table that provides priority information regarding virtual lane access in the transmit port to the arbitration module; and a first in first out (FIFO) storage at the transmit port for storing network packet tags.
[0013] In another aspect of the present invention, a system for bundling packets for network transmission is provided. The arbitration module determines if a second network packet is from a same source port having a same source virtual lane and will use the same destination virtual lane. If this is accurate, then the second network packet is transmitted after the first network packet, even if other network packets were received before the second network packet.
[0014] In another aspect of the present invention, a method for bundling network packets is provided. The method includes, determining if a second network packet has a same source of a first network packet; determining if the second network packet has a same source virtual lane as the first network packet; determining if the second network packet has a same destination virtual lane as the first network packet; and transmitting the second network packet after the first network packet even if other network packets received before the second network packet are waiting for transmission.
[0015] In one aspect of the present invention, while a first packet is currently being transmitted, the arbitration unit determines whether to bundle the second packet with the first. This “on-the-fly” packet bundling reduces latency.
[0016] In one aspect of the present invention, remote buffer space is efficiently used and is not overrun because only those packets that can fit the remote buffer space are transmitted. This also prevents port stalling and packet dropping.
[0017] In another aspect of the present invention, network packets are efficiently transmitted because they are bundled together based on certain conditions (e.g. same source, same source virtual lane and same destination virtual lane). This prevents packets to the same destination from waiting in the network queue and reduces latency.
[0018] This brief summary has been provided so that the nature of the invention may be understood quickly. A more complete understanding of the invention can be obtained by reference to the following detailed description of the preferred embodiments thereof concerning the attached drawings.
Brief Description of the Drawings
[0019] The foregoing features and other features of the present invention will now be described with reference to the drawings of a preferred embodiment. In the drawings, the same components have the same reference numerals. The illustrated embodiment is intended to illustrate, but not to limit the invention. The drawings include the following Figures:
[0020] FIG. 1A shows a block diagram of a network using the INFINIBAND standard, according to one aspect of the present invention;
[0021] FIG. 1B shows a block diagram of a switch using the system, according to one aspect of the present invention;
[0022] FIG. 2A shows a block diagram of a network packet structure used according to one aspect of the present invention;
[0023] FIG. 2B shows a block diagram of a local route header in the packet structure of FIG. 2A , used according to one aspect of the present invention;
[0024] FIG. 3 shows another block diagram of a switch with a switch fabric, according to one aspect of the present invention;
[0025] FIG. 4A shows a block diagram of a transmit port, according to one aspect of the present invention;
[0026] FIG. 4B is a block diagram of a virtual lane priority table, according to one aspect of the present invention;
[0027] FIG. 5 shows a block diagram showing an arbitration module, according to one aspect of the present invention;
[0028] FIG. 6 shows a flow diagram for transmitting network packets to avoid remote buffer overrun, according to one aspect of the present invention; and
[0029] FIG. 7 shows a flow diagram for bundling network packets, according to one aspect of the present invention.
Detailed Description of the Preferred Embodiments
[0030] To facilitate an understanding of the preferred embodiment, the general architecture and operation of a network system will be described. The specific architecture and operation of the preferred embodiments will then be described with reference to the general architecture of the network system.
[0031] FIG. 1A shows a block diagram of plural computing devices operationally coupled using the Infiniband architecture as described in the Infiniband standard specification, published by the Infiniband Trade Association.
[0032] FIG. 1A shows system 104 with a fabric 117. Fabric 117 includes plural switches 106, 107, 111 and 112. Switches 106, 107, 111 and 112 may have common or separate functionality's, and can include the adaptive aspects of the present invention, described below. Fabric 117 also includes a router 108 that is coupled to a wide area network 109 and local area network 110.
[0033] Switch 106 is operationally coupled to a RAID storage system 105 and system 102, while system 101 and 103 may be operationally coupled to switch 107.
[0034] Switch 112 may be coupled to a small computer system interface (“SCSI”) SCSI port 113 that is coupled to SCSI based devices. Switch 112 may also be coupled to Ethernet 114, fiber channel device (s) 115 and other device(s) 116.
[0035] It is noteworthy that systems 101-103 may be any computing system with a microprocessor that can be operationally coupled to a network, including one that is based on the Infiniband standard.
[0036] FIG. 1B shows a block diagram of switch 112 that includes a processor 120 which is operationally coupled to plural ports 122, 123, 124 and 125 via a control port 121 and cross-bar 119. In one aspect of the present invention, processor 120 may be a reduced instruction set computer (RISC) type microprocessor. Ports 122-125 may be similar to ports 113-116, respectively.
[0037] Switch 112 may be coupled to a processor 129 that is coupled to Ethernet 127 and serial port 128. In one aspect of the present invention, processor 129 may be included in computing systems 101-103.
[0038] FIG. 2A provides a example of packet structure that may be used in the various adaptive aspects of the present invention. It is noteworthy that this is to illustrate the adaptive aspects of the present invention. Other packet structures may be used with the methods and systems described below.
[0039] Packet 200 includes a local route header 200A, a base transport header (BTH) 200B, packet payload 200C, invariant cyclic redundancy code (CRC), and variant CRC 200E. Packet structure 200 is also described in Infiniband Architecture Specification, Volume 1, Chapter 6, titled “Data Packet Format”, incorporated herein by reference in its entirety.
[0040] FIG. 2B shows a block diagram of local route header (LRH) 200A, where the local route contains the fields for local routing by switches within an InfiniBand subnet (LRH in InfiniBand (Subnet routing) is analogous to FC-2 in Fibre Channel and MAC layer (LAN routing) in Ethernet. In all three cases it is considered Layer 2 routing/switching information). LRH 200A includes a virtual lane (VL) field 201 that identifies which receive buffer and flow control credits should be used for processing a received packet, link version (Lver) field 202 specifies the version of the LRH packet 200A, service level (SL) field 203 is used by switch 112 to determine a transmit VL for a packet, and link next header (LNH) field 205 specifies what header follow the LRH 200A. Field 209 is a reserved field.
[0041] LRH 200A also includes a destination local identifier (DLID) field 206 that specifies the port to which switch 112 delivers the packet and source identifier (SLID) field 207 that indicates the source of the packet. Packet length field 208 specifies the number of words contained in a packet.
[0042] FIG. 3 shows a block diagram of switch 112 with a switch fabric 300 and associated components. Switch fabric 300 is operationally coupled to CPORT 121 and plural ports 305 and 309. It is noteworthy that ports 305 and 309 are similar to ports 122-125.
[0043] Switch fabric 300 includes a packet data crossbar 302, packet request crossbar 303 and packet tag crossbar 304 and a control bus 301.
[0044] Packet data crossbar 302 connects receive ports (306, 310), transmit ports (307,311), and can concurrently transmit plural packets via plural VLs.
[0045] Packet Tag crossbar 303 is used to move plural packet tags from receive ports (306, 310) to transmit ports (307, 311), as described below.
[0046] Packet request crossbar 303 is used by transmit port (307, 311) to request a particular packet from a receive buffer.
[0047] Routing table (RTABLE) 313 is used to map DLID from a LRH 200A to one or more output ports. A forwarding table 314 includes look up tables (LUTs) that service ports 305 and 309. Ports 305 and 309 (also referred to as XPORT) are a part of switch 112.
[0048] Interface (I/F) 308 and 312 provide input/output interface to switch 112.
[0049] FIG. 4A shows a block diagram of transmit port 307 in switch 112 with an arbitration module 402. It is noteworthy that each transmit port (e.g. 307, 311) may have its own arbitration module (also referred to as “arbitration unit”) for transmitting packets.
[0050] Incoming packets are received by receive ports (306, 310). Incoming packets include the size of the data packet. This information may be included in the packet header 200. Packets are stored in receive port 305 buffer(s) (not shown).
[0051] Transmit tag fetch module 403 receives packet tags using packet tag crossbar 304. The tags are sent to a VL mapping module 404 which is used to map packet service level (SL) to a given output VL. This allows packets to enter via one VL and leave via another VL. Tags that are mapped by VL mapping module 404 are stored in a tag FIFO 406. Each packet tag represents data packets residing at receive port 306 buffer (not shown) waiting to be fetched. The tags include information on packet size, receive port (e.g. 306, 310) and receive port VL. Arbitration module 402 selects a packet tag from one of the VL tag FIFOs. The tag is used to generate a packet request and results in subsequent packet transfer.
[0052] Arbitration module 402 selects a packet from a set of candidate packets available for transmission from a port. As mentioned earlier, each port has its own arbitration module. VL priority table 405 provides packet ordering priority, which may be as shown below in Table I:
[0053]
| PACKET TYPE | PRECEDENCE ORDER | |
|---|---|---|
| MANAGEMENT PACKET | HIGHEST | |
| LINK PACKET | 2ND HIGHEST | |
| DROP PACKET | 3RD HIGHEST | |
| OTHERS | LOWEST | |
[0054] Packets at a higher precedence level are sent before packets at a lower precedence level.
[0055] A block diagram of VL arbitration priority table 405 is shown in FIG. 4B . VL arbitration priority table 405 includes three components, High Priority 405A, Low Priority 405D and Limit of High Priority 405G.
[0056] High Priority 405A and Low priority 405D includes plural entries with a VL number (for example, 405B and 405E, respectively) and a weightage value (for example, 405C and 405F). The weightage values indicate the number of byte units during which packet transmission may occur from a VL. The unit includes a header, payload, CRC and packet padding.
[0057] Limit of High priority value 405G indicates the number of high priority packets that can be transmitted without sending a low priority packet. VL arbitration values may be adjusted dynamically, as discussed below, while a port is active.
[0058] Priority values 405A and Low Priority values 405D form a two level priority scheme. If there is a packet available for transmission from any VL listed as a high priority component, then it is transmitted first. Transmission of packets with low priority values 405D occurs when:
[0059] No packets with high priority values 405A are available; or
[0060] The high priority transmit period has been exceeded defined by the Limit of High Priority value 405G.
[0061] Weighted round robin arbitration is used within each high or low priority component, where the order of entries for each component specifies the order of VL scheduling and the weightage value specifies the bandwidth allocated to the specific entry.
[0062] When an entry is completed, arbitration module 402 proceeds to the next value. The available weight is then set for the new entry. A packet is sent to an output port for transmission (via Buffer 401) and the available weight value is decreased for a current entry. This allows a transmit port (e.g., 307, 311) to send packets that are from the same source with the same destination efficiently without delay or port stalling.
[0063] In another aspect of the present invention, arbitration module 402 is provided with information regarding the remote buffer (or memory) where a packet is being sent. The remote buffer space size information together with the packet size informs arbitration module 402 whether the remote buffer can receive a packet. If a remote buffer cannot accommodate a given packet, the next VL (as shown by 405B, FIG. 4B)/WT (as shown by 405F, FIG. 4B )) pair is tested against the available packet candidates. This process continues until either a packet is selected and transmitted, or the port stalls. If the port stalls, it is an indication that the remote device does not have enough buffer space for any packet. This prevents packet dropping and port stalling.
[0064] FIG. 5 shows another top-level block diagram of switch 112 with arbitration unit 402. Receive port 306 receives packets from a device (not shown) and a packet request descriptor 501 with the packet size descriptor 502 are sent to arbitration module 402. Remote buffer space 503 information is also provided to arbitration module 402 in real time.
[0065] Arbitration module 402 uses remote buffer space 503 information with packet size data 502 to generate packet request (to a receive port (e.g. 306) to fetch a packet) descriptor 504 such that remote buffer space 503 is not overrun or under utilized. Arbitration module 402 uses this information with the priority table 405 and VL mapping module 404 information that is stored in FIFO 406, as described above.
[0066] FIG. 6 shows a flow diagram for transmitting packets based on remote buffer space availability.
[0067] In step S600, arbitration module 402 receives packet size and descriptor information. This also provides arbitration module 402 with the location of the remote buffer.
[0068] In step S601, arbitration module 402 obtains information (503) regarding the remote buffer space (via link layer or layer 1 VL flow control packets (not shown)). Such information will include the amount of buffer space available at any given time. This information allows arbitration module 402 to send packets that can be held in the remote buffer space.
[0069] In step S602, arbitration module 402 determines if the remote buffer can hold the packets based on packet size and available buffer space at a given time.
[0070] In step S603, arbitration module 402 sends the packets if the packet can fit in the available remote buffer space.
[0071] If the remote buffer cannot hold the packet, then in step S604, arbitration module 402 selects another packet for transmission. Steps S600 to S603 are repeated until the packet selected will fit in the remote buffer.
[0072] In one aspect of the present invention, packets that are from the same source port and received in consecutive order, have the same source VL and the same destination VL (“bundling conditions”) are bundled together. Arbitration module 402 sends these packets sequentially. Arbitration module 402 while sending a packet, searches for packets that meet the bundling conditions. The incoming packet is moved ahead of the transmit queue if the incoming packet meets the bundling conditions. This allows switch 112 to efficiently transmit packets if the bundling conditions are met.
[0073] FIG. 7 shows a process flow diagram for “packet bundling” such that packets from the same source and destination are sent in order.
[0074] In step S700, based on the packet tag information (or descriptor 501) arbitration module 402 determines if the packet is from the same source as a previous packet that has been transmitted.
[0075] If the packet is from the same source, then in step S701, arbitration module 402 determines if the packet received is in a consecutive order with respect to the previous packet received from the same source. If the packet is in consecutive order, then in step S703, arbitration module 402 determines if the packet has the same destination VL.
[0076] If the packet has the same destination VL, then it is sent after the previously transmitted packet, instead of waiting in a FIFO based system. Hence, the incoming packet is transmitted using a Last In-First Out (LIFO) system, instead of the first in first out (FIFO). This allows the packets to be efficiently transmitted.
[0077] In one aspect of the present invention, while a first packet is currently being transmitted, the arbitration unit determines whether to bundle the second packet with the first. This “on-the-fly” packet bundling reduces latency.
[0078] In one aspect of the present invention, remote buffer space is efficiently used and is not overrun because only those packets that can fit the remote buffer space are transmitted. This also prevents port stalling and packet dropping.
[0079] In another aspect of the present invention, network packets are efficiently transmitted because they are bundled together based on certain conditions (e.g. same source, same source virtual lane and same destination virtual lane). This prevents packets to the same destination from waiting in the network queue and reduces latency.
[0080] Although the present invention has been described with reference to specific embodiments, these embodiments are illustrative only and not limiting. Many other applications and embodiments of the present invention will be apparent in light of this disclosure and the following claims.
Claims
What is claimed is:
1. A method for transmitting a plurality of network packets, comprising:
(a) receiving network packet information for transmitting a network packet from one of the plurality of network packets that are waiting to be transmitted at a given time; wherein an arbitration module of a network switch receives the network packet information that includes information regarding network packet size;
(b) obtaining information regarding a remote buffer at a destination port where the network packet is to be sent; wherein the arbitration module obtains the information regarding the remote buffer;
(c) determining if available space in the remote buffer is sufficient to hold the network packet; and
(d) transmitting the network packet via a virtual lane to the destination port, if the network packet can be stored in available space in the remote buffer.
2. The method of claim 1, further comprising:
selecting another network packet from the plurality of network packets and repeating steps (a) to (d), if available space in the remote buffer is not enough to hold the network packet.
3. The method of claim 1, wherein the network switch is an Infiniband switch.
4. The method of claim 1, wherein a network packet tag includes information regarding network packet size and information regarding a receive port where the network packet is waiting to be fetched for transmission and the arbitration module uses the network tag information and generates a packet request to transmit the network packet.
5. The method of claim 1, wherein the arbitration module selects a network packet from among the plurality of network packets based on a priority table that stores information to categorize a network packet as a high priority network packet or a low priority packet; and the priority table stores a value for limiting transmission of high priority network packets before transmitting a low priority network packet that is waiting for transmission at any given time.
6. The method of claim 5, wherein a low priority network packet is transmitted if there is no high priority network packet waiting for transmission; or if a period to transmit a high priority network packet has exceeded the value in the priority table to limit transmission of high priority network packets.
7. The method of claim 5, wherein the arbitration module transmits a second network packet after a first network packet even if other network packets that were received before the second network packet are waiting for transmission, if the second network packet is received from a same source as the first network packet; the second network packet is destined for a same destination as the first network packet and the second network packet is received in a consecutive order after the first network packet.
8. A system for transmitting a plurality of network packets, comprising:
a receive port of a network port in a network switch that receives a network packet and generates a packet descriptor and packet size information;
a transmit port of the network port of the network switch that receives a packet tag with the packet descriptor and packet size information; and
an arbitration module that selects a network packet from among the plurality of network packets that are waiting to be transmitted at a given time, obtains information regarding available space in a remote buffer and compares the packet size information with the available space in the remote buffer and transmits the network packet via a virtual lane if the available space in the remote buffer is large enough to hold the network packet.
9. The system of claim 8, wherein the network port stores an arbitration priority table that stores information to categorize a network packet as a high priority network packet or a low priority packet; and the priority table stores a value for limiting transmission of high priority network packets before transmitting a low priority network packet that is waiting for transmission at any given time via a virtual lane.
10. The system of claim 9, wherein a low priority network packet is transmitted via a virtual lane if there is no high priority network packet waiting for transmission; or if a high priority transmit period has exceeded the value in the priority table that limits transmission of high priority network packets.
11. The system of claim 3, wherein the network switch is an Infiniband switch.
12. The system of claim 8, wherein the arbitration module transmits a second network packet after a first network packet even if other network packets that were received before the second network packets are waiting for transmission, if the second network packet is received from a same source as the first network packet; the second network packet is destined for a same destination as the first network packet and the second network packet is received in a consecutive order after the first network packet.
13. A system for network transmission, comprising:
a first network switch communicating with a second network switch; wherein the first network switch comprises a receive port of a network port in the first network switch that receives a network packet and generates a packet descriptor and packet size information; a transmit port of the network port of the first network switch that receives a packet tag with the packet descriptor and packet size information; and
an arbitration module for the network port of the first network switch that determines if a second network packet is from a same source port having a same source virtual lane and destination virtual lane and was received in a consecutive order, and transmits the second network packet after the first network packet, even if other packets were received before the second network packet and are waiting to be sent, wherein the network port for the first network switch stores an arbitration priority table that stores information to categorize a network packet as a high priority network packet or a low priority packet; and the priority table stores a value for limiting transmission of high priority network packets before transmitting a low priority network packet that is waiting for transmission at any given time.
14. The system of claim 13, wherein a low priority network packet is transmitted if there is no high priority network packet waiting for transmission; or if a high priority transmit period has exceeded the value in the priority table that limits transmission of high priority network packets.
15. The system of claim 13, wherein the network switch is an Infiniband switch.
Patent Citations (253)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4162375(A) | 1979-07-01 | Schilichte | Applicant |
| US4200929(A) | 1980-04-01 | Davidjuk et al. | Applicant |
| US4268906(A) | 1981-05-01 | Bourke et al. | Applicant |
| US4333143(A) | 1982-06-01 | Calder | Applicant |
| US4382159(A) | 1983-05-01 | Bowditch | Applicant |
| US4425640(A) | 1984-01-01 | Philip et al. | Applicant |
| US4449182(A) | 1984-05-01 | Rubinson et al. | Applicant |
| US4546468(A) | 1985-10-01 | Christmas et al. | Applicant |
| US4549263(A) | 1985-10-01 | Calder | Applicant |
| US4569043(A) | 1986-02-01 | Simmons et al. | Applicant |
| US4725835(A) | 1988-02-01 | Schreiner et al. | Applicant |
| US4777595(A) | 1988-10-01 | Strecker et al. | Applicant |
| US4783730(A) | 1988-11-01 | Fischer et al. | Applicant |
| US4783739(A) | 1988-11-01 | Calder | Applicant |
| US4803622(A) | 1989-02-01 | Bain, Jr. et al. | Applicant |
| US4821034(A) | 1989-04-01 | Anderson et al. | Applicant |
| US4980857(A) | 1990-12-01 | Walter et al. | Applicant |
| US5051742(A) | 1991-09-01 | Hullett et al. | Applicant |
| US5115430(A) | 1992-05-01 | Hahne et al. | Applicant |
| US5129064(A) | 1992-07-01 | Fogg, Jr. et al. | Applicant |
| US5144622(A) | 1992-09-01 | Takiyasu et al. | Applicant |
| US5212795(A) | 1993-05-01 | Hendry | Applicant |
| US5249279(A) | 1993-09-01 | Schmenk et al. | Applicant |
| US5276807(A) | 1994-01-01 | Kodama et al. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5347638(A) | 1994-09-01 | Desai et al. | Applicant |
| US5367520(A) | 1994-11-01 | Cordell | Applicant |
| US5371861(A) | 1994-12-01 | Keener et al. | Applicant |
| US5448702(A) | 1995-09-01 | Garcia, Jr. et al. | Applicant |
| US5568614(A) | 1996-10-01 | Mendelson et al. | Applicant |
| US5590125(A) | 1996-12-01 | Acampora et al. | Applicant |
| US5598541(A) | 1997-01-01 | Malladi | Applicant |
| US5610745(A) | 1997-03-01 | Bennett | Applicant |
| US5623492(A) | 1997-04-01 | Teraslinna | Examiner |
| US5647057(A) | 1997-07-01 | Roden et al. | Applicant |
| US5666483(A) | 1997-09-01 | McClary | Applicant |
| US5671365(A) | 1997-09-01 | Binford et al. | Applicant |
| US5687172(A) | 1997-11-01 | Cloonan et al. | Applicant |
| US5701416(A) | 1997-12-01 | Thorson et al. | Examiner |
| US5706279(A) | 1998-01-01 | Teraslinna | Examiner |
| US5740467(A) | 1998-04-01 | Chmielecki et al. | Applicant |
| US5748612(A) | 1998-05-01 | Stoevhase et al. | Applicant |
| US5758187(A) | 1998-05-01 | Young | Applicant |
| US5761427(A) | 1998-06-01 | Shah et al. | Applicant |
| US5812525(A) | 1998-09-01 | Teraslinna | Examiner |
| US5818842(A) | 1998-10-01 | Burwell et al. | Applicant |
| US5828475(A) | 1998-10-01 | Bennett et al. | Applicant |
| US5828903(A) | 1998-10-01 | Sethuram et al. | Applicant |
| US5835752(A) | 1998-11-01 | Chiang et al. | Applicant |
| US5875343(A) | 1999-02-01 | Binford et al. | Applicant |
| US5881296(A) | 1999-03-01 | Williams et al. | Applicant |
| US5892969(A) | 1999-04-01 | Young | Applicant |
| US5894560(A) | 1999-04-01 | Carmichael et al. | Applicant |
| US5905905(A) | 1999-05-01 | Dailey et al. | Applicant |
| US5917723(A) | 1999-06-01 | Binford | Applicant |
| US5937169(A) | 1999-08-01 | Connery et al. | Applicant |
| US5968143(A) | 1999-10-01 | Chisholm et al. | Applicant |
| US5978359(A) | 1999-11-01 | Caldara et al. | Examiner |
| US5983292(A) | 1999-11-01 | Nordstrom et al. | Applicant |
| US5987028(A) | 1999-11-01 | Yang et al. | Applicant |
| US5999528(A) | 1999-12-01 | Chow et al. | Applicant |
| US6006340(A) | 1999-12-01 | O'Connell | Applicant |
| US6014383(A) | 2000-01-01 | McCarty | Applicant |
| US6021128(A) | 2000-02-01 | Hosoya et al. | Applicant |
| US6026092(A) | 2000-02-01 | Abu-Amara et al. | Examiner |
| US6031842(A) | 2000-02-01 | Trevitt et al. | Applicant |
| US6047323(A) | 2000-04-01 | Krause | Applicant |
| US6049802(A) | 2000-04-01 | Waggener, Jr. et al. | Applicant |
| US6055603(A) | 2000-04-01 | Ofer et al. | Applicant |
| US6055618(A) | 2000-04-01 | Thorson | Examiner |
| US6061360(A) | 2000-05-01 | Miller et al. | Applicant |
| US6078970(A) | 2000-06-01 | Nordstrom | Applicant |
| US6081512(A) | 2000-06-01 | Muller et al. | Applicant |
| US6085277(A) | 2000-07-01 | Nordstrom et al. | Applicant |
| US6105122(A) | 2000-08-01 | Muller et al. | Applicant |
| US6108738(A) | 2000-08-01 | Chambers et al. | Applicant |
| US6108778(A) | 2000-08-01 | LaBerge | Applicant |
| US6115761(A) | 2000-09-01 | Daniel et al. | Applicant |
| US6118776(A) | 2000-09-01 | Berman | Applicant |
| US6128292(A) | 2000-10-01 | Kim et al. | Applicant |
| US6134617(A) | 2000-10-01 | Weber | Applicant |
| US6138176(A) | 2000-10-01 | McDonald et al. | Applicant |
| US6144668(A) | 2000-11-01 | Bass et al. | Applicant |
| US6160813(A) | 2000-12-01 | Banks et al. | Applicant |
| US6185620(B1) | 2001-02-01 | Weber et al. | Applicant |
| US6201787(B1) | 2001-03-01 | Baldwin et al. | Applicant |
| US6229822(B1) | 2001-05-01 | Chow et al. | Applicant |
| US6233244(B1) | 2001-05-01 | Runaldue et al. | Applicant |
| US6240096(B1) | 2001-05-01 | Book | Applicant |
| US6246683(B1) | 2001-06-01 | Connery et al. | Applicant |
| US6247060(B1) | 2001-06-01 | Boucher et al. | Applicant |
| US6253267(B1) | 2001-06-01 | Kim et al. | Applicant |
| US6269413(B1) | 2001-07-01 | Sherlock | Applicant |
| US6289002(B1) | 2001-09-01 | Henson et al. | Applicant |
| US6308220(B1) | 2001-10-01 | Mathur | Applicant |
| US6324181(B1) | 2001-11-01 | Wong et al. | Applicant |
| US6330236(B1) | 2001-12-01 | Ofek et al. | Applicant |
| US6334153(B2) | 2001-12-01 | Boucher et al. | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| US6353612(B1) | 2002-03-01 | Zhu et al. | Applicant |
| US6370605(B1) | 2002-04-01 | Chong | Applicant |
| US6389479(B1) | 2002-05-01 | Boucher et al. | Applicant |
| US6393487(B2) | 2002-05-01 | Boucher et al. | Applicant |
| US6401128(B1) | 2002-06-01 | Stai et al. | Applicant |
| US6408349(B1) | 2002-06-01 | Castellano | Applicant |
| US6411599(B1) | 2002-06-01 | Blanc et al. | Applicant |
| US6411627(B1) | 2002-06-01 | Hullett et al. | Applicant |
| US6418477(B1) | 2002-07-01 | Verma | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6424658(B1) | 2002-07-01 | Mathur | Applicant |
| US6427171(B1) | 2002-07-01 | Craft et al. | Applicant |
| US6427173(B1) | 2002-07-01 | Boucher et al. | Applicant |
| US6434620(B1) | 2002-08-01 | Boucher et al. | Applicant |
| US6434630(B1) | 2002-08-01 | Micalizzi, Jr. et al. | Applicant |
| US6449274(B1) | 2002-09-01 | Holden et al. | Applicant |
| US6452915(B1) | 2002-09-01 | Jorgensen | Applicant |
| US6457090(B1) | 2002-09-01 | Young | Applicant |
| US6463032(B1) | 2002-10-01 | Lau et al. | Applicant |
| US6467008(B1) | 2002-10-01 | Gentry et al. | Applicant |
| US6470026(B1) | 2002-10-01 | Pearson et al. | Applicant |
| US6470173(B1) | 2002-10-01 | Okada et al. | Applicant |
| US6470415(B1) | 2002-10-01 | Starr et al. | Applicant |
| US6502189(B1) | 2002-12-01 | Westby | Applicant |
| US6504846(B1) | 2003-01-01 | Yu et al. | Applicant |
| US6532212(B1) | 2003-03-01 | Soloway et al. | Applicant |
| US6546010(B1) | 2003-04-01 | Merchant et al. | Applicant |
| US6564271(B2) | 2003-05-01 | Micalizzi et al. | Applicant |
| US6570850(B1) | 2003-05-01 | Gutierrez et al. | Applicant |
| US6591302(B2) | 2003-07-01 | Boucher et al. | Applicant |
| US6594231(B1) | 2003-07-01 | Byham et al. | Applicant |
| US6594329(B1) | 2003-07-01 | Susnow | Applicant |
| US6597691(B1) | 2003-07-01 | Anderson et al. | Applicant |
| US6597777(B1) | 2003-07-01 | Ho | Applicant |
| US6614796(B1) | 2003-09-01 | Black et al. | Applicant |
| US6643748(B1) | 2003-11-01 | Wieland | Applicant |
| US6697359(B1) | 2004-02-01 | George | Applicant |
| US6697368(B2) | 2004-02-01 | Chang et al. | Applicant |
| US6721799(B1) | 2004-04-01 | Slivkoff | Applicant |
| US6725388(B1) | 2004-04-01 | Susnow | Applicant |
| US6744772(B1) | 2004-06-01 | Eneboe et al. | Examiner |
| US6760302(B1) | 2004-07-01 | Ellinas et al. | Applicant |
| US6775693(B1) | 2004-08-01 | Adams | Applicant |
| US6785241(B1) | 2004-08-01 | Lu et al. | Applicant |
| US6807181(B1) | 2004-10-01 | Weschler | Applicant |
| US6810440(B2) | 2004-10-01 | Micalizzi, Jr. et al. | Applicant |
| US6810442(B1) | 2004-10-01 | Lin | Applicant |
| US6816750(B1) | 2004-11-01 | Klaas | Applicant |
| US6859435(B1) | 2005-02-01 | Lee et al. | Applicant |
| US6886141(B1) | 2005-04-01 | Kunz et al. | Applicant |
| US6941357(B2) | 2005-09-01 | Nguyen et al. | Applicant |
| US6941482(B2) | 2005-09-01 | Strong | Applicant |
| US6952659(B2) | 2005-10-01 | King et al. | Applicant |
| US6968463(B2) | 2005-11-01 | Pherson et al. | Applicant |
| US7000025(B1) | 2006-02-01 | Wilson | Applicant |
| US7002926(B1) | 2006-02-01 | Eneboe et al. | Examiner |
| US7010607(B1) | 2006-03-01 | Bunton | Applicant |
| US7039070(B2) | 2006-05-01 | Kawakatsu | Applicant |
| US7039870(B2) | 2006-05-01 | Takaoka et al. | Applicant |
| US7047326(B1) | 2006-05-01 | Crosbie et al. | Applicant |
| US7050392(B2) | 2006-05-01 | Valdevit | Applicant |
| US7055068(B2) | 2006-05-01 | Riedl | Applicant |
| US7092374(B1) | 2006-08-01 | Gubbi | Applicant |
| US7110394(B1) | 2006-09-01 | Chamdani et al. | Applicant |
| US7124169(B2) | 2006-10-01 | Shimozono et al. | Applicant |
| US7151778(B2) | 2006-12-01 | Zhu et al. | Applicant |
| US7171050(B2) | 2007-01-01 | Kim | Applicant |
| US7185062(B2) | 2007-02-01 | Lolayekar et al. | Applicant |
| US7190667(B2) | 2007-03-01 | Susnow et al. | Examiner |
| US7194538(B1) | 2007-03-01 | Rabe et al. | Applicant |
| US7200108(B2) | 2007-04-01 | Beer et al. | Applicant |
| US7215680(B2) | 2007-05-01 | Mullendore et al. | Applicant |
| US7221650(B1) | 2007-05-01 | Cooper et al. | Applicant |
| US7245613(B1) | 2007-07-01 | Winkles et al. | Examiner |
| US7248580(B2) | 2007-07-01 | George et al. | Applicant |
| US7269131(B2) | 2007-09-01 | Cashman et al. | Applicant |
| US7292593(B1) | 2007-11-01 | Winkles et al. | Examiner |
| US2001/0011357(A1) | 2001-08-01 | Mori | Applicant |
| US2001/0038628(A1) | 2001-11-01 | Ofek et al. | Applicant |
| US2001/0047460(A1) | 2001-11-01 | Kobayashi et al. | Applicant |
| US2002/0034178(A1) | 2002-03-01 | Schmidt et al. | Applicant |
| US2002/0071387(A1) | 2002-06-01 | Horiguchi et al. | Examiner |
| US2002/0103913(A1) | 2002-08-01 | Tawil et al. | Applicant |
| US2002/0104039(A1) | 2002-08-01 | DeRolf et al. | Applicant |
| US2002/0124124(A1) | 2002-09-01 | Matsumoto et al. | Applicant |
| US2002/0147560(A1) | 2002-10-01 | Devins et al. | Applicant |
| US2002/0147802(A1) | 2002-10-01 | Murotani et al. | Applicant |
| US2002/0147843(A1) | 2002-10-01 | Rao | Applicant |
| US2002/0156918(A1) | 2002-10-01 | Valdevit et al. | Applicant |
| US2002/0172195(A1) | 2002-11-01 | Pekkala et al. | Examiner |
| US2002/0191602(A1) | 2002-12-01 | Woodring et al. | Applicant |
| US2002/0196773(A1) | 2002-12-01 | Berman | Applicant |
| US2003/0002503(A1) | 2003-01-01 | Brewer et al. | Applicant |
| US2003/0016683(A1) | 2003-01-01 | George et al. | Applicant |
| US2003/0021239(A1) | 2003-01-01 | Mullendore et al. | Applicant |
| US2003/0026267(A1) | 2003-02-01 | Oberman et al. | Applicant |
| US2003/0026287(A1) | 2003-02-01 | Mullendore et al. | Applicant |
| US2003/0035433(A1) | 2003-02-01 | Craddock et al. | Applicant |
| US2003/0046396(A1) | 2003-03-01 | Richter et al. | Applicant |
| US2003/0056000(A1) | 2003-03-01 | Mullendore et al. | Applicant |
| US2003/0072316(A1) | 2003-04-01 | Niu et al. | Applicant |
| US2003/0079019(A1) | 2003-04-01 | Lolayekar et al. | Applicant |
| US2003/0084219(A1) | 2003-05-01 | Yao et al. | Applicant |
| US2003/0086377(A1) | 2003-05-01 | Berman | Applicant |
| US2003/0091062(A1) | 2003-05-01 | Lay et al. | Applicant |
| US2003/0103451(A1) | 2003-06-01 | Lutgen et al. | Applicant |
| US2003/0117961(A1) | 2003-06-01 | Chuah et al. | Applicant |
| US2003/0120983(A1) | 2003-06-01 | Vieregge et al. | Applicant |
| US2003/0126320(A1) | 2003-07-01 | Liu et al. | Applicant |
| US2003/0137941(A1) | 2003-07-01 | Kaushik et al. | Applicant |
| US2003/0174789(A1) | 2003-09-01 | Waschura et al. | Applicant |
| US2003/0179709(A1) | 2003-09-01 | Huff | Applicant |
| US2003/0179748(A1) | 2003-09-01 | George et al. | Applicant |
| US2003/0189930(A1) | 2003-10-01 | Terrell et al. | Applicant |
| US2003/0189935(A1) | 2003-10-01 | Warden et al. | Applicant |
| US2003/0195983(A1) | 2003-10-01 | Krause | Applicant |
| US2003/0229808(A1) | 2003-12-01 | Heintz et al. | Applicant |
| US2003/0236953(A1) | 2003-12-01 | Grieff et al. | Applicant |
| US2004/0013092(A1) | 2004-01-01 | Betker et al. | Applicant |
| US2004/0013125(A1) | 2004-01-01 | Betker et al. | Applicant |
| US2004/0015638(A1) | 2004-01-01 | Bryn | Applicant |
| US2004/0024831(A1) | 2004-02-01 | Yang et al. | Applicant |
| US2004/0028038(A1) | 2004-02-01 | Anderson et al. | Applicant |
| US2004/0057389(A1) | 2004-03-01 | Klotz et al. | Applicant |
| US2004/0081186(A1) | 2004-04-01 | Warren et al. | Applicant |
| US2004/0081394(A1) | 2004-04-01 | Biran et al. | Examiner |
| US2004/0085955(A1) | 2004-05-01 | Walter et al. | Applicant |
| US2004/0100944(A1) | 2004-05-01 | Richmond et al. | Applicant |
| US2004/0109418(A1) | 2004-06-01 | Fedorkow et al. | Applicant |
| US2004/0123181(A1) | 2004-06-01 | Moon et al. | Applicant |
| US2004/0141521(A1) | 2004-07-01 | George | Applicant |
| US2004/0153914(A1) | 2004-08-01 | El-Batal | Applicant |
| US2004/0174813(A1) | 2004-09-01 | Kasper et al. | Applicant |
| US2004/0208201(A1) | 2004-10-01 | Otake | Applicant |
| US2004/0267982(A1) | 2004-12-01 | Jackson et al. | Applicant |
| US2005/0023656(A1) | 2005-02-01 | Leedy | Applicant |
| US2005/0036499(A1) | 2005-02-01 | Dutt et al. | Applicant |
| US2005/0058148(A1) | 2005-03-01 | Castellano et al. | Applicant |
| US2005/0117522(A1) | 2005-06-01 | Basavaiah et al. | Applicant |
| US2005/0141661(A1) | 2005-06-01 | Renaud et al. | Applicant |
| US2005/0177641(A1) | 2005-08-01 | Yamagami | Applicant |
| US2006/0047852(A1) | 2006-03-01 | Shah et al. | Applicant |
| US2006/0074927(A1) | 2006-04-01 | Sullivan et al. | Applicant |
| US2006/0156083(A1) | 2006-07-01 | Jang et al. | Applicant |
| US2006/0184711(A1) | 2006-08-01 | Pettey | Applicant |
| US2007/0124623(A1) | 2007-05-01 | Tseng | Applicant |
| EP649098 | 1994-09-01 | Applicant | |
| EP738978 | 1996-10-01 | Applicant | |
| EP856969 | 1998-01-01 | Applicant | |
| EP1059588 | 2000-12-01 | Applicant | |
| WO-95/06286 | 1995-03-01 | Applicant | |
| WO-98/36537 | 1998-08-01 | Applicant | |
| WO-0058843 | 2000-10-01 | Applicant | |
| WO3/088050 | 2003-10-01 | Applicant |
Non-Patent Literature (24)
- Clark, Tom, “Zoning for Fibre Channel Fabrics”, Vixel Corporation Paper—XP002185194., (Aug. 1999), pp. 1-6.Applicant
- Malavalli, Kumar, et al., “Distributed Computing with fibre channel fabric”, Proc of the Computer Soc. Int'l Conf., Los Alamitos, IEEE Comp Soc. Press., vol. Conf. 37, XP000340745, (Feb. 24, 1992), pp. 269-274.Applicant
- Martin, Charles R., “Fabric Interconnection of fibre channel standard nodes”, Proceedings of the SPIE, (Sep. 8, 1992), pp. 65-71.Applicant
- Yoshida, Hu, “LUN Security Considerations for Storage Area Networks,” Hitachi Data Systems Paper—XP 002185193 (1999), pp. 1-7.Applicant
- Claudio DeSanti, “Virtual Fabrics Switch Support” ; VF Switch Support, T11/04-395v2. Sep. 2004, pp. 1-15.Applicant
- Pelissier et al, “Inter-Fabric Routing”, dated Jul. 30, 2004, Inter Fabric Routing (04-520v0); pp. 1-31.Applicant
- DeSanti et al, “Virtual Fabrics”; Virtual Fabrics, T11/03-352v0, May 2003; pp. 1-4.Applicant
- Martin et al , “Virtual Channel Architecture”, Presentation by Brocade to T11/03-369V0 dated Jun. 2, 2003.Applicant
- Curtis, A. R., “Design Considerations for 10-Gbit Fibre Channel”, Curtis A. Ridgeway, Distinguished I/O Architect, Storage and Computing ASIC's Division, LSI Logic Corp.Applicant
- Malavalli, Kumar, “High Speed Fibre Channel Switching Fabric Devices”, Proceedings of the SPIE, SPIE, Bellingham, VA, USA vol. 1577,, XP000562869, ISSN: 0277-786X,(Sep. 4, 1991),216-226.Applicant
- Melhem, et al., “Minimizing Wavelength Conversions in WDM Path Establishment”, Computer Science Department, University of Pittsburgh, Pittsburgh, PA 15260, (2001), 197-211.Applicant
- Ridgeway, Curt , “0GFC-40GFC using 4-lane XAUI's”, LSI Logic Presentation—T11/03-069v0.Applicant
- Brown, Douglas W., “A State-Machine Synthesizer”, 18th Design Automation Conference, (1981),301-305.Applicant
- Banks, David C., et al., “Link Trunking and Measuring Link Latency in Fibre Channel Fabric”, U.S. Appl. No. 60/286,046, 1-52.Applicant
- Naik, D. “Inside Windows Storage:Server Storage Technologies for Windows 2000, Windows Server 2003 and Beyond”, Addison-Wesley, US, Chapter 5, XP-002381152, (Jul. 15, 2003), 137-173.Applicant
- “Deliver Server-Free Backup”, Pathlight & Computer Associates, White Paper of Apr. 2000, Ithaca, New York, XP-002381153, 1-8.Applicant
- Budruk, Ravi et al., “PCI Express System Architecture”, (2004),434,436-439,442-443.Applicant
- “PCI Express Base Specification Revision 1.0”, (Apr. 29, 2002), 195-196.Applicant
- International Preliminary Report on Patentability dated Apr. 3, 2007, for International patent application No. PCT/US2005/034844.Applicant
- International Preliminary Report on Patentability dated Apr. 3, 2007, for International patent application No. PCT/US2005/034758.Applicant
- International Preliminary Report on Patentability dated Apr. 11, 2007, for International patent application No. PCT/US2005/034845.Applicant
- International Preliminary Report on Patentability dated Apr. 3, 2007, for International patent application No. PCT/US2005/035064.Applicant
- International Preliminary Report on Patentability dated Jul. 24, 2007, for International patent application No. PCT/US2005/42528.Applicant
- “Examination Report from the European Patent Office dated Oct. 12, 2007 for European Application No. 05 805 632.6”.Applicant