Hewlett-packard Development Company, L.p.

Ciphermax, Incorporated

Richard Gunlock

Hawkins Yao

Michael L Witkowski

Greg John Pellegrino

Ram Ganesan Iyer

Po-Wei Tan

Dustin D Burris

Choon Seng Tan

Matthew Curley

Erick Labraca

A method of linking at least two network switches is disclosed, wherein each network switch switches data traffic of a plurality of devices, through a plurality of couplings. The method comprises the steps of generating a data stream including an identifier to be sent from a first to a second network switch, generating a number identifying one of the couplings from the identifier, and using the identified coupling for transfer of the data stream.

System and method for linking a plurality of network switches

Network processors controlled by software are used to implement the FC-1 and FC-2 layer functions. Each Network Processor comprises a fabric processor, an executive processor, channel processors and associated serial data processors. Special ASICs are not required since all of the Fiber Channel layers may be implementation with the network processors under software control.

Fibre channel implementation using network processors

A translating host bus interface adapter is capable of connecting a computer system as a compute node to a storage area network. The adapter has a processor and a memory system containing firmware for execution in the processor. The host bus adapter is capable of recognizing first and second types of redundant storage accessible over the storage area network and translating generic storage commands into translated commands suitable for communicating with either type of redundant storage, and forwarding the translated commands onto the storage area network. The translating host bus adapter is also capable of constructing and maintaining a mirrored dataset comprising copies on redundant storage systems of either or both types.

Translating device adapter having a common command set for interfacing multiple types of redundant storage devices to a host processor

A node for a storage area network has a processor, at least one port for connection to a storage area network, and a memory system. The memory system contains machine readable instructions for managing the at least one port, including instructions for determining a status associated with the at least one port capable of holding at least failed, probationary, normal and active status. For any failed port, the instructions include instructions for detecting a repair and when repair is detected for advancing the status to active or probationary status&#x2014;probationary status being set when no exchange is pending to a target node reachable only through the repaired port. For probationary ports, the instructions detect when the port operates without error for a predetermined period and advances the status from probationary to active or normal. Network exchanges are preferentially routed over an active or normal port, rather than transmitting them over probationary ports.

Method for recovery of paths between storage area network nodes with probationary period and desperation repair

An initiator node for a storage area network used with storage nodes having command queue capability maintains a current queue depth, and a maximum queue depth associated with each storage node. It initializing the maximum queue dependent on the type of the storage nodes it sees, and limits the number of commands queued to each storage node to the current queue depth associated with the storage node. It dynamically adjusts the current queue depth for each storage node based upon queue refusals generated by the storage nodes and the maximum queue depth associated with the storage nodes.

Apparatus and method for dynamic command queue depth adjustment for storage area network nodes

A network topology data structure resides in a memory system and is representative of topology of a fiber-channel network. The data structure has at least one device record with pointers for linking device records into a device list, information about a device accessible over the network, and pointers for locating a path link list. The data structure also has at least one node record having pointers for linking node records into a node list, node identity information, and pointers for locating device records. Path link lists, accessible through device records, have path links. Path links have pointers for linking path links into the path link list, and path status information corresponding to status of a path through the fiber channel network.

Growing community of inventors

Houston, TX, United States of America

Richard Gunlock