Abstract: A system and method for offloading network processes from main processors of a storage system and performing them on parallel processing modules. Embodiments of the present invention improve performance of a clustered storage system by performing certain network processes in an accelerator module of a storage system node. The accelerator module receives multi-protocol protocol data units (PDUs) from a network interface, performs protocol operations on the PDUs to form file system requests and passes the file system requests to a local D-module. If a file system request is directed to a non-local D-module in the cluster, the accelerator module repackages the request for transmission to the appropriate D-module and passes it back to the network without using local D-module processing resources or passing data over the system bus.

Abstract: A triple parity (TP) technique reduces overhead of computing diagonal and anti-diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of three storage devices in the array. The diagonal parity is computed along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. Similarly, the anti-diagonal parity is computed along anti-diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the anti-diagonal parity sets except one is stored on the anti-diagonal parity disk. The TP technique provides a uniform stripe depth and an optimal amount of parity information.

Abstract: A technique implements a novel high-speed high-density packet buffer utilizing a combination of high-speed and low-speed memory devices. The novel packet buffer is organized as a plurality of FIFO queues where each FIFO queue is associated with a particular input or output line. Each queue comprises a high-speed cache portion that resides in high-speed memory and a low-speed high-density portion that resides in low-speed high-density memory. The high-speed cache portion contains FIFO data that contains head and/or tail associated with the novel FIFO queue. The low-speed high-density portion contains FIFO data that is not contained in the high-speed cache portion.

Abstract: The present invention provides a novel coordinated shared storage architecture that permits the amortization of cost of the spares over any number of the storage systems and enables improvements to a number of storage system operations. The coordinated shared storage architecture comprises a plurality of storage systems disk shelves via a plurality of intermediate network devices, such as hubs. Each storage system includes a storage operating system having a target device driver module. The target device driver module permits the storage system to function as a SCSI target and thereby receive and process commands directed to it from other storage systems.

Abstract: An iSCSI name forwarding technique allows a security appliance to assume iSCSI names of one or more clients and one or more storage systems in a network. The security appliance is coupled between each client and storage system, and is configured to intercept a data access request issued by the client that is destined for the storage system. Each iSCSI name of the storage system is an iSCSI target name associated with secure storage, i.e., a cryptainer, served by the storage system, whereas the iSCSI name of the client is an iSCSI initiator name of the network entity, i.e., the client, which initiates the data access request to access data stored on the cryptainer.

Abstract: Apparatus for optically testing LEDs or other light-emitting components in a wide variety of test environments and to the degree necessary pertinent to the type(s) of faults encountered. In one embodiment, the present invention includes one or more fiber optic probes coupled to a multi-mode sensor unit, incorporating a photo-sensor coupled to a processor which may be programmed to provide a variety of test modes including simple on/off testing, color determination, color matching, wavelength and relative intensity among others. An extremely high sensitivity test mode is also provided for testing LEDs which emit very low intensity light in the microcandela range in products such as automobile/aircraft cockpit control panel lighted push-buttons for night-time viewing. The multi-mode sensor unit operates over a wide dynamic range and is capable of accurately testing LEDs that may be very dim to very bright without adjustment.

Abstract: The present invention employs identically sized mirror transistors arrange in groups that may be preferentially addressed and activated to determine the value of a resistor. Known current are directed through the resistor, and the voltage developed is measured by comparing against a reference voltage. The current is increased or decreased by the least significant value until the voltage across the resistor matches the reference voltage. A successive approximation or other known technique may be used instead. A reference current is developed that temperature stable and that is trimmed when manufactured to reduce process effects. The reference voltage may be constructed to be independent form a local power source so that the system is relatively independent of process, voltage and temperature, PVT.

Abstract: In one embodiment, a network device receives on a first port a first spanning tree protocol (STP) control message including a first path-tracking field corresponding to a given spanning tree instance in a network. The first path-tracking field includes a value based on one or more other network devices that have propagated the first STP control message. The network device receives on a second port a second STP control message including a second path-tracking field corresponding to the given spanning tree instance. The second path-tracking field includes a value based on one or more other network devices that have propagated the second STP control message. The network device utilizes the values from the first path-tracking field and the second path-tracking field to select a root port for the given spanning tree instance.

Abstract: A low maintenance reference electrode has a liquid junction body with a multiplicity of micron-sized capillary channels extending through the body for transporting electrolyte to a test solution. A viscosity-increasing agent thickens the electrolyte to limit its flow to a rate on the order of microliters/day so that a few milliliters of electrolyte suffice to provide an extended electrode life.

Abstract: A computer software program provides an algorithm that solves for unknown demands (and junction pressures) within a modeling system that uses a generalized, unified loop-node formulation. The program can be used to calculate the available demand (i.e., the amount of water that is to be supplied) according to the nodal pressure. Both nodal heads and flows are simultaneously solved using a gradient algorithm, which allows, in accordance with the present invention, the model to simulate situations where a change in pressure affects the quantity of water used. Criticality analyses for segments of a system in such pressure dependent scenarios can also be performed using the software program of the present invention.

