Abstract: A system for simultaneously treating multiple workpieces is configured with treatment sites, configured to hold respective workpieces, fixed on a rotatable base. Treatment stations are equipped with respective active components operable simultaneously to treat respective workpieces identically on respective aligned treatment sites. For loading and unloading the treatment sites are rotated through distinct loading and unloading stations of the treatment stations which allow loading of a second batch while a first batch is being unloaded.

Abstract: Embodiments of the present invention disclose a technique for providing an indication whether data stored on a disk drive are invalid. As used herein, invalid data are data written prior to the disk drive being added to an array of the disk drives or data in a block that has become free and which has been removed from the corresponding parity block of the stripe. Knowing that the disk drive was written prior to the drive being added to the existing array or having data which has become invalid allows a storage server to ignore the invalid data and not to use it when computing parity (i.e., a data protection value computed as a result of a logical operation on data blocks in a stripe in the array of disk drives). This, in turn, eliminates the need to zero disk drives or to perform parity re-computation prior to using the disk drives.

Abstract: A system and method provides a single system image for a clustered storage network including techniques for processing data access commands between storage appliances over the cluster interconnect. The system is configured such that the cluster is assigned a single world wide nodename. Requests coming to the cluster from client initiators are directed to one or the storage appliances in the cluster, i.e. the “receiving” storage appliance. Commands received by the receiving storage appliance are examined to determine LUN value(s) in the request. If the LUN value is associated with a local storage device, the request is processed by the receiving storage appliance. If the LUN value is not associated with the receiving storage appliance, the request is conveyed over the cluster interconnect to the partner storage appliance to be processed and the appropriate data written or retrieved.

Abstract: A technique dynamically applies a link utilization based policy to traffic traversing links in a computer network. According to the novel technique, a link utilization threshold is assigned to one or more links. The link utilization threshold may be, for example, a maximum amount of traffic for an individual link, or a maximum difference between links (e.g., for load balanced traffic). The link utilization of the one or more links may be monitored, such as, e.g., by an optimized edge routing (OER) process. In the event that the link utilization surpasses the threshold, the link is considered to be out-of-policy (OOP), and traffic may be redirected to other available links accordingly in order to bring the link back in policy (“IN-POLICY”).

Abstract: A system and method for providing a rule based engine in a routing operating system. The system includes a set of predefined events, a set of predefined conditions and a set of predefined actions. An operator of an operating system may generate a new rule by selecting one of the predefined events, a predefined condition to be tested and an action to perform in response to an outcome of the test of the condition. The rule is then stored in memory by a router operating system and is performed when the predefined event occurs.

Abstract: In one embodiment, a tunnel mesh probe, initiated for a computer network having a tunnel mesh, may be received at a first tail-end node of a probed tunnel. In response, the first tail-end node processes the probe, and forwards the probe to another tail-end node of a non-probed tunnel selected from a plurality of tunnels of the tunnel mesh for which the first tail-end node is a head-end node. Illustratively, once the probe is received at its initiating node, and in response to determining that the initiating node is a head-end node for only probed tunnels, the tunnel mesh probe is completed, having probed all tunnels of the tunnel mesh.

Abstract: A system and method enables remote execution of a program, such as a debugger, using a remote management module. A packet daemon executing on the remote management module packetizes data received from a client and forwards it to a packet daemon executing on a computer, which receives the packet and forwards data contained therein to the program. Data from the program is packetized by the packet daemon executing on the computer and transmitted to the packet daemon executing on the remote management module, which forwards the data to a program specific daemon on the remote management module for forwarding to the client.

Abstract: Both an on screen display and a physical programmable remote control have buttons whose functionality may be dynamically reassigned in accordance with a user's navigation through menu levels, states or across different services. The physical programmable remote control, in conjunction with a TV or other video display, provides an intuitive, heads up experience for the user and eliminates the need for multiple physical remote controls. User profiles and zones may be used to customize a user's remote control functionality based on preferences, access controls, location and the like.

Abstract: In one embodiment, providing multi-layer address security incorporating Layer 2 Media Access Control (MAC) addresses and corresponding Layer 3 Internet Protocol (IP) addresses for host machines on a routed access network is provided.

Abstract: In one embodiment, a node (e.g., a grooming node) determines a set of attribute groups (AGs) of existing child tunnels through the network, where an AG is a group of one or more compatible attributes among child tunnels, e.g., excluding bandwidth. The grooming node also determines a set of corresponding child tunnels that belong to a particular AG and that follow a shared path segment through the network, and may establish an hierarchical tunnel that encapsulates the set of corresponding child tunnels along the shared path segment. In another embodiment, a node requests that the one or more intermediate nodes of the hierarchical tunnel each remove the state of a child tunnel without sending any error messages, and sends refresh messages encapsulated within the hierarchical tunnel in a manner that allows a tail-end node to continue any necessary propagation of refresh messages along the child tunnel.

