Abstract: For dynamic capacity allocation of stripes in cluster-based storage system, a storage controller identifies a storage stripe in a cluster-based storage system that has a smallest stripe score of a plurality of storage stripes. The storage controller also identifies a storage stripe in the cluster-based storage system that has a largest stripe score of the plurality of storage stripes, and reallocates, in response to a difference between the largest stripe score and the smallest stripe score being less than a threshold value, free-space capacity from a donator stripe to a receiver stripe.

Abstract: Interpolated search is provided for navigating a compressed file to identify a desired offset in an uncompressed version of the file by: determining a low point and a high point in an uncompressed version of a stream corresponding to a compressed version of the stream that is divided into a plurality of chunks; calculating an average compression ratio between the low point and the high point; interpolating a position in the compressed version of a desired offset in the uncompressed version to identify a bifurcation chunk of the plurality of chunks that includes the interpolated position; reading an offset of the bifurcation chunk; and in response to determining that the desired offset is within a threshold distance of the offset of the bifurcation chunk, decompressing the compressed version from the bifurcation chunk until the desired offset is output.

Abstract: For dynamic capacity allocation of stripes in cluster-based storage system, a storage controller identifies a storage stripe in a cluster-based storage system that has a smallest stripe score of a plurality of storage stripes. The storage controller also identifies a storage stripe in the cluster-based storage system that has a largest stripe score of the plurality of storage stripes, and reallocates, in response to a difference between the largest stripe score and the smallest stripe score being less than a threshold value, free-space capacity from a donator stripe to a receiver stripe.

Abstract: Embodiments of the present invention provide a method for storing small volumes of data within a grid-scale storage system. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method, computer program product, and system for storing small volumes of data. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method for storing small volumes of data within a grid-scale storage system. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method, computer program product, and system for storing small volumes of data. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method for storing small volumes of data within a grid-scale storage system. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method for storing small volumes of data within a grid-scale storage system. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: Embodiments of the present invention provide a method for storing small volumes of data within a grid-scale storage system. The method includes creating a container within a storage disk. The method includes distributing data evenly between storage disks. A partition is created within the container. Data is received and stored in the partition, wherein the partition is at least as large as the data. The method may also include setting an offset associated with the partition to allow for partition expansion.

Abstract: A method for intercepting data of a network session passing between a first node and a second node on a data network, comprising the steps of: (i) providing an interceptor on a third node of the network; (ii) monitoring data passing between the first node and the second node; (iii) synchronizing the network data between the interceptor and the first and second nodes; (iv) creating a first socket on the interceptor for communicating with the first node and a second socket on the interceptor for communicating with the second node, and (v) intercepting the data so that data flowing between first and second nodes passes through the interceptor.

Abstract: A method of transferring data objects over a network comprises intercepting a network transfer message with a passing object, creating a unique identifier for the object using a predetermined function, the same function having been used to provide identifiers for objects stored at predetermined nodes of said network, removing the object and sending on the network transfer message with the unique identifier in place of the object. Then, at the recipient end it is possible to obtain the unique identifier and use it as a key to search for a corresponding object in the local nodes. The search starts with a node closest to the recipient and steadily spreads outwards. The object when found is reattached for the benefit of the recipient and network bandwidth has been saved by the avoidance of redundant transfer since the object is brought to the recipient from the node which is the closest to him.

Abstract: A method of transferring data objects over a network comprises intercepting a network transfer message with a passing object, creating a unique identifier for the object using a predetermined function, the same function having been used to provide identifiers for objects stored at network nodes, removing the object and sending on the network transfer message with the unique identifier in place of the object. Then, at the recipient end it is possible to obtain the unique identifier and use it as a key to search for a corresponding object in the local nodes. The search starts with a node closest to the recipient and steadily spreads outwards. The object when found is reattached for the benefit of the recipient and network bandwidth has been saved by the avoidance of redundant transfer since the object is brought to the recipient from the node which is the closest to him.

Abstract: A method of transferring data objects over a network comprises intercepting a network transfer message with a passing object, creating a unique identifier for the object using a predetermined function, the same function having been used to provide identifiers for objects stored at predetermined nodes of said network, removing the object and sending on the network transfer message with the unique identifier in place of the object. Then, at the recipient end it is possible to obtain the unique identifier and use it as a key to search for a corresponding object in the local nodes. The search starts with a node closest to the recipient and steadily spreads outwards. The object when found is reattached for the benefit of the recipient and network bandwidth has been saved by the avoidance of redundant transfer since the object is brought to the recipient from the node which is the closest to him.

Abstract: A method for intercepting data of a network session passing between a first node and a second node on a data network, comprising the steps of: (i) providing an interceptor on a third node of the network; (ii) monitoring data passing between the first node and the second node; (iii) synchronizing the network data between the interceptor and the first and second nodes; (iv) creating a first socket on the interceptor for communicating with the first node and a second socket on the interceptor for communicating with the second node, and (v) intercepting the data so that data flowing between first and second nodes passes through the interceptor.