Netapp, Inc.

Network Appliance, Inc.

Mehul S Shah

Szu-Wen Kuo

J Eric Mowat

Robert M English

Jason Ansel Lango

David Hitz

William McGovern

James J Voll

Daniel Ting

Yasuhiro Endo

Information representing a plurality of clients on a network is stored in a data structure. The data structure may be stored within a server or agent in a content delivery network and may include client network address information. The data structure is dynamically compressed based on network proximity information relating to the clients.

Proximity based lossless compression of client information in a network device

Multiple domains are created for processes of a storage server. The processes are capable of execution on a plurality of processors in the storage server. The domains include a first domain, which includes multiple threads that can execute processes in the first domain in parallel, to service data access requests. A data set managed by the storage server is logically divided into multiple subsets, and each of the subsets is assigned to exactly one of the threads in the first domain, for processing of data access requests directed to the data set.

Mutual exclusion domains to perform file system processes on stripes

A method and apparatus for a rumor based protocol for distributed state synchronization between request routing servers have been described. State synchronization is maintained between routing servers via agents that respond with information requested by the servers.

Method and apparatus for a rumor based protocol for distributed state synchronization between request routing servers

The invention includes a method for selecting a replicated node from a domain of replicated nodes in a computer network. The method comprises maintaining a list of the replicated nodes; receiving a name resolution request to resolve a name for the domain into a network address; selecting one of the replicated nodes based on predefined selection criteria and in response to the name resolution request; and sending a network address of the selected replicated node to a network address associated with the name resolution request.

Node selection within a network based on policy

A method and apparatus for estimating relative network proximity between request routing agents and client agents are described herein. In one embodiment, the method includes a proximity estimation unit to send a first number of probe messages to a client agent without waiting to receive a reply message, wherein the proximity estimation unit is to receive a first set of reply messages. The apparatus also including a proximity verification unit coupled with the proximity estimation unit, to send a second number of probe messages to the client agent, and to receive a second set of reply messages.

Method and apparatus for estimating relative network proximity in the presence of a network filter

In a technique for compressing data, a data storage server receives a set of data, which includes a first number of subsets. The storage server defines a number of compression groups for the set of data, each compression group including multiple entries, each entry containing a pointer to a different subset of the set of data. At least part of the set of data is then compressed into a smaller number of subsets. For each of the subsets which does not contain compressed data after the compression, a predetermined value is stored in the corresponding entry of the corresponding compression group, to indicate that corresponding data is compressed and represented elsewhere in the compression group. The predetermined value may also indicate which compression algorithm was used to compress the data.

In a data storage server, for each subsets which does not contain compressed data after the compression, a predetermined value is stored in the corresponding entry of the corresponding compression group to indicate that corresponding data is compressed

Growing community of inventors

Milpitas, CA, United States of America

Mehul S Shah