Abstract: A system and method for improving the efficiency of the transmission of updated blocks generated by logging all the block allocations and deletes as well as CPs and PCPI creation and deletion in a persistent log. The log is scanned during each update cycle (in which changes are transmitted to a destination mirror) by the storage operating system, and only changed blocks that are referenced by the file system as it existed at the end of the update cycle or referenced by PCPIs that existed at the end of the update cycle are actually sent in the transmission. This reduces the number of changes being transmitted.

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.

Abstract: A system and method integrates a persistent reply cache with operation of a file system executing on a storage system. In an illustrative embodiment, the persistent reply cache is embodied as a file comprising a combination of contents of (i) one or more enhanced non-volatile log records of non-volatile electronic storage, (ii) “dirty” in-core buffer cache data structures, and (iii) on-disk data structures corresponding to those dirty buffer cache data structures. Integration is achieved through atomic operation of the reply cache with the file system to store information associated with a reply, e.g., to a client request, on electronic storage implemented as in-core buffer cache memory of the storage system, as well as on magnetic storage implemented as disks of the system.

Abstract: A security appliance that encrypts and decrypts information is installed in each of redundant multi-paths between a host system and a back up tape storage system. The host system is arranged to detect failures in a primary path to the tape system being used. When the failure is detected, the host system enables transfers to the same tape system through an alternative path. Encryption keys and host/tape designators (identifiers) are broadcast among the security appliances in the alternative data paths. When the host system switches from the primary path to the secondary path, even though the secondary security appliance did not generate the encryption keys, the secondary path security appliance will have such keys and will properly encrypt and transfer data from the host to the tape system. The secondary will also properly retrieve encrypted data from the tape system, decrypt it and deliver it to the host. All of these operations will be transparent (invisible) to a running application in the host.

Abstract: A system for enhancing location estimates by movable rovers including one or more base stations that engage in two way time transfer (TWTT) with the rovers. Each TWTT operation between a given base station and a given rover provides range measurements and clock differences between the base station and rover. The range measurements are based on the travel time of return TWTT signals and the clock differences are based on a phase offset of a code in the return TWTT signal and/or timing information included in the return TWTT signals.

Abstract: A bonding apparatus and method holds first and second bodies peripherally, one above the other, on respective shelves. A lower heat-transfer body is configured to lift the first body from below and press the first and second bodies against an upper heat-transfer body to enable bonding between the first and second bodies.

Abstract: A serializer/deserializer interfaces a microprocessor/controller with I/O devices over a flexible hinging cable. The I/O devices have parallel interfaces as does the controller but the serializer/deserializer reduces the number of signal that traverse the flexible hinging cable. LCD displays, cameras, keypads and audio signals handled by the invention.

Abstract: In one embodiment, Traffic Engineering (TE) is configured on a provider edge device to customer edge device (PE-CE) link extending from a provider edge device (PE) in a provider network to a customer edge device (CE) in a customer network. TE information regarding the TE-configured PE-CE link is conveyed from the PE to one or more other nodes in the provider network. TE information regarding one or more other TE-configured PE-CE links is received from one or more other nodes. A TE database (TED) is expanded to include information for the one or more other TE-configured PE-CE links. TE is applied to a customer edge device to customer edge device (CE-CE) path using at least some of the information for the one or more other TE-configured PE-CE links included in the TED.

Abstract: Embodiments of the present invention provide a method, system, and computer program product for optimizing I/O operations performed by a storage server operating on behalf of multiple clients to access data on a plurality of storage devices (disks). Embodiments of the present invention eliminate the need for selected read operations to write new data to physical data blocks by zeroing the physical data blocks to which new data will be written. Additionally, the need for reading old parity to compute new parity is eliminated. Instead, new parity is computed from the data to be written without the need of old parity or the storage server sends a command to a disk that stores parity. A module implemented at the disk that stores parity executes the command without reading, by the storage server, old parity. Eliminating the need for reading old data and for reading old parity eliminates some rotation latency and improves overall system's performance.

Abstract: In one embodiment, a limited amount of financial information related to each of a plurality of financial instruments is displayed on a display screen of a computer. A user chooses a financial instrument of the plurality of financial instruments. A plurality of elements are shown on the display screen, each being associated with a different type of additional information supplemental of the limited amount of financial information. Each element is associated with a preferred remote data source chosen by the user. When a particular element is chosen by the user, additional information of the type associated with the particular element related to the chosen financial instrument is retrieved by constructing a uniform resource locator (URL) that combines a first financial instrument-independent URL portion that is specific to the preferred remote data source and a second financial instrument-specific URL portion that is specific to the chosen financial instrument.

Abstract: A technique transfers data over a packet-switched network (PSN), comprising a plurality of intermediate nodes, in a manner that does not require that the intermediate nodes support a network layer infrastructure. A network controller coupled to the intermediate nodes acquires topology information associated with the PSN's topology. This information may include pseudo-wire definitions, ingress and egress interface information, ingress and egress labels, and so on. The network controller generates a transport database from the topology information and distributes the transport database to the intermediate nodes. An intermediate node acquires the transport database information and configures a packet-processing engine (PPE), contained within the intermediate node, to process packets acquired by the intermediate node.

Abstract: A system and method administers security in a logical namespace of a storage system environment. A remote agent performs an integral security-related role within a management framework that is directed to off-loading administration of privileges from a namespace and storage management (NSM) server for namespace and storage management. NSM server rights are defined and assigned to a user of the NSM server in accordance with a security administration feature of the management framework. In addition, a multi-stage authentication procedure is provided to ensure that a user has the appropriate rights to perform operations on the NSM server.

Abstract: An advanced clock synchronization technique is adapted for use with a replication service in a data backup and recovery storage environment. The storage environment includes a plurality of source storage systems and target storage systems, wherein the source storage systems are illustratively embodied as source replication nodes. The advanced clock synchronization technique establishes a software-only, loosely-accurate global clock based on a timestamp and an associated error boundary. Notably, the timestamp and its error boundary are used as global clock information to enable synchronization (i.e., ordering of storage requests) among the source replication nodes and/or the target storage systems, thereby ensuring consistent replication of the storage requests on the target storage systems.

Abstract: A trimmable component network of switched parallel paths is described, each path contains a component, typically a resistor, with a portion of the component bypassed by fuses. The bypassed portion represents the same percentage of the component's value for each of the trimmable components in the parallel paths. A component is measured against a specification and if the specification is not met a prescribed number of fuses are cut to bring the component within its specification. A TRIM CODE may be used to identify the specific fuses to be cut, and thus the specific fuses that are to remain intact. The same TRIM CODE is applied to the components in the parallel paths.

Abstract: A technique efficiently manages bandwidth (BW) registration for multiple spanning tree options in a computer network. According to the novel technique, an entry bridge determines multiple spanning tree paths to other bridges of the network (namely, one or more available spanning trees rooted at one or more bridges of the network) and determines a utilized (registered) BW on each of those paths. Upon receiving a request to initiate BW registration for a data flow to a destination end point, e.g., from an application source end point, the entry bridge selects one of the spanning tree paths to utilize for the data flow. Selection of the spanning tree path from among the multiple available paths may be based on (i) available bandwidth of the paths, (ii) a shortest of the paths, and (iii) a lowest bridge identifier ID for the bridge root for the path. The entry bridge sends a registration message for the data flow towards the destination end point along the selected spanning tree path.