| Patent application number | Description | Published |
|---|
| 20080201335 | Method and Apparatus for Storing Data in a Peer to Peer Network - A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost. | 08-21-2008 |
| 20080201428 | Method for Operating a Fixed Prefix Peer to Peer Network - A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost. | 08-21-2008 |
| 20080221856 | Method and System for a Self Managing and Scalable Grid Storage - The present invention generally provides a method for grid storage including balancing read and write requests from applications across a first group of nodes in a grid storage system for avoiding hot spots and optimizing performance through smart caching; balancing storage capacity across a second group of nodes in the grid storage system, nodes in the first and second groups being at least one of hardware interchangeable online, capable of being added to change performance or capacity of the grid storage system and capable of being removed to change performance or capacity of the grid storage system; and self managing of the first and second groups of nodes for providing at least one of scalability, self healing after failure of components in the grid storage, non-disruptive upgrades to the grid storage system, and eliminating duplicate data on an object or sub-object level in the grid storage system. | 09-11-2008 |
| 20100064166 | SCALABLE SECONDARY STORAGE SYSTEMS AND METHODS - Exemplary systems and methods in accordance with embodiments of the present invention may provide a plurality of data services by employing splittable, mergable and transferable redundant chains of data containers. The chains and containers may be automatically split and/or merged in response to changes in storage node network configurations and may be stored in erasure coded fragments distributed across different storage nodes. Data services provided in a distributed secondary storage system utilizing redundant chains of containers may include global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures. | 03-11-2010 |
| 20100070698 | CONTENT ADDRESSABLE STORAGE SYSTEMS AND METHODS EMPLOYING SEARCHABLE BLOCKS - In accordance with exemplary embodiments of the present invention, a content addressable data structure system may include directed acyclic graphs (DAGs) of data content that are addressed using both a user-defined search key and content of data blocks. Internal keys of retention roots of the DAGs may be derived from the user-defined search key while the remaining blocks may be content addressed. As opposed to using a content address, the user may provide the search key when retrieving and deleting DAGs retaining the data content. In addition, the internal keys may be implemented using internal content addressable storage operations, such as applying a hash function and employing a distributed hash table. | 03-18-2010 |
| 20100082636 | Methods and Apparatus for Content-Defined Node Splitting - A region of a node is searched to find a content-defined split point. A split point of a node is determined based at least in part on hashes of entries in the node and the node is split based on the determined split point. The search region is searched for the first encountered split point and the node is split based on that split point. That split point is based on a predetermined bitmask of the hashes of the entries in the node satisfying a predetermined condition. | 04-01-2010 |
| 20110238737 | DECENTRALIZED CLOUD STORAGE - A decentralized cloud storage system is provided which comprises at least one client having local resources. The local resources include a first portion which is accessible to the at least one client and a second portion designated to be accessible to and managed by a cloud storage service having a computer readable storage medium. A server logic module is configured to allocate responsibility for performing a set of functions between back-end resources of the cloud storage service and the local resources designated by the at least one client. The system also includes a controller configured to manage the resources designated by the at least one client to implement the functions which have been allocated to the at least one client. | 09-29-2011 |
