US 7,525,910 B2Grant
Method and system for non-disruptive data capture in networks
Issue Date:2009-04-28
•8 Claims
•11 Drawing Sheets
Abstract
A method and fiber channel switch element for capturing data in a fiber channel system is provided. The method includes, detecting a condition for enabling data capture; setting a control bit to enable data capture; and capturing data based on the set control bit. The switch element includes, a diagnostic port that can configured as a traditional communication port and/or a data capture port depending on incoming frame data. The diagnostic port filters incoming frames, which is used to enable data capture.
Metadata
Assignee
- QLOGIC, Corporation
Inventor
- William J. Wen
Application Information
Application Number:US 10/889,635
Filing Date:2004-07-12
Priority Date:2003-07-16
Art Unit:2416
Classifications
IPC:
G01R31/08H04J1/16H04J1/02H04L12/28G06F3/00
Patent Drawings (11 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims priority under 35 USC Section 119(e), to the following provisional patent applications:
[0002] Ser. No. 60/487,876 filed on Jul. 16, 2003;
[0003] Ser. No. 60/487,887 filed on Jul. 16, 2003;
[0004] Ser. No. 60/487,875 filed on Jul. 16, 2003;
[0005] Ser. No. 60/490,747 filed on Jul. 29, 2003;
[0006] Ser. No. 60/487,667 filed on Jul. 16, 2003;
[0007] Ser. No. 60/487,665 filed on Jul. 16, 2003;
[0008] Ser. No. 60/492,346 filed on Aug. 4, 2003; and
[0009] Ser. No. 60/487,873 filed on Jul. 16, 2003.
[0010] The disclosures of the foregoing applications are incorporated herein by reference in their entirety.
Background
[0011] 1. Field of the Invention
[0012] The present invention relates to networks, and more particularly to non-disruptive data capture.
[0013] 2. Background of the Invention
[0014] Data-capture in a communications network typically requires dedicated and specialized equipment, and is not incorporated in a port attached to the communications network. Specialized data-capture equipment typically has abundant buffer space for the data-capture and can keep pace with all traffic in a communications network. However, many classes of problems—such as network and topology discovery, automated configuration, and intelligent device diagnostics—require data-capture but do not require keeping pace with the communications network itself.
[0015] Various protocols are used for networks. Fibre channel is a set of American National Standard Institute (ANSI) standards, which provide a serial transmission protocol for storage and network protocols such as HIPPI, SCSI, IP, ATM and others. Fibre channel provides an input/output interface to meet the requirements of both channel and network users.
[0016] Fibre channel supports three different topologies: point-to-point, arbitrated loop, and fibre channel fabric. The point-to-point topology attaches two devices directly. The arbitrated loop topology attaches devices in a loop. The fibre channel fabric topology attaches host systems directly to a fabric, which are then connected to multiple devices. The fibre channel fabric topology allows several media types to be interconnected.
[0017] Fibre channel is a closed system that relies on multiple ports to exchange information on attributes and characteristics to determine if the ports can operate together. If the ports can work together, they define the criteria under which they communicate.
[0018] In fibre channel, a path is established between two nodes where the path's primary task is to transport data from one point to another at high speed with low latency, performing only simple error detection in hardware.
[0019] FC-AL is one fibre channel standard (incorporated herein by reference in its entirety) that establishes the protocols for an arbitrated loop topology. In an AL loop (per the FC-AL fibre channel standard) various devices can send data to each other. An arbitration cycle (using the “ARB” primitive) determines which device gets access. The priority scheme itself is defined by the standard. A device (e.g. device A) seeking access to another device (device B) sends an ARB primitive. If device A wins arbitration then it sends an OPN primitive and establishes a connection with device B. Device B sends an R_RDY primitive indicating that credit is available for a frame. Thereafter, frames are transferred.
[0020] Each port has a loop port state machine (“LPSM”) and in conventional implementation, the LPSM must be at a certain state to send or receive data.
[0021] Unlike a traditional communications port, a Data-Capture port may receive data outside of typical network-specific hand shaking. For example, in a FC-AL topology, a traditional port may receive data only if the LPSM is in one of several specific states and only if sufficient Buffer-to-Buffer Credit is available, but a Data-Capture port may receive data regardless of these conditions. A Data-Capture port may also receive data destined for another port. Data-Capture ports copy data from a network, but do not follow network hand shaking, and do not participate as a traditional communications port.
[0022] In order to capture all data based on specific criteria, Data-Capture ports include a large set of buffers, which are typically expensive, and are separate from a traditional communications port.
[0023] FIG. 2 shows an example of a traditional implementation (200) of a traditional port and a data capture port. State machines 201 and 203 operate with limited buffers 206 and 205 respectively. Port 202 includes a data capture state machine and uses a large set of buffers 204. This makes the use of data capture ports very expensive in commercial products.
[0024] Therefore, what is required is a process and system that allows data capture function without using expensive buffers.
Summary of the Invention
[0025] In one aspect of the present invention, a method for capturing data in a fibre channel system is provided. The method includes, detecting a condition for enabling data capture; setting a control bit to enable data capture; and capturing data based on the set control bit. Incoming data is sampled to determine what levels of data capture may be required and if the data is from a private or public loop. A communication port is configured to capture data.
[0026] In another aspect of the present invention, a fibre channel switch element is provided. The switch element includes, a diagnostic port that can be configured as a traditional communication port and/or a data capture port depending on incoming frame data. The diagnostic port filters incoming frames, which is used to enable data capture.
[0027] In yet another aspect of the present invention, a data capture port is integrated with a traditional communication port and hence operates as a communication/data capture port. Also, due to intelligent frame filtering, a large set of buffers is not always needed for data capture and hence this reduces the overall cost of the system.
[0028] 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
[0029] 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:
[0030] FIG. 1 shows a block diagram of a storage area network;
[0031] FIG. 2 shows a prior art data capture port;
[0032] FIG. 3 shows a block diagram of using a traditional state machine with a data capture port, according to one aspect of the present invention;
[0033] FIG. 4 shows a block diagram of a switch element, according to one aspect of the present invention;
[0034] FIGS. 5A and 5B (jointly referred to as FIG. 5 ) show a block diagram of a transmission protocol engine, according to one aspect of the present invention;
[0035] FIGS. 6A and 6B show block diagrams for a diagnostic module and a SES module, according to one aspect of the present invention;
[0036] FIG. 7 is a process flow diagram for using a data port, according to one aspect of the present invention; and
[0037] FIG. 8 shows an example of a problem that does not require capturing large amount of data to isolate a problem.
Detailed Description of the Preferred Embodiments
[0038] Definitions:
[0039] The following definitions are provided as they are typically (but not exclusively) used in the fibre channel environment, implementing the various adaptive aspects of the present invention.
[0040] “AL_PA”: Arbitrated loop physical address.
[0041] “FC-AL”: Fibre channel arbitrated loop process described in FC-AL standard.
[0042] “Fibre channel ANSI Standard”: The standard describes the physical interface, transmission and signaling protocol of a high performance serial link for support of other high level protocols associated with IPI, SCSI, IP, ATM and others.
[0043] “FC-1”: Fibre channel transmission protocol, which includes serial encoding, decoding and error control.
[0044] “FC-2”: Fibre channel signaling protocol that includes frame structure and byte sequences.
[0045] “FC-3”: Defines a set of fibre channel services that are common across plural ports of a node.
[0046] “FC-4”: Provides mapping between lower levels of fibre channel, IPI and SCSI command sets, HIPPI data framing, IP and other upper level protocols
[0047] “LIP”: Loop initialization protocol primitive.
[0048] “L_Port”: A port that contains Arbitrated Loop functions associated with the Arbitrated Loop topology.
[0049] “S_ID”: Source address field in a fibre channel frame header.
[0050] “SES”: SCSI Enclosure Services.
[0051] “TPE”: Transmission Protocol Engine, a controller that operates at the FC-1 level.
[0052] To facilitate an understanding of the preferred embodiment, the general architecture and operation of a fibre channel system will be described. The specific architecture and operation of the preferred embodiment will then be described with reference to the general architecture of the fibre channel system.
[0053] FIG. 1 is a block diagram of a fibre channel system 100 implementing the methods and systems in accordance with the adaptive aspects of the present invention. System 100 includes plural devices that are interconnected. Each device includes one or more ports, classified as node ports (N_Ports), fabric ports (F_Ports), and expansion ports (E_Ports). Node ports may be located in a node device, e.g. server 103, disk array 105 and storage device 104. Fabric ports are located in fabric devices such as switch 101 and 102. Arbitrated loop 106 may be operationally coupled to switch 101 using arbitrated loop ports (FL_Ports).
[0054] The devices of FIG. 1 are operationally coupled via “links” or “paths”. A path may be established between two N_ports, e.g. between server 103 and storage 104. A packet-switched path may be established using multiple links, e.g. an N-Port in server 103 may establish a path with disk array 105 through switch 102.
[0055] FIG. 3 shows a block diagram of the top-level architecture to one aspect of the current invention. FIG. 3 shows a system 300 where a traditional state machine 301 is used with data capture capability with limited set of buffers 302. By incorporating data-capture into a traditional communications port, this port may not only detect more conditions on the communications network, but also provide more solutions by participating as a traditional port. When data-capture is not required, the integrated port is used as a traditional network port.
[0056] The ability to use a traditional port for data capturing will now be described with respect to the block diagram of FIG. 4 .
[0057] FIG. 4 is a block diagram of an 18-port ASIC FC element 400A (also referred to as system 400A) according to one aspect of the present invention. FC element 400A provides various functionality in an FC-AL environment, including without limitation, FC element 400A operates as a loop controller and loop switch using switch matrix 408, in accordance with the FC-AL standard.
[0058] FC element 400A of the present invention is presently implemented as a single CMOS ASIC, and for this reason the term “FC element” and ASIC are used interchangeably to refer to the preferred embodiments in this specification. Although FIG. 4 shows 18 ports, the present invention is not limited to any particular number of ports.
[0059] System 400A provides a set of port control functions, status indications, and statistics counters for monitoring the health of the loop and attached devices, diagnosing faults, and recovering from errors.
[0060] ASIC 400A has 18 ports where 16 ports are shown as numeral 405 while a host port 404 and cascade port 404A are shown separately for convenience only. These ports are generic to common Fibre Channel port types, for example, L_Ports.
[0061] For illustration purposes only, all ports are drawn on the same side of ASIC 400A in FIG. 4 . However, the ports may be located on any side of ASIC 400A. This does not imply any difference in port or ASIC design. Actual physical layout of the ports will depend on the physical layout of the ASIC.
[0062] Each port has transmit and receive connections to switch matrix 408 and includes transmit protocol engine 407 and a serial/deserializer 406. Frames enter/leave the link 405A and SERDES 406 converts data into 10-bit parallel data to fibre channel characters.
[0063] Switch matrix 408 dynamically establishes a connection for loop traffic. Switch matrix 408 includes a global arbiter (hence switch matrix 408 is also referred to as SGA 408) that provides lower latency and improved diagnostic capabilities while maintaining full Fibre Channel Arbitrated Loop (FC-AL) compliance.
[0064] Switch matrix 408 provides a quasi-direct architecture in the form of a buffer-less Switch Matrix. Switch matrix 408 includes data multiplexers that provide a path to each port.
[0065] SGA 408 creates a direct loop connection between source and destination devices. This connection methodology avoids the delay associated with data having to pass from one disk drive member of the loop to the next until the data has completed traversing the loop.
[0066] System 400A includes plural I2C (I2C standard compliant interfaces 412-413 (including 412A) that allow system 400A to couple to plural I2C ports each having a master and slave capability.
[0067] System 400A also includes a general-purpose input/output interface (“GPIO”) 415. This allows information from system 400A to be analyzed by any device that can use GPIO 415. Control/Status information 419 can be sent or received through module 415.
[0068] System 400A also includes a SPI module 414 that is used for parallel to serial and serial to parallel transfer between processor 400 firmware and flash memory 421 in the standard Little Endian format.
[0069] System 400A also includes a Universal Asynchronous Receiver/Transmitter (“UART”) interface 418 that converts serial data to parallel data (for example, from a peripheral device modem or data set) and vice-versa (data received from processor 400) complying industry standard requirements.
[0070] System 400A can also process tachometer inputs (received from a fan, not shown) using module 417. Processor 400 can read the tachometer input via a tachometer rate register and status register (not shown).
[0071] System 400A provides pulse width modulator (“PWM”) outputs via module 416. Processor 400 can program plural outputs. Timer module 411 is provided for maintaining plural timers for various operations.
[0072] System 400A also includes two frame manager modules 402 and 403 that are similar in structure. Processor 400 can set both modules 402 and 403 into a data capture mode by using a control bit as described below with respect to FIGS. 7 and 8 . Processor 400 can access runtime code from memory 420 and input/output instructions from read only memory “ROM” 409.
[0073] Port Management Interface (PMIF) 401 allows processor 400 access to various port level registers, SerDes modules 406 and TPE Management Interfaces 509 (FIG. 5 ). PMIF 401 contains a set of global control and status registers, receive and transmit test buffers, and three Serial Control Interface (SCIF) controllers (not shown) for accessing SerDes 406 registers.
[0074] Module 402 (also referred to as the “diag module 402”) is a diagnostic module used to transfer diagnostic information between a FC-AL and the firmware of system 400A.
[0075] Diag module 402 is functionally coupled to storage media (via ports 405) via dedicated paths outside switch matrix 408 so that its connection does not disrupt the overall loop. Diag module 402 is used for AL_PA capture during LIP propagation, drive(s) (coupled to ports 405) diagnostics and frame capture.
[0076] Module 403 (also referred to as “SES module 403”) complies with the SES standard and is functionally coupled to host port 404 and its output is routed through switch matrix 408. SES module 403 is used for in-band management services using the standard SES protocol.
[0077] When not bypassed, modules 402 and 403 receive primitives, primitive sequences, and frames. Based on the received traffic and the requests from firmware, modules 402 and 403 maintain loop port state machine (LPSM) (615, FIG. 6B ) in the correct state per the FC-AL standard specification, and also maintains the current fill word.
[0078] Based on a current LPSM 615 state (OPEN or OPENED State), modules 402 and 403 receive frames, pass the frame onto a buffer, and alert firmware that a frame has been received. Module 402 and 403 follow FC-AL buffer to buffer credit requirements.
[0079] Firmware may request modules 402 and 403 to automatically append SOF and EOF to the outgoing frame, and to automatically calculate the outgoing frame's CRC using CRC generator 612. Modules 402 and 403 can receive any class of frames and firmware may request to send either fibre channel Class 2 or Class 3 frames.
[0080] FIGS. 6A and 6B show block diagrams for module 402 and 403. It is noteworthy that the structure in FIGS. 6A and 6B can be used for both modules 402 and 403. FIG. 6B is the internal data path of a FC port 601 coupled to modules 402/403.
[0081] Modules 402 and 403 interface with processor 400 via an interface 606. Incoming frames to modules 402 and 403 are received from port 601 (which could be any of the ports 404, 404A and 405) and stored in frame buffer 607. Outgoing frames are also stored in frame buffer 607. Modules 402 and 403 have a receive side memory buffer based on “first-in, first-out” principle, (“FIFO”) “RX_FIFO” 603 and transmit side “TX_FIFO” FIFO 604 interfacing with random access FIFO 605. A receive side FIFO 603 signals to firmware when incoming frame(s) are received. A transmit side FIFO 604 signals to hardware when outgoing frames(s) are ready for transmission. A frame buffer 607 is used to stage outgoing frames and to store incoming frames. Modules 602 and 602A are used to manage frame traffic from port 601 to buffers 603 and 604, respectively.
[0082] Modules 402 and 403 use various general-purpose registers 608 for managing control, status and timing information.
[0083] Based on the AL_PA, modules 402 and 403 monitor received frames and if a frame is received for a particular module (402 or 403), it will pass the frame onto a receive buffer and alert the firmware that a frame has been received via a receive side FIFO 603. Modules 402 and 403 follow the FC-AL buffer-to-buffer credit requirements using module 616. Modules 402 and 403 transmit primitives and frames based on FC-AL rules. On request, modules 402 and 403 may automatically generate start of frame “SOF” and end of frame “EOF” during frame transmission (using module 613). On request, modules 402 and 403 may also automatically calculate the Cyclic Redundancy Code (CRC) during frame transmission, using module 612.
[0084] Overall transmission control is performed by module 611 that receives data, SOF, EOF and CRC. A word assembler module 609 is used to assemble incoming words, and a fill word module 610 receives data “words” before sending it to module 611 for transmission. Transmit buffer control is provided by module 614.
[0085] FIG. 5 shows a block diagram of the transmission protocol engine (“TPE”) 407. TPE 407 maintains plural counters/registers to interact with drives coupled to ports 405. Each TPE 407 interacts with processor 400 via port manager interface “PMIF” 401.
[0086] Each Fibre Channel port of system 400A includes a TPE module for interfacing with SerDes 406. TPE 407 handles most of the FC-1 layer (transmission protocol) functions, including 10B receive character alignment, 8B/10B encode/decode, 32-bit receive word synchronization, and elasticity buffer management for word re-timing and TX/RX frequency compensation.
[0087] SerDes modules 406 handle the FC-1 serialization and de-serialization functions. Each SerDes 406 port consists of an independent transmit and receive node.
[0088] TPE 407 has a receive module 500 (that operates in the Rx clock domain 503) and a transmit module 501. Data 502 is received from SERDES 406 and decoded by decoding module 504. A parity generator module 505 generates parity data. SGA interface 508 allows TPE to communicate with switch 514 or switch matrix 408. Interface 508 (via multiplexer 507) receives information from a receiver module 506 that receives decoded data from decode module 504 and parity data from module 505.
[0089] Management interfaces module 509 interfaces with processor 400. Transmit module 501 includes a parity checker 511, a transmitter 510 and an encoder 512 that encodes 8-bit data into 10-bit data. 10-bit transmit data is sent to SERDES 406 via multiplexer 513.
[0090] FIG. 7 shows a process flow diagram for setting up SES module 403 or Diag module 402 to operate in a data capture mode.
[0091] Turning in detail to FIG. 7 , in step S700 processor 400 detects a condition that requires data capturing.
[0092] In step S701, processor 400 sets a control bit to enable data capture and in step S702, data capture is enabled.
[0093] In step S703, modules 402 and/or module 403 without following FC-AL formalities capture data. This does not require the use of large set of external buffers.
[0094] Some network problems have no clear boundaries for data-capture, thus requiring the capture of all frames until buffer space is exhausted. In such cases, a traditional Data-Capture port with a large set of buffers is needed. However, many problems may be solved which require data-capture but do not require capturing large amounts of data. Problems that are tightly repeating may be solved with sparse data sampling. For example, a FC-AL port with data-capture may discover network topology (a private or public loop) without becoming a participating node, by capturing a FC frame and examining the Arbitrated Loop Physical Address.
[0095] FIG. 8 shows an example of some types of problems that does not require capturing large amount of data in order to isolate a problem, as used by diag module 402 and/or SES module 403. Turning in detail to FIG. 8 , in step S800, the process is idle and stays in step S800 while there is no request to capture a frame. When there is a request to capture a frame, the process moves to step S801, and stays in step 801 until the SOF is detected. When SOF is detected in step S801, the process moves to step S802.
[0096] In step S802, the process checks for the EOF. If no EOF is detected, then in step S803 the data is copied and the process reverts back to step S802.
[0097] In step S804, the process determines if the S_ID field (defined by Fibre Channel Standards) of the frame has bits 23-16 set to zero. If yes, then the loop is private S805, if not, the loop is public S806.
[0098] FIG. 8 is only to provide an example of how the present invention may be used for various data capture situations and is not intended to limit the present invention to discover a public or private loop.
[0099] In one aspect of the present invention, a data capture port is integrated with a traditional communication port and hence operates as a communication/data capture port. Also, due to intelligent frame filtering, a large set of buffers is not always needed for data capture and hence this reduces the overall cost of the system.
[0100] 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed:
1. A method for capturing data in a communication port of a fibre channel switch element in a computer network, the method comprising:
a processor in the switch element detecting a condition for enabling data capture;
the processor, in response to the detected condition, setting a control bit to enable the communication port to capture data; and
capturing data in the communication port based on the set control bit, and regardless of whether the communication port has available buffer-to-buffer credit;
wherein data capture comprises collecting information from the computer network; and
wherein buffer-to-buffer credit limits a number of frames that the communication port may receive before a source port stops sending frames, the source port being a communication port in the computer network that sends frames.
2. The method of claim 1, wherein incoming data is sampled to determine what level of data capture may be required.
3. The method of claim 2, wherein incoming data is sampled to determine if the data is from a private or public loop.
4. A fibre channel switch element in a computer network, comprising:
a diagnostic port in the switch element configured to act as both a traditional communication port and a data capture port depending on the incoming frame data; and
a processor in the switch element;
wherein the processor is configured to detect a condition for enabling data capture by the diagnostic port to capture data; and
wherein the diagnostic port is configured to capture data based on the set control bit, and regardless of whether the diagnostic port has available buffer-to-buffer credit;
wherein data capture comprises collecting information from computer network; and
wherein buffer-to-buffer credit limits a number of frames that the diagnostic port may receive before a source port in another network device stops sending frames, the source port being a communication port in the computer network that sends frames.
5. The switch element of claim 4, wherein the processor is configured to filter incoming frames to enable data capture.
6. The switch element of claim 5, wherein the processor is configured to use frame filtering to determine if a frame is from a public or private loop.
7. The switch element of claim 6, wherein the processor is configured to use a frame source address field (S_ID) to determine if the loop is private or public.
8. The method of claim 3, wherein the processor is configured to use a frame source address field (S_ID) to determine if the loop is private or public.
Patent Citations (316)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4162375(A) | 1979-07-01 | Schilichte | Applicant |
| US4200929(A) | 1980-04-01 | Davidjuk et al. | Applicant |
| US4258418(A) | 1981-03-01 | Heath | Applicant |
| US4344132(A) | 1982-08-01 | Dixon et al. | Applicant |
| US4382159(A) | 1983-05-01 | Bowditch | Applicant |
| US4425640(A) | 1984-01-01 | Philip et al. | Applicant |
| US4546468(A) | 1985-10-01 | Christmas et al. | Applicant |
| US4569043(A) | 1986-02-01 | Simmons et al. | Applicant |
| US4691296(A) | 1987-09-01 | Struger | Applicant |
| US4716561(A) | 1987-12-01 | Angell et al. | Applicant |
| US4725835(A) | 1988-02-01 | Schreiner et al. | Applicant |
| US4821034(A) | 1989-04-01 | Anderson et al. | Applicant |
| US4860193(A) | 1989-08-01 | Bentley et al. | Applicant |
| US4980857(A) | 1990-12-01 | Walter et al. | Applicant |
| US5025370(A) | 1991-06-01 | Koegel et al. | Applicant |
| US5051742(A) | 1991-09-01 | Hullett et al. | Applicant |
| US5115430(A) | 1992-05-01 | Hahne et al. | Applicant |
| US5144622(A) | 1992-09-01 | Takiyasu et al. | Applicant |
| US5258751(A) | 1993-11-01 | DeLuca et al. | Applicant |
| US5260933(A) | 1993-11-01 | Rouse | Applicant |
| US5260935(A) | 1993-11-01 | Turner | Applicant |
| US5367520(A) | 1994-11-01 | Cordell | Applicant |
| US5425022(A) | 1995-06-01 | Clark et al. | Applicant |
| US5537400(A) | 1996-07-01 | Diaz et al. | Applicant |
| US5579443(A) | 1996-11-01 | Tatematsu et al. | Applicant |
| US5590125(A) | 1996-12-01 | Acampora et al. | Applicant |
| US5594672(A) | 1997-01-01 | Hicks | Applicant |
| US5598541(A) | 1997-01-01 | Malladi | Applicant |
| US5610745(A) | 1997-03-01 | Bennett | Applicant |
| US5666483(A) | 1997-09-01 | McClary | Applicant |
| US5677909(A) | 1997-10-01 | Heide | Applicant |
| US5687172(A) | 1997-11-01 | Cloonan et al. | Applicant |
| US5732206(A) | 1998-03-01 | Mendel | Applicant |
| US5748612(A) | 1998-05-01 | Stoevhase et al. | Applicant |
| US5764927(A) | 1998-06-01 | Murphy et al. | Applicant |
| US5768271(A) | 1998-06-01 | Seid et al. | Applicant |
| US5768533(A) | 1998-06-01 | Ran | Applicant |
| US5784358(A) | 1998-07-01 | Smith et al. | Applicant |
| US5790545(A) | 1998-08-01 | Holt et al. | Applicant |
| US5818842(A) | 1998-10-01 | Burwell et al. | Applicant |
| US5821875(A) | 1998-10-01 | Lee et al. | Applicant |
| US5822300(A) | 1998-10-01 | Johnson et al. | Applicant |
| US5825748(A) | 1998-10-01 | Barkey et al. | Applicant |
| US5828475(A) | 1998-10-01 | Bennett et al. | Applicant |
| US5835752(A) | 1998-11-01 | Chiang et al. | Applicant |
| US5850386(A) | 1998-12-01 | Anderson et al. | Applicant |
| US5892604(A) | 1999-04-01 | Yamanaka et al. | Applicant |
| US5925119(A) | 1999-07-01 | Maroney | Applicant |
| US5936442(A) | 1999-08-01 | Liu et al. | Applicant |
| US5954796(A) | 1999-09-01 | McCarty et al. | Applicant |
| US5974547(A) | 1999-10-01 | Klimenko | Applicant |
| US5978379(A) | 1999-11-01 | Chan et al. | Applicant |
| US5987028(A) | 1999-11-01 | Yang et al. | Applicant |
| US5999528(A) | 1999-12-01 | Chow et al. | Applicant |
| US6011779(A) | 2000-01-01 | Wills | Applicant |
| US6014383(A) | 2000-01-01 | McCarty | Applicant |
| US6021128(A) | 2000-02-01 | Hosoya et al. | Applicant |
| US6031842(A) | 2000-02-01 | Trevitt et al. | Applicant |
| US6046979(A) | 2000-04-01 | Bauman | Applicant |
| US6047323(A) | 2000-04-01 | Krause | Applicant |
| US6061360(A) | 2000-05-01 | Miller et al. | Applicant |
| US6081512(A) | 2000-06-01 | Muller et al. | Applicant |
| US6108738(A) | 2000-08-01 | Chambers et al. | Applicant |
| US6108778(A) | 2000-08-01 | LaBerge | Applicant |
| US6118776(A) | 2000-09-01 | Berman | Applicant |
| US6128292(A) | 2000-10-01 | Kim et al. | Applicant |
| US6134127(A) | 2000-10-01 | Kirchberg | Applicant |
| US6144668(A) | 2000-11-01 | Bass et al. | Applicant |
| US6147976(A) | 2000-11-01 | Shand et al. | Applicant |
| US6151644(A) | 2000-11-01 | Wu | Applicant |
| US6158014(A) | 2000-12-01 | Henson | Applicant |
| US6160813(A) | 2000-12-01 | Banks et al. | Applicant |
| US6185203(B1) | 2001-02-01 | Berman | Applicant |
| US6201787(B1) | 2001-03-01 | Baldwin et al. | Applicant |
| US6209089(B1) | 2001-03-01 | Selitrennikoff et al. | Applicant |
| US6229822(B1) | 2001-05-01 | Chow et al. | Applicant |
| US6230276(B1) | 2001-05-01 | Hayden | Applicant |
| US6240096(B1) | 2001-05-01 | Book | Applicant |
| US6253267(B1) | 2001-06-01 | Kim et al. | Applicant |
| US6286011(B1) | 2001-09-01 | Velamuri et al. | Applicant |
| US6289002(B1) | 2001-09-01 | Henson et al. | Applicant |
| US6301612(B1) | 2001-10-01 | Selitrennikoff et al. | Applicant |
| US6307857(B1) | 2001-10-01 | Yokoyama et al. | Applicant |
| US6308220(B1) | 2001-10-01 | Mathur | Applicant |
| US6311204(B1) | 2001-10-01 | Mills et al. | Applicant |
| US6324181(B1) | 2001-11-01 | Wong et al. | Applicant |
| US6330236(B1) | 2001-12-01 | Ofek et al. | Applicant |
| US6333932(B1) | 2001-12-01 | Kobayasi et al. | Applicant |
| US6335935(B2) | 2002-01-01 | Kadambi 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 |
| US6397360(B1) | 2002-05-01 | Bruns | Applicant |
| US6401128(B1) | 2002-06-01 | Stai et al. | Examiner |
| US6404749(B1) | 2002-06-01 | Falk | 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 |
| US6421342(B1) | 2002-07-01 | Schwartz et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6424658(B1) | 2002-07-01 | Mathur | Applicant |
| US6438628(B1) | 2002-08-01 | Messerly et al. | Applicant |
| US6449274(B1) | 2002-09-01 | Holden et al. | Applicant |
| US6452915(B1) | 2002-09-01 | Jorgensen | Applicant |
| US6467008(B1) | 2002-10-01 | Gentry et al. | Applicant |
| US6470026(B1) | 2002-10-01 | Pearson et al. | Applicant |
| US6509988(B1) | 2003-01-01 | Saito | Applicant |
| US6522656(B1) | 2003-02-01 | Gridley | Applicant |
| US6532212(B1) | 2003-03-01 | Soloway et al. | Applicant |
| US6553036(B1) | 2003-04-01 | Miller et al. | Examiner |
| US6570850(B1) | 2003-05-01 | Gutierrez et al. | Applicant |
| US6570853(B1) | 2003-05-01 | Johnson et al. | Applicant |
| US6594231(B1) | 2003-07-01 | Byham et al. | Applicant |
| US6597691(B1) | 2003-07-01 | Anderson et al. | Applicant |
| US6597777(B1) | 2003-07-01 | Ho | Applicant |
| US6606690(B2) | 2003-08-01 | Padovano | Applicant |
| US6614796(B1) | 2003-09-01 | Black et al. | Applicant |
| US6622206(B1) | 2003-09-01 | Kanamaru et al. | Applicant |
| US6629161(B2) | 2003-09-01 | Matsuki et al. | Applicant |
| US6643298(B1) | 2003-11-01 | Brunheroto et al. | Applicant |
| US6684209(B1) | 2004-01-01 | Ito et al. | Applicant |
| US6697359(B1) | 2004-02-01 | George | Applicant |
| US6697914(B1) | 2004-02-01 | Hospodor et al. | Applicant |
| US6718497(B1) | 2004-04-01 | Whitby-Strevens | Applicant |
| US6744772(B1) | 2004-06-01 | Eneboe et al. | Applicant |
| US6760302(B1) | 2004-07-01 | Ellinas et al. | Applicant |
| US6779083(B2) | 2004-08-01 | Ito et al. | Applicant |
| US6785241(B1) | 2004-08-01 | Lu et al. | Applicant |
| US6807181(B1) | 2004-10-01 | Weschler | Applicant |
| US6816750(B1) | 2004-11-01 | Klaas | Applicant |
| US6859435(B1) | 2005-02-01 | Lee et al. | Applicant |
| US6865155(B1) | 2005-03-01 | Wong et al. | Examiner |
| US6865157(B1) | 2005-03-01 | Scott et al. | Applicant |
| US6888831(B1) | 2005-05-01 | Hospodor et al. | Applicant |
| US6901072(B1) | 2005-05-01 | Wong | Applicant |
| US6904507(B2) | 2005-06-01 | Gil | Applicant |
| US6922408(B2) | 2005-07-01 | Bloch et al. | Applicant |
| US6928470(B1) | 2005-08-01 | Hamlin | Applicant |
| US6934799(B2) | 2005-08-01 | Acharya et al. | Applicant |
| US6941357(B2) | 2005-09-01 | Nguyen et al. | Applicant |
| US6941482(B2) | 2005-09-01 | Strong | Applicant |
| US6947393(B2) | 2005-09-01 | Hooper, III | Examiner |
| US6952659(B2) | 2005-10-01 | King et al. | Applicant |
| US6968463(B2) | 2005-11-01 | Pherson et al. | Applicant |
| US6975627(B1) | 2005-12-01 | Parry et al. | Applicant |
| US6987768(B1) | 2006-01-01 | Kojima et al. | Applicant |
| US6988130(B2) | 2006-01-01 | Blumenau et al. | Applicant |
| US6988149(B2) | 2006-01-01 | Odenwald | Applicant |
| US7000025(B1) | 2006-02-01 | Wilson | Applicant |
| US7002926(B1) | 2006-02-01 | Eneboe et al. | Applicant |
| US7010607(B1) | 2006-03-01 | Bunton | Applicant |
| US7024410(B2) | 2006-04-01 | Ito et al. | Applicant |
| US7031615(B2) | 2006-04-01 | Genrile | 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. | Examiner |
| US7050392(B2) | 2006-05-01 | Valdevit | Applicant |
| US7051182(B2) | 2006-05-01 | Blumenau et al. | Applicant |
| US7055068(B2) | 2006-05-01 | Riedl | Applicant |
| US7061871(B2) | 2006-06-01 | Sheldon et al. | Applicant |
| US7076569(B1) | 2006-07-01 | Bailey et al. | Applicant |
| US7092374(B1) | 2006-08-01 | Gubbi | Applicant |
| US7110394(B1) | 2006-09-01 | Chamdani et al. | Applicant |
| US7120728(B2) | 2006-10-01 | Krakirian et al. | Applicant |
| US7124169(B2) | 2006-10-01 | Shimozono et al. | Applicant |
| US7150021(B1) | 2006-12-01 | Vajjhala 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 |
| US7187688(B2) | 2007-03-01 | Garmire et al. | Applicant |
| US7188364(B2) | 2007-03-01 | Volpano | Applicant |
| US7190667(B2) | 2007-03-01 | Susnow et al. | Applicant |
| US7194538(B1) | 2007-03-01 | Rabe et al. | Applicant |
| US7200108(B2) | 2007-04-01 | Beer et al. | Applicant |
| US7200610(B1) | 2007-04-01 | Prawdiuk et al. | Examiner |
| US7209478(B2) | 2007-04-01 | Rojas et al. | Applicant |
| US7215680(B2) | 2007-05-01 | Mullendore et al. | Applicant |
| US7221650(B1) | 2007-05-01 | Cooper et al. | Applicant |
| US7230929(B2) | 2007-06-01 | Betker et al. | Applicant |
| US7233985(B2) | 2007-06-01 | Hahn et al. | Applicant |
| US7245613(B1) | 2007-07-01 | Winkles et al. | Applicant |
| US7248580(B2) | 2007-07-01 | George et al. | Applicant |
| US7263593(B2) | 2007-08-01 | Honda et al. | Applicant |
| US7266286(B2) | 2007-09-01 | Tanizawa et al. | Applicant |
| US7269131(B2) | 2007-09-01 | Cashman et al. | Applicant |
| US7269168(B2) | 2007-09-01 | Roy et al. | Applicant |
| US7277431(B2) | 2007-10-01 | Walter et al. | Applicant |
| US7287063(B2) | 2007-10-01 | Baldwin et al. | Applicant |
| US7292593(B1) | 2007-11-01 | Winkles et al. | Applicant |
| US7315511(B2) | 2008-01-01 | Morita et al. | Applicant |
| US7327680(B1) | 2008-02-01 | Kloth | Applicant |
| US7346707(B1) | 2008-03-01 | Erimli | Applicant |
| US7352740(B2) | 2008-04-01 | Hammons et al. | Applicant |
| US7397788(B2) | 2008-07-01 | Mies et al. | Applicant |
| US7406034(B1) | 2008-07-01 | Cometto et al. | Applicant |
| US7471691(B2) | 2008-12-01 | Black et al. | Examiner |
| US2001/0011357(A1) | 2001-08-01 | Mori | Applicant |
| US2001/0033552(A1) | 2001-10-01 | Barrack et al. | Applicant |
| US2001/0038628(A1) | 2001-11-01 | Ofek et al. | Applicant |
| US2001/0043564(A1) | 2001-11-01 | Bloch et al. | Applicant |
| US2002/0016838(A1) | 2002-02-01 | Geluc et al. | Applicant |
| US2002/0034178(A1) | 2002-03-01 | Schmidt et al. | Applicant |
| US2002/0071387(A1) | 2002-06-01 | Horiguchi et al. | Applicant |
| US2002/0103913(A1) | 2002-08-01 | Tawil et al. | Applicant |
| US2002/0104039(A1) | 2002-08-01 | DeRolf et al. | Applicant |
| US2002/0118692(A1) | 2002-08-01 | Oberman et al. | Applicant |
| US2002/0122428(A1) | 2002-09-01 | Fan et al. | Applicant |
| US2002/0124124(A1) | 2002-09-01 | Matsumoto et al. | Applicant |
| US2002/0147560(A1) | 2002-10-01 | Devins et al. | Applicant |
| US2002/0147843(A1) | 2002-10-01 | Rao | Examiner |
| US2002/0156918(A1) | 2002-10-01 | Valdevit et al. | Applicant |
| US2002/0159385(A1) | 2002-10-01 | Susnow et al. | Applicant |
| US2002/0172195(A1) | 2002-11-01 | Pekkala et al. | Applicant |
| US2002/0174197(A1) | 2002-11-01 | Schimke et al. | Examiner |
| US2002/0191602(A1) | 2002-12-01 | Woodring et al. | Applicant |
| US2002/0194294(A1) | 2002-12-01 | Blumenau et al. | Applicant |
| US2002/0196773(A1) | 2002-12-01 | Berman | Applicant |
| US2003/0002516(A1) | 2003-01-01 | Boock 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/0033487(A1) | 2003-02-01 | Pfister 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/0063567(A1) | 2003-04-01 | Dehart | Applicant |
| US2003/0072316(A1) | 2003-04-01 | Niu et al. | Applicant |
| US2003/0076788(A1) | 2003-04-01 | Grabauskas et al. | Applicant |
| US2003/0079019(A1) | 2003-04-01 | Lolayekar et al. | Applicant |
| US2003/0084219(A1) | 2003-05-01 | Yao et al. | Examiner |
| US2003/0086377(A1) | 2003-05-01 | Berman | Applicant |
| US2003/0091062(A1) | 2003-05-01 | Lay et al. | Applicant |
| US2003/0093607(A1) | 2003-05-01 | Main et al. | Applicant |
| US2003/0103451(A1) | 2003-06-01 | Lutgen et al. | Applicant |
| US2003/0112819(A1) | 2003-06-01 | Kofoed et al. | Applicant |
| US2003/0115355(A1) | 2003-06-01 | Cometto et al. | Examiner |
| US2003/0117961(A1) | 2003-06-01 | Chuah et al. | Applicant |
| US2003/0118053(A1) | 2003-06-01 | Edsall et al. | Applicant |
| US2003/0120743(A1) | 2003-06-01 | Coatney et al. | Applicant |
| US2003/0120791(A1) | 2003-06-01 | Weber et al. | Applicant |
| US2003/0120983(A1) | 2003-06-01 | Vieregge et al. | Applicant |
| US2003/0126223(A1) | 2003-07-01 | Jenne et al. | Applicant |
| US2003/0126242(A1) | 2003-07-01 | Chang | Applicant |
| US2003/0131105(A1) | 2003-07-01 | Czeiger et al. | Applicant |
| US2003/0137941(A1) | 2003-07-01 | Kaushik et al. | Applicant |
| US2003/0139900(A1) | 2003-07-01 | Robison | Applicant |
| US2003/0172149(A1) | 2003-09-01 | Edsall et al. | Applicant |
| US2003/0172239(A1) | 2003-09-01 | Swank | Applicant |
| US2003/0174652(A1) | 2003-09-01 | Ebata | Applicant |
| US2003/0174721(A1) | 2003-09-01 | Black 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/0179755(A1) | 2003-09-01 | Fraser | Examiner |
| US2003/0189930(A1) | 2003-10-01 | Terrell et al. | Applicant |
| US2003/0189935(A1) | 2003-10-01 | Warden et al. | Applicant |
| US2003/0191857(A1) | 2003-10-01 | Terell et al. | Applicant |
| US2003/0195983(A1) | 2003-10-01 | Krause | Applicant |
| US2003/0198238(A1) | 2003-10-01 | Westby | Applicant |
| US2003/0218986(A1) | 2003-11-01 | DeSanti et al. | Applicant |
| US2003/0229808(A1) | 2003-12-01 | Heintz et al. | Applicant |
| US2003/0236953(A1) | 2003-12-01 | Grieff et al. | Applicant |
| US2004/0013088(A1) | 2004-01-01 | Gregg | Applicant |
| US2004/0013092(A1) | 2004-01-01 | Betker et al. | Applicant |
| US2004/0013113(A1) | 2004-01-01 | Singh et al. | Applicant |
| US2004/0013125(A1) | 2004-01-01 | Betker et al. | Applicant |
| US2004/0015638(A1) | 2004-01-01 | Bryn | Applicant |
| US2004/0028038(A1) | 2004-02-01 | Anderson et al. | Applicant |
| US2004/0054776(A1) | 2004-03-01 | Klotz et al. | Applicant |
| US2004/0054866(A1) | 2004-03-01 | Blumenau et al. | Applicant |
| US2004/0057389(A1) | 2004-03-01 | Klotz et al. | Applicant |
| US2004/0064664(A1) | 2004-04-01 | Gil | Applicant |
| US2004/0081186(A1) | 2004-04-01 | Warren et al. | Applicant |
| US2004/0081196(A1) | 2004-04-01 | Elliott | Applicant |
| US2004/0081394(A1) | 2004-04-01 | Biren et al. | Applicant |
| US2004/0085955(A1) | 2004-05-01 | Walter et al. | Applicant |
| US2004/0085974(A1) | 2004-05-01 | Mies et al. | Applicant |
| US2004/0085994(A1) | 2004-05-01 | Warren et al. | Applicant |
| US2004/0092278(A1) | 2004-05-01 | Diepstraten 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/0141518(A1) | 2004-07-01 | Milligan et al. | Applicant |
| US2004/0141521(A1) | 2004-07-01 | George | Applicant |
| US2004/0151188(A1) | 2004-08-01 | Maveli et al. | Applicant |
| US2004/0153526(A1) | 2004-08-01 | Haun et al. | Applicant |
| US2004/0153914(A1) | 2004-08-01 | El-Batal | Applicant |
| US2004/0174813(A1) | 2004-09-01 | Kasper et al. | Applicant |
| US2004/0202189(A1) | 2004-10-01 | Arndt et al. | Applicant |
| US2004/0208201(A1) | 2004-10-01 | Otake | Applicant |
| US2004/0218531(A1) | 2004-11-01 | Cherian et al. | Examiner |
| 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/0047334(A1) | 2005-03-01 | Paul et al. | Applicant |
| US2005/0073956(A1) | 2005-04-01 | Moores et al. | Applicant |
| US2005/0076113(A1) | 2005-04-01 | Klotz et al. | Applicant |
| US2005/0088969(A1) | 2005-04-01 | Carlsen et al. | Applicant |
| US2005/0108444(A1) | 2005-05-01 | Flauaus et al. | Applicant |
| US2005/0111845(A1) | 2005-05-01 | Nelson et al. | Applicant |
| US2005/0117522(A1) | 2005-06-01 | Basavaiah et al. | Applicant |
| US2005/0177641(A1) | 2005-08-01 | Yamagami | Applicant |
| US2005/0198523(A1) | 2005-09-01 | Shanbhag et al. | Applicant |
| US2006/0013248(A1) | 2006-01-01 | Mujeeb et al. | Applicant |
| US2006/0034192(A1) | 2006-02-01 | Hurley et al. | Applicant |
| US2006/0034302(A1) | 2006-02-01 | Peterson | Applicant |
| US2006/0143300(A1) | 2006-06-01 | See et al. | Applicant |
| US2006/0184711(A1) | 2006-08-01 | Pettey | Applicant |
| US2006/0203725(A1) | 2006-09-01 | Paul et al. | Applicant |
| US2006/0274744(A1) | 2006-12-01 | Nagai et al. | Applicant |
| US2007/0206502(A1) | 2007-09-01 | Martin et al. | Applicant |
| EP649098 | 1994-09-01 | Applicant | |
| EP856969 | 1998-01-01 | Applicant | |
| WO-98/36537 | 1998-08-01 | Applicant | |
| WO-01/95566 | 2001-12-01 | Applicant |
Non-Patent Literature (149)
- 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
- 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
- U.S. Appl. No. 10/266,360, filed Oct. 7, 2002, Method And System For Reducing Congestion In Computer Networks.Applicant
- U.S. Appl. No. 10/241,153, filed Sep. 11, 2002, Zone Management In A Multi-Module Fibre Channel Switch.Applicant
- U.S. Appl. No. 10/263,858, filed Oct. 2002, Method And System For Using Distributed Name Servers In Multi-Module Fibre Channel Switching.Applicant
- U.S. Appl. No. 10/212,425, filed Aug. 5, 2002, Method And System For Flexible Routing In A Fibre Channel System.Applicant
- U.S. Appl. No. 10/302,149, filed Nov. 22, 2002, Method And System For Controlling Packet Flow In Networks.Applicant
- U.S. Appl. No. 10/894,579, filed Jul. 20, 2004, Method and System for Managing Traffic in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/894,546, filed Jul. 20, 2004, Method and System for Routing and Filtering Network Data Packets in Fibre Channel Systems.Applicant
- U.S. Appl. No. 10/894,827, filed Jul. 20, 2004, Method and System for Selecting Virtual Lanes in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/894,597, filed Jul. 20, 2004, Programmable Pseudo Virtual Lanes for Fibre Channel Systems.Applicant
- U.S. Appl. No. 10/894,595, filed Jul. 20, 2004, Method and System for Reducing Latency and Congestion in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/664,548, filed Sep. 19, 2003, Buffer to Buffer Credit Recovery for In-Line Fibre Channel Credit Extension Devices.Applicant
- U.S. Appl. No. 10/895,175, filed Jul. 20, 2004, Method and System for Detecting Congestion and Over Subscription in a Fibre Channel Network.Applicant
- U.S. Appl. No. 10/894,492, filed Jul. 20, 2004, LUN Based Hard Zoning in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/894,587, filed Jul. 20, 2004, Multi Speed Cut Through Operation in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/894,726, filed Jul. 20, 2004, Method and System for Improving Bandwidth & Reducing Idles in Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/894,629, filed Jul. 20, 2004, Method and System for Routing Fibre Channel Systems.Applicant
- U.S. Appl. No. 10/894,491, filed Jul. 20, 2004, Method and System for Keeping a Fibre Channel Arbitrated Loop Open During Frame Gaps.Applicant
- U.S. Appl. No. 10/894,536, filed Jul. 20, 2004, Method And System For Congestion Control Based On Optimum Bandwidth Allocation In A Fibre Channel Switch.Applicant
- U.S. Appl. No. 10/894,627, filed Jul. 20, 2004, Method and System for Programmable Data Dependent Network Routing.Applicant
- U.S. Appl. No. 10/719,077, filed Nov. 21, 2003, Method and System for Monitoring Events in Storage Area Networks.Applicant
- U.S. Appl. No. 10/894,689, filed Jul. 20, 2004, Method and System for Power Control of Fibre Channel Switches.Applicant
- U.S. Appl. No. 10/798,527, filed Mar. 11, 2004, Method and System for Preventing Deadlock in Fibre Channel Fabrics using Frame Priorities.Applicant
- U.S. Appl. No. 10/798,468, filed Mar. 11, 2004, Method and System for Reducing Deadlock in Fibre Channel Fabrics using Virtual Lanes.Applicant
- U.S. Appl. No. 10/894,586, filed Jul. 20, 2004, Method and System for Buffer to Buffer Credit recovery in Fibre Channel Systems Using Virtual and/or Pseudo Virtual Lane.Applicant
- U.S. Appl. No. 10/889,337, filed Jul. 12, 2004, Method And System For Minimizing Disruption In Common-Access Networks.Applicant
- U.S. Appl. No. 10/889,259, filed Jul. 12, 2004, Method And Apparatus For Detecting And Removing Orphaned Primitives In A Fibre Channel Network.Applicant
- U.S. Appl. No. 10/889,267, filed Jul. 12, 2004, Method And System For Fibre Channel Arbitrated Loop Acceleration.Applicant
- U.S. Appl. No. 10/889,551, filed Jul. 12, 2004, Method And Apparatus For Testing Loop Pathway Integrity In A Fibre Channel Arbitrated Loop.Applicant
- U.S. Appl. No. 10/889,256, filed Jul. 12, 2004, Method And Apparatus For Accelerating Receive-Modify-Send Frames In A Fibre Channel Network.Applicant
- U.S. Appl. No. 10/889,255, filed Jul. 12, 2004, Method and Apparatus for Test Pattern Generation.Applicant
- U.S. Appl. No. 10/889,588, filed Jul. 12, 2004, Method And Apparatus For Improving Buffer Utilization In Communication Networks.Applicant
- U.S. Appl. No. 10/894,597, filed Jul. 20, 2004, Method And System For Using Extended Fabric Features With Fibre Channel Switch Elements.Applicant
- U.S. Appl. No. 10/894,978, filed Jul. 20, 2004, Method And System for Programmable Data Dependent.Applicant
- U.S. Appl. No. 10/894,917, filed Jul. 20, 2004, Method and System for Configuring Fibre Channel Ports.Applicant
- U.S. Appl. No. 10/894,529, filed Jul. 20, 2004, Integrated Fibre Channel Fabric Controller.Applicant
- U.S. Appl. No. 10/894,732, filed Jul. 20, 2004, Method And System For Congestion Control In A Fibre Channel Switch.Applicant
- U.S. Appl. No. 10/957,465, filed Oct. 1, 2004, Method and System for Using Boot Servers in Fibre Channel Network Routing.Applicant
- U.S. Appl. No. 10/956,717, filed Oct. 1, 2004, Method and System for Transferring Data directly between storage devices in a Storage Area Networks.Applicant
- U.S. Appl. No. 10/956,501, filed Oct. 1, 2004, High Speed Fibre Channel Switch Elements.Applicant
- U.S. Appl. No. 10/956,502, filed Oct. 1, 2004, Method and System for LUN Remapping in Fibre Channel Networks.Applicant
- U.S. Appl. No. 10/961,463, filed Oct. 8, 2004, Fibre Channel Transparent Switch For Mixed Switch Fabrics.Applicant
- U.S. Appl. No. 10/956,718, filed Oct. 1, 2004, Method and System for Using an In-Line Credit Extender with a Host Bus Adapter.Applicant
- “Office Action from USPTO dated Mar. 5, 2008 for U.S. Appl. No. 10/889,259”.Applicant
- “Office Action from USPTO dated Mar. 7, 2008 for U.S. Appl. No. 10/894,629”.Applicant
- “Notice of Allowance from USPTO dated Jan. 8, 2008 for U.S. Appl. No. 10/889,551”.Applicant
- “Notice of Allowance from USPTO dated Feb. 8, 2008 for U.S. Appl. No. 10/894,529”.Applicant
- “Office Action from USPTO dated Jan. 9, 2008 for U.S. Appl. No. 10/798,468”.Applicant
- “Office Action from USPTO dated Jan. 9, 2008 for U.S. Appl. No. 11/608,634”.Applicant
- “Notice of Allowance from USPTO dated Jan. 11, 2008 for U.S. Appl. No. 10/664,548”.Applicant
- “Notice of Allowance from USPTO dated Jan. 10, 2008 for U.S. Appl. No. 10/263,858”.Applicant
- “Office Action from USPTO dated Mar. 20, 2008 for U.S. Appl. No. 10/894,732”.Applicant
- “Examination Report from the European Patent Office dated Oct. 12, 2007 for European Application No. 05 805 632.6”.Applicant
- “Office Action from USPTO dated Oct. 18, 2006 for U.S. Appl. No. 10/241,153”.Applicant
- “Office Action from USPTO dated Apr. 6, 2007 for U.S. Appl. No. 10/956,718”.Applicant
- “Office Action from USPTO dated Oct. 3, 2007 for U.S. Appl. No. 10/956,717”.Applicant
- “Office Action from USPTO dated Jun. 1, 2007 for U.S. Appl. No. 10/961,463”.Applicant
- Malavalli, et al., “Fibre Channel Framing and Signaling (FC-FS) REV 1.10”, NCITS working draft proposed American National Standard for Information Technology, (Jan. 25, 2001).Applicant
- “Office Action from USPTO dated Jan. 19, 2006 for U.S. Appl. No. 10/212,425”.Applicant
- “Office Action from USPTO dated Dec. 5, 2006 for U.S. Appl. No. 10/212,425”.Applicant
- “Office Action from USPTO dated May 21, 2007 for U.S. Appl. No. 10/212,425”.Applicant
- “Office Action from USPTO dated Sep. 6, 2007 for U.S. Appl. No. 10/889,337”.Applicant
- “Office Action from USPTO dated Dec. 7, 2007 for U.S. Appl. No. 10/961,463”.Applicant
- “Notice of Allowance from USPTO dated Dec. 21, 2007 for U.S. Appl. No. 10/961,463”.Applicant
- “Notice of Allowance from USPTO dated Dec. 20, 2007 for U.S. Appl. No. 10/889,337”.Applicant
- “Office Action from USPTO dated Apr. 3, 2007 for U.S. Appl. No. 10/241,153”.Applicant
- “Office Action from USPTO dated Nov. 16, 2007 for U.S. Appl. No. 10/241,153”.Applicant
- “Office Action from USPTO dated Nov. 15, 2006 for U.S. Appl. No. 10/263,858”.Applicant
- “Office Action from USPTO dated Jul. 11, 2007 for U.S. Appl. No. 10/263,858”.Applicant
- “Office Action from USPTO dated Jan. 19, 2007 for U.S. Appl. No. 10/302,149”.Applicant
- “Office Action from USPTO dated Aug. 20, 2007 for U.S. Appl. No. 10/302,149”.Applicant
- “Office Action from USPTO dated Jul. 3, 2007 2007 for U.S. Appl. No. 10/664,548”.Applicant
- “Office Action from USPTO dated Sep. 20, 2007 for U.S. Appl. No. 10/798,527”.Applicant
- “Office Action from USPTO dated Sep. 20, 2007 for U.S. Appl. No. 10/889,267”.Applicant
- “Office Action from USPTO dated Mar. 21, 2006 for U.S. Appl. No. 10/889,588”.Applicant
- “Office Action from USPTO dated Sep. 10, 2007 for U.S. Appl. No. 10/889,255”.Applicant
- “Office Action from USPTO dated Sep. 4, 2007 for U.S. Appl. No. 10/889,551”.Applicant
- “Office Action from USPTO dated Sep. 20, 2007 for U.S. Appl. No. 10/889,259”.Applicant
- “Office Action from USPTO dated Sep. 19, 2007 for U.S. Appl. No. 10/894,492”.Applicant
- “Office Action from USPTO dated Oct. 4, 2007 for U.S. Appl. No. 10/894,627”.Applicant
- “Office Action from USPTO dated Oct. 25, 2007 for U.S. Appl. No. 10/894,491”.Applicant
- “Office Action from USPTO dated Oct. 23, 2007 for U.S. Appl. No. 10/894,597”.Applicant
- “Office Action from USPTO dated Oct. 25, 2007 for U.S. Appl. No. 10/894,579”.Applicant
- “Office Action from USPTO dated Oct. 11, 2007 for U.S. Appl. No. 10/894,629”.Applicant
- “Office Action from USPTO dated Oct. 25, 2007 for U.S. Appl. No. 10/894,536”.Applicant
- “Office Action from USPTO dated Nov. 13, 2007 for U.S. Appl. No. 10/894,586”.Applicant
- “Office Action from USPTO dated Oct. 17, 2007 for U.S. Appl. No. 10/894,917”.Applicant
- “Office Action from USPTO dated Jun. 28, 2007 for U.S. Appl. No. 10/894,529”.Applicant
- “Office Action from USPTO dated Sep. 14, 2007 for U.S. Appl. No. 10/894,978”.Applicant
- “Office Action from USPTO dated Apr. 4, 2008 for U.S. Appl. No. 10/957,465”.Applicant
- “Notice of Allowance from USPTO dated Apr. 10, 2008 for U.S. Appl. No. 10/241,153”.Applicant
- “Office Action from USPTO dated Apr. 11, 2008 for U.S. Appl. No. 10/894,595”.Applicant
- “Office Action from USPTO dated Apr. 14, 2008 for U.S. Appl. No. 10/894,627”.Applicant
- “Office Action from USPTO dated Apr. 17, 2008 for U.S. Appl. No. 10/894,689”.Applicant
- “Notice of Allowance from USPTO dated Apr. 18, 2008 for U.S. Appl. No. 10/894,597”.Applicant
- “Final Office Action from USPTO dated Apr. 23, 2008 for U.S. Appl. No. 10/889,255”.Applicant
- “Final Office Action from USPTO dated Apr. 25, 2008 for U.S. Appl. No. 10/894,579”.Applicant
- “Final Office Action from USPTO dated Apr. 1, 2008 for U.S. Appl. No. 10/956,717”.Applicant
- “Office Action from USPTO dated Apr. 3, 2008 for U.S. Appl. No. 10/894,587”.Applicant
- “Notice of Allowance from USPTO dated Apr. 4, 2008 for U.S. Appl. No. 11/608,634”.Applicant
- “Final Office Action from USPTO dated Jun. 4, 2008 for U.S. Appl. No. 10/894,978”.Applicant
- “Final Office Action from USPTO dated Jun. 5, 2008 for U.S. Appl. No. 10/889,267”.Applicant
- “Final Office Action from USPTO dated Jun. 10, 2008 for U.S. Appl. No. 10/894,586”.Applicant
- “Office Action from USPTO dated Jun. 25, 2008 for U.S. Appl. No. 10/895,175”.Applicant
- “Notice of Allowance from USPTO dated Jun. 25, 2008 for U.S. Appl. No. 10/894,491”.Applicant
- “Notice of Allowance from USPTO dated Jun. 27, 2008 for U.S. Appl. No. 10/956,717”.Applicant
- “Office Action from USPTO dated Jun. 26, 2008 for U.S. Appl. No. 10/894,547”.Applicant
- “Office Action from USPTO dated Jun. 27, 2008 for U.S. Appl. No. 10/894,726”.Applicant
- “Final Office Action from USPTO dated Jul. 9, 2008 for U.S. Appl. No. 10/894,917”.Applicant
- “Notice of Allowance from USPTO dated Jul. 9, 2008 for U.S. Appl. No. 10/894,629”.Applicant
- “Notice of Allowance from USPTO dated Jul. 9, 2008 for U.S. Appl. No. 10/894,579”.Applicant
- “Notice of Allowance from USPTO dated Jul. 17, 2008 for U.S. Appl. No. 10/894,536”.Applicant
- “Office Action from USPTO dated Jul. 25, 2008 for U.S. Appl. No. 10/894,827”.Applicant
- “Office Action from State Intellectual Property Office (SIPO) of China for Chinese application 200580032889.0”.Applicant
- “Final Office Action from USPTO dated Aug. 4, 2008 for U.S. Appl. No. 10/894,732”.Applicant
- “Notice of Allowance from USPTO dated Aug. 18, 2008 for U.S. Appl. No. 10/889,259”.Applicant
- “Final Office Action from USPTO dated Aug. 20, 2008 for U.S. Appl. No. 10/798,468”.Applicant
- “Office Action from USPTO dated Sep. 18, 2008 for U.S. Appl. No. 10/894,978”.Applicant
- “Office Action from USPTO dated Sep. 23, 2008 for U.S. Appl. No. 12/031,585”.Applicant
- “Notice of Allowance from USPTO dated Sep. 29, 2008 for U.S. Appl. No. 10/889,267”.Applicant
- “Non-Final Office Action from USPTO dated Oct. 10, 2008 for U.S. Appl. No. 10/894,627”.Applicant
- “Notice of Allowance from USPTO dated Oct. 8, 2008 for U.S. Appl. No. 10/889,255”.Applicant
- “Notice of Allowance from USPTO dated Oct. 8, 2008 for U.S. Appl. No. 10/798,527”.Applicant
- “Notice of Allowance from USPTO dated Oct. 15, 2008 for U.S. Appl. No. 10/894,492”.Applicant
- “Final Office Action from USPTO dated Oct. 17, 2008 for U.S. Appl. No. 10/894,595”.Applicant
- “Final Office Action from USPTO dated Nov. 13, 2008 for U.S. Appl. No. 10/894,587”.Applicant
- “Office Action from USPTO dated Nov. 13, 2008 for U.S. Appl. No. 10/894,917”.Applicant
- “Office Action from USPTO dated Nov. 26, 2008 for U.S. Appl. No. 10/956,502”.Applicant
- “Office Action from USPTO dated Nov. 26, 2008 for U.S. Appl. No. 10/894,547”.Applicant
- “Final Office Action from USPTO dated Dec. 24, 2008 for U.S. Appl. No. 10/894,726”.Applicant
- “Office Action from USPTO dated Dec. 23, 2008 for U.S. Appl. No. 10/798,468”.Applicant
- “Notice of Allowance from USPTO dated Dec. 30, 2008 for U.S. Appl. No. 11/037,922”.Applicant
- “Office Action from USPTO dated May 15, 2008 for U.S. Appl. No. 10/798,527”.Applicant
- “Final Office Action from USPTO dated Apr. 29, 2008 for U.S. Appl. No. 10/894,491”.Applicant
- “Final Office Action from USPTO dated May 12, 2008 for U.S. Appl. No. 10/894,492”.Applicant
- “Office Action from USPTO dated May 14, 2008 for U.S. Appl. No. 10/956,502”.Applicant
- “Office Action from USPTO dated May 2, 2008 for U.S. Appl. No. 11/037,922”.Applicant