Abstract: The present invention provides a mechanism for storing and accessing attributes of a data container (e.g., characteristics such as a name of a data container used to perform a lookup operation against the data container) in cache memory within storage systems in a cluster of storage systems. Further, a mechanism is provided so that an attribute of a data container is inserted into a cache memory of preferably one storage system (in the cluster) that caches metadata of the data container (e.g., information describing the data container). As a result, a lookup operation for a data container is directed to and served by the storage system that caches the metadata and the attribute of the data container. The lookup request is not relayed to a storage system that maintains a central directory of attributes of all data containers in the cluster.

Abstract: A system and method determines when the entries of a reply cache, organized into microcaches each of which is allocated to a client connection, may be retired or released, thereby freeing up memory structures. A plurality of connection statistics are defined and tracked for each microcache and for the entries of the microcache. The connection statistics indicate the value of the microcache and its entries to the client. The connection statistics include a measure of the time since the last idempotent or non-idempotent request (TOLR) was received, and a count of the number of idempotent requests that have been received since the last non-idempotent request (RISLR). A microcache with a TOLR time and a RISLR count that exceed respective thresholds may be expired and removed from the reply cache.

Abstract: A system and method enables one or more storage volumes and associated devices on one or more storage appliances (filers) to be combined or consolidated into arbitrary groups so that statistical information related to performance, operational status and other usage-based parameters can be made available to interested parties associated with the group. The volumes can drawn from different storage appliances and grouped so as to allow administration and access by a common group of administrators or users. The statistical information can be compared to threshold values to generate events. The events can be e-mailed or otherwise transmitted to interested parties. The statistical information can also be organized and displayed in a variety of formats as a web page on a graphical user interface that resides on a management station and/or client display of an interested party.

Abstract: A system for interleaving high speed data and slower data that is serialized and delivered to a microprocessor. The typical source of the high speed data is a camera and the source of the slower data is a keyboard. The high speed data and the slower data, illustratively, are interfaced with a micro-processor in a parallel fashion. The present invention mirrors the parallel interface to the microprocessor, and mirrors the parallel interface to the sources of the high speed (camera) and slower (keypad) data. The present system formats parallel data from the sources and passes that data in serial form, typically with a clock, on a flexible cable that joins two sections of many cell phones or other hand held devices.

Abstract: In one embodiment, multiple touch screen devices are driven from a graphics signal. A general-purpose computer provides a graphics signal of a particular display resolution. A display segmentor is configured to divide each graphics frame of the graphics signal into a plurality of pixel groups, each pixel group associated with a particular touch screen device of the plurality of touch screen devices. The display segmentor is further configured to generate an individual graphics signal from each pixel group, each individual graphics signal having a display resolution that is lower than the particular display resolution. One or more interfaces transmit each individual graphics signal to a different touch screen device of the plurality of touch screen devices.

Abstract: The invention provides for rekeying a large cluster of storage security appliances which allows more than two of the storage security appliances to proxy a single storage medium while encrypting the storage medium in a manner that is transparent to any attached server. The invention provides a method for synchronizing encryption of the disk among a large cluster of storage security appliances, while allowing all of the storage security appliances involved to access the storage device being rekeyed in a secure fashion.

Abstract: A technique performs route optimization of services provided by one or more service providers (SPs) for communication links that are combined in a computer network. According to the novel technique, performance characteristics and statistics (“link data”) for two or more combined links are merged to form link data for a single “virtual combined link.” Route optimization techniques (e.g., priority-based route optimization) may then be applied to one or more virtual combined links based on the combined link data, in addition to link data for zero or more conventional single links (physical or virtual). Illustratively, a route optimization technique may be used in accordance with the present invention to efficiently and accurately minimize costs associated with services provided by a plurality of SPs, wherein each SP charges for utilization of its service based on a tiered pricing structure.

Abstract: A technique for eliminating duplicate data is provided. Upon receipt of a new data set, one or more anchor points are identified within the data set. A bit-by-bit data comparison is then performed of the region surrounding the anchor point in the received data set with the region surrounding an anchor point stored within a pattern database to identify forward/backward delta values. The duplicate data identified by the anchor point, forward and backward delta values is then replaced in the received data set with a storage indicator.

Abstract: A multiple instance spanning tree protocol (MI-STP) creates a plurality of active topologies (i.e., loop-free paths) within a computer network. These active topologies may be established through the exchange and processing of multiple instance spanning tree bridge protocol data unit messages (MI-STP BPDUs) by the intermediate network devices within the network. The active topologies are preferably created independently of any virtual local area network (VLAN) designations defined within the network. Once the active topologies are defined, each VLAN designation is then mapped to a single active topology, although multiple VLAN designations are preferably mapped to the same active topology to provide load balancing.

Abstract: In one embodiment, a technique is used by a routing system to generate a link state identifier for a link state advertisement message. The routing system generates the link state advertisement message. A prefix length is read from the link state advertisement message. Further, a prefix is read from the link state advertisement message. A hash function is performed on the prefix and the length to produce a result by appending the length to the prefix to generate a combined value, inputting the combined value to a hash algorithm, and using at least a portion of an output of the hash algorithm as the result. The link state identifier is determined from the result of the hash function.