Abstract: A technique avoids Internet Protocol (IP) lookup with Multipoint-to-Multipoint (MP2MP) Label Switched Paths (LSPs) in a computer network. According to the novel technique, end nodes of an MP2MP LSP determine a root node of the MP2MP LSP for a particular IP stream, e.g., based on a rendezvous point (RP) of the IP stream. The root node of the MP2MP LSP allocates an inner-label for the particular IP stream, and informs each of the end nodes of the inner-label for that stream. When any one of the end nodes thereafter sources traffic for the particular IP stream, the sourced traffic contains the allocated inner-label for the stream. Upon receiving the traffic for the particular IP stream, an end node may determine the IP stream to which the received traffic belongs based on the MP2MP LSP (e.g., indicated by an outer-label) and the inner-label, i.e., without performing an IP lookup operation.

Abstract: An overmolded article and process for camouflaging or layering the overmolded article, e.g. hunting equipment, etc., is described. The camouflaged or layered areas run continuously from outside to beneath the overmolded areas on the article so there are no lines of edges where the camouflaged or layered areas end and the overmolding areas begin.

Abstract: Apparatus for detecting thermal radiation emanating from two different intracranial depths in a patient includes a dual-mode transducer having a working surface for placement against a patient's cranium. The transducer includes a first antenna with an aperture adjacent the working surface that first antenna being tuned to a first frequency and producing a first output signal indicative of thermal radiation received within an antenna pattern extending a selected first distance from the working surface and a second antenna having a second aperture adjacent to the working surface within the first aperture. The second antenna is tuned to a second frequency and produces a second output signal indicative of thermal radiation received within an antenna pattern extending a selected second distance from the working surface, the second distance being shorter than the first distance.

Abstract: A data storage system has two computers. Each computer is assigned to a set of data. Two copies of each set of data are maintained. A first copy is stored on a first set of disks and a second copy is stored on a second set of disks. Each time that a data is written by a computer, a label is written to each set of disks, the label having fields for a status of each computer, a first ordinal which is increased each time that a new data is written, and a time stamp giving a time at which the last write was performed. After failure of a computer, a processor determines, in response to reading the labels of the first set of disks and the second set of disks, the most up to date copy of the data assigned to the failed computer.

Abstract: A system and method proxies data access commands across a cluster interconnect between storage appliances in a cluster. Each storage appliance activates two ports for data access, a local port for data access requests directed to clients of the storage appliance and a proxy port for data access requests directed to the partner storage appliance. Clients utilizing multi-pathing software may send data access requests to either the local port of the storage appliance or the proxy port of the storage appliance.

Abstract: In one embodiment, a talker device may issue talker registrations to bridges of a network domain for a stream, the talker registration having at least a bandwidth requirement and a state of the talker registration as either offering or failed. Also, a listener device may issue listener registrations for a stream, the listener registration having at least a state of the listener registration as one of asking, asking-failed, ready, or ready-failed. In response to receiving a talker registration and listener registration for the same stream, a bridge of the network domain may then attempt to allocate resources for the stream if the bridge is on a path of the stream between the talker device and the listener device. The bridge may then notify, via respective states of the talker and listener registrations, the talker device and the listener device of whether resources have been allocated for the stream.

Abstract: In one embodiment, a bridge may receive a first convergence proposal on a root port from an upstream adjacent bridge of a computer network, and in response, may transmit a second convergence proposal downstream on each non-edge designated port of the bridge without syncing the non-edge designated ports. The bridge may then return a convergence agreement to the adjacent bridge in response to the non-edge designated ports having received a returned convergence agreement (or in response to having only edge designated ports). Also, according to embodiments, the adjacent bridge blocks a link to the root port until the convergence proposal(s) and agreement(s) travel end-to-end.

Abstract: A network caching system has a multi-protocol caching filer coupled to an origin server to provide storage virtualization of data served by the filer in response to data access requests issued by multi-protocol clients over a computer network. The multi-protocol caching filer includes a file system configured to manage a sparse volume that “virtualizes” a storage space of the data to thereby provide a cache function that enables access to data by the multi-protocol clients. To that end, the caching filer further includes a multi-protocol engine configured to translate the multi-protocol client data access requests into generic file system primitive operations executable by both the caching filer and the origin server.

Abstract: A system to distribute accurate time and/or frequency over a network utilizing signals of opportunity transmitted by one or more local transmitters with known locations, the system includes a base receiver with a clock synchronized to a reference time scale such as GNSS or UTC time that saves a series of samples of the signals of opportunity and time tags the series with a calculated time of broadcast. A remote receiver saves samples of the signals of opportunity and correlates the series with the saved samples. The remote receiver calculates a time of transmission of saved samples that correspond to the series, determines a time offset as a difference in the time of broadcast calculated at the remote receiver and the time of broadcast calculated at the base receiver, and determines the time offset with respect to the base receiver.

Abstract: In one embodiment, the methods and apparatuses detect a user participating in a collaboration session; create a profile associated with the user; and detect an attribute associated with the profile based on the collaboration session.