Abstract: A portable water filtration system that interconnects two, otherwise separate, water bottles arranged vertically such that water flows under gravitational pressure from a first water bottle through a filter configured to capture small particle impurities to a second water bottle and removes small particle impurities before they enter the second water bottle. The filtration system is implemented within a cap that can attach to a variety of standard water bottles, such as NALGENE™ water bottles. A removable connector ring attaches to the cap to connect a second water bottle to the system. When vertically aligned, water flows from a first water bottle through the filter element in the cap to the second water bottle to remove small and large particles.

Abstract: The invention relates to a method and a system for detecting the risk of icing on aerodynamic surfaces lapped by a fluid flow (F), in particular on load-bearing surfaces of fluid machines, of the type comprising a temperature sensor (20). The system is characterized in that the temperature sensor (20) is located close to the aerodynamic surface (5S) to be monitored for detecting the temperature of the surface (5S), and that the system comprises a rain sensor (30) located close to the surface (5S) for detecting the presence of water on that surface (5S). The system can thus detect the risk of icing on aerodynamic surfaces.

Abstract: An apparatus and method for managing the distribution and expansion of public keys held by a group or array of systems in white lists. The addition of a new system to the array entails a manual input to authorize the introduction of the new system to one trusted system in the array. After the introduction the new system is trusted by the one member and the white list of the one member is loaded into the white list of the new system. The new system then requests joining each of the other systems in the array. For each system in the array asked by the new system, the systems in the array ask if any other systems in the array already trust the new member. In response, a system of the array that trusts the new system responds by sending its white list (containing the public key of the new system) to the requesting system. Eventually the public key of the new system is in the white lists of all the systems in the array.

Abstract: A novel technique for improving throughput in a multi-core system (and in a virtual machine environment) in which data is processed according to a producer-consumer relationship by eliminating latencies caused by compulsory cache misses. A producer process is executed on one processor core and two or more instances of a consumer process are executed on different cores so that while the first instance of a consumer process is executed in a “consuming” mode to process a first subset of data elements produced by the producer process, a second instance of the consumer process pre-fetches, to its cache memory, a second subset of data items produced by the producer process. As a result, the second subset of data items is already cached at the core where the second instance is running even before the consumer process starts processing the second subset of data items.

Abstract: A system and method for authorizing administrative operations in a computer is provided. The computer initiates the split knowledge protocol upon an attempt by an administrator to invoke the operations. The administrator identifies a predetermined number of entities designated to authorize the operation. The computer creates a bit sequence and splits the bit sequence into a number of segments equal to the predetermined number of entities. Each entity thereafter decrypts a respective element to essentially authorize invocation of the operations. In response, the computer processes the decrypted segments to re-create the bit sequence. As an added level of security, the computer coma) pares the re-created bit sequence with the originally created sequence and, if they match, performs the operations.

Abstract: A system and method administers virtual servers executing on one or more physical storage systems. One or more virtual servers are created and associated with a management group. An administrator is then granted permissions to the group. Upon logging into management software, only information relating to the virtual servers associated with the group are displayed to the administrator, thereby limiting access to information related to other virtual servers and/or physical storage systems.

Abstract: A database design modeling system for managing data facets for design scenarios as a collection of hierarchical unitized data alternatives is provided. The database design model allows for easy access to data while providing a single persistant location for any one specific data record, thereby reducing any problems associated with conventional data duplication. Further, all data stored within the database is unitized thus eliminating the need for the user to do the unit mapping.

Abstract: In one embodiment, a routing node (e.g., a head-end node) determines a desire to route a selected tunnel (e.g., reroute), and computes a path for the selected tunnel. The routing node probes the path to discover information about tunnels that would be displaced by the selected tunnel if routed over the path (e.g., a number of tunnels), and correspondingly determines whether to establish the selected tunnel based on the information about the tunnels to be displaced. In another embodiment, intermediate nodes along the probed path of the selected tunnel may receive a probe (e.g., signaling message) requesting information about the tunnels that would be displaced by the selected tunnel. In response, each intermediate node inserts the information about the tunnels to be displaced at the intermediate node into the probe, and forwards the probe (e.g., toward the routing node initiating the probe).

Abstract: A technique dynamically responds to non-network events at a network device in a computer network. According to the novel technique, one or more sensors automatically detect (sense) one or more non-network events, and notifications of the non-network events are then transmitted over the network. One or more network devices (e.g., data centers, servers, routers, etc.) detect the notifications of the network events, and dynamically respond to the non-network events based on one or more associated policies. For example, one or more network-based policies may be defined that modify one or more network configuration parameters in response to the non-network events. Alternatively or in addition, one or more physical-based policies may be defined that instruct one or more network-attached physical control devices to modify one or more physical parameters.