Abstract: A system and method which generates a single use password based on a challenge/response protocol. A box manager module executing within a security appliance identifies a public key (P) and salt value (S) associated with an administrator's smart card and generates a random nonce (N). The box manager transmits a challenge comprising the following elements: <SHA1(N), BM_ID, P[N, BM_ID], S>. Upon receiving the challenge, the administration card decrypts P[N, BM_ID] using the private key contained within the card and computes SHA1(N). The administration card then compares its computed values with the received values from the box manager. If the values match, then to the administration card returns a response comprising the following elements: HMAC_N[user, SHA1 (password, S)], where HMAC_N represents the SHA1 keyed hash message authentication check of the response elements using the nonce N as the key.

Abstract: A method and system manages ownership information about disks in a storage network without the need for an emulated, partner mode system. The method and system provides for ownership information, including a current owner and a home owner for resources, such as disks, to be stored on each disk in a storage system, as well as to be stored in memory on each storage system node in the network. A further aspect of the invention is a disk homeness application program interface (API), which provides commands that can be utilized by an administrator at a host computer to set, modify and disco play ownership information about each disk in the cluster. Upon a takeover, any node in the network can takeover one or more disks by reading the ownership information stored on the disks or in the tables.

Abstract: A method and apparatus for managing a web cache system includes storage spaces allocated to web cache devices for storing cached information. Upon failure of a web cache device, the storage space allocated to that device is reallocated to a different operational device, so that the cached information in that reallocated storage space may be used.

Abstract: A system and method enables gradual transitioning of a server, such as a filer, to a new security domain and/or IP address scheme. A single physical platform may comprise multiple logical servers, such as virtual filers (vfilers), that simultaneously participate in different security domains and IP address schemes. Each logical server is allocated its own set of storage resources, such as volumes and qtrees, and network resources, such as network addresses. Additionally, a common set of storage resources may store a data set that is accessible to logical servers that participate in the different security domains and/or IP address schemes. Therefore, the server can transition from an old security domain to a new, e.g., upgraded, security domain, by gradually phasing out file access requests sent to a logical server in the old domain and redirecting those requests to a logical server in the new security domain.

Abstract: A versatile and efficient technique for classifying packets in an intermediate node. According to the technique, criteria and rules associated with the packet are applied to one or more classification stages containing content-addressable memories (CAMs). Each stage examines specific criteria associated with the packet, e.g., a packet field, and generates a rule and additional criteria. The additional rule and criteria are provided to the next classification stage. This process continues until a final rule is provided to a final classification stage. At the final classification stage, the final rule is used to generate an identifier, e.g., queue identifier (ID), associated with the classified packet.

Abstract: An anti-virus blade provides anti-virus services to a storage system and eliminates the need to develop an interface to initiate a scan operation at the blade. An anti-virus engine executed at the blade receives a request to scan data maintained by the storage system. The anti-virus engine creates a stub file (e.g., a file that has the same name as the Currently Amended file indicated in the request, but does not contain data) and issues an I/O command to the file. A file framework module executed at the blade intercepts the I/O to the dummy file and passes the I/O to an anti-virus application, which is registered with the file framework to receive I/Os from the anti-virus engine. The anti-virus application, in turn, initiates a scan operation by issuing a read request to the stub file, without receiving the request for scanning directly from the storage system.

Abstract: A computer storage system is described. A range of volume block numbers (VBNs) is assigned to a volume. A range of storage device block numbers (DBNs) is assigned to each of a plurality of storage devices. A first mapping parameters are created to map a first range of VBN numbers to a first selected range of DBNs using a first portion of a new storage device. A second mapping parameters are created to map a second range of VBN numbers to a second range of DBNs on a second portion of the new storage device.

Abstract: A SONET network terminated by routers includes working paths and backup paths. The routers pre-establishes in their link state data bases the links in both for both the working and backup paths. However, the links involved in the backup paths are given higher costs, then the links working paths, that the routers select only the links in the working path. If there is a failure in a link in a working path, an APS arrangement provides rapid switchover of the optical links so as to substitute one or more links in the corresponding backup path. This is accomplished by changing the relative costs of the working and backup links involved, so that the routers select the backup links for their routing tables.

Abstract: In one embodiment, a sliced tunnel is signaled between a head-end node and a tail-end node. One or more fork nodes along the sliced tunnel are configured to furcate the sliced tunnel into a plurality of child tunnels of the sliced tunnel. Also, one or more merge nodes along the sliced tunnel are configured to merge a plurality of child tunnels of the sliced tunnel that intersect at the merge node.

Abstract: In one embodiment, bridges in a computer network maintain a per-port mapping table for each of its ports, where each mapping table maps, for each virtual connection (of more than 4K) at a respective port, i) frame encapsulation fields that uniquely identify a particular virtual connection at the respective port to ii) a particular multiple spanning tree (MST) instance. The bridges may then compute a checksum of a particular mapping table for a particular port, and share the checksum with a corresponding port interconnected with the particular port (e.g., of another bridge). Upon determining that the mapping tables at the corresponding ports match in response to the checksums matching, frames may then be forwarded between the ports based on the particular mapping table.