Patent application number | Description | Published |
20090083590 | System and method for determining the fault-tolerance of an erasure code - A method for determining a fault tolerance of an erasure code comprises deriving base erasure patterns from a generator matrix of an erasure code, determining which of the base erasure patterns are adjacent to one another and XORing the adjacent base erasure patterns with one another to produce child erasure patterns of the erasure code. The method further comprises combining the base erasure patterns and the child erasure patterns to form a minimal erasures list (MEL) for the erasure code, whereby the MEL corresponds to the fault tolerance of the erasure code. Also provided are methods for communicating and storing data by using the fault tolerance of erasure codes. | 03-26-2009 |
20090112900 | Collaborative Compression - Provided are, among other things, systems, methods and techniques for collaborative compression, in which is obtained a collection of files, with individual ones of the files including a set of ordered data elements (e.g., bit positions), and with individual ones of the data elements having different values in different ones of the files, but with the set of ordered data elements being common across the files. The data elements are partitioned into an identified set of bins based on statistics for the values of the data elements across the collection of files, and a received file is compressed based on the bins of data elements. | 04-30-2009 |
20100080391 | Auditing Data Integrity - Various approaches are described for auditing integrity of stored data. In one approach, a data set is provided from a client to a storage provider, and the data set is stored at a first storage arrangement by the storage provider. An auditor determines whether the data set stored at the first storage arrangement is corrupt without reliance on any part of the data set and any derivative of any part of the data set stored by the client. While the auditor is determining whether the data set stored at the first storage arrangement is corrupt, the auditor is prevented from being exposed to information specified by the data set. The auditor outputs data indicative of data corruption in response to determining that the data set stored at the first storage arrangement is corrupt. | 04-01-2010 |
20100083001 | Auditor Assisted Extraction And Verification Of Client Data Returned From A Storage Provided While Hiding Client Data From The Auditor - Various approaches for extracting client's data from a storage provider are presented. In one approach, an auditor is initialized with a verification data set that confirms that an initial version of a data set stored by the storage provider is intact. The auditor extracts a second version of the data set from the storage provider; the second version hides information specified by the data set from the auditor. The auditor determines whether the second version matches the initial version. The second version is returned to the client if the initial version matches the second version. The auditor is prevented from recovering the information specified by the data set using the state information, and the client need not store any state information related to the initial and second versions needed to recover the information specified by the data set. If the initial version does not match the second version, the auditor outputs data indicative of data corruption. | 04-01-2010 |
20100083069 | Selecting Erasure Codes For A Fault Tolerant System - A technique for selecting an erasure code from a plurality of erasure codes for use in a fault tolerant system comprises generating a preferred set of erasure codes based on characteristics of the codes' corresponding Tanner graphs. The fault tolerances of the preferred codes are compared based at least on the Tanner graphs. A more fault tolerant code is selected based on the comparison. | 04-01-2010 |
20100106974 | System For And Method Of Writing And Reading Redundant Data - In accordance with an embodiment of the invention, a method of writing and reading redundant data is provided. Data is written by storing a copy of the data along with a timestamp and a signature at each of a set of storage devices. The data is read by retrieving the copy of the data, the timestamp and the signature from each of a plurality of the set of data storage devices. One of the copies of the data is selected to be provided to a requestor of the data. Each of the storage devices of the set is requested to certify the selected copy of the data. Provided that a proof of certification of the selected copy of the data is valid, the storage devices of the set are instructed to store the selected copy of the data along with a new timestamp. | 04-29-2010 |
20100254260 | LOCATION DETERMINATION FOR PLACING A NEW CAPACITY POINT IN A WIRELESS NETWORK - A location for placing a new capacity point in a wireless network is determined based on a wireless contention of the network and capacities for capacity points in the network. Each capacity point is a network device interfacing the network with a second network. The capacities are calculated as a function of the wireless contention. | 10-07-2010 |
20100278057 | DETERMINING A METRIC REGION IN A WIRELESS NETWORK - A wireless network metric region in a wireless network is determined using a node metric region and a performance metric. The node metric region, which includes a boundary of the node metric region, for each node is estimated and the performance metric for the node metric region for each node is measured. The boundary of the node metric region for each node is adjusted based on the measured performance metric and then the wireless network metric region for the wireless network is determined based on the adjusted boundaries of the node metric region for each node. | 11-04-2010 |
20100278072 | SELECTING WIRELESS MESH NODE LOCATIONS - Locations for deploying mesh nodes in a wireless network are determined based on a Terminal Steiner tree (TST). The TST that is formulated from an input graph and client locations in the wireless network is determined. The input graph includes signal strength values for pairs of mesh node-to-client location and mesh node-to-mesh node links and mesh node locations for deploying the mesh nodes are selected from the Steiner nodes in the TST. | 11-04-2010 |
20110055559 | DATA RETENTION MANAGEMENT - A file-based data retention management system is provided. A data source can store data files. An online backup file system can make a backup copy of the data files from the data source and store the backup copy of the data files on a backup server. A policy database can be maintained by the system, the policy database including data retention policies for the data files for retention management of the data files. A key management system can assign and manage encryption keys for the data files. The key management system can store the encryption keys on a separate system from the data files stored on the backup server. | 03-03-2011 |
20110055611 | SYSTEM FOR CONTROLLING POWER CONSUMPTION OF A NETWORK - A system for controlling power consumption of a network includes at least one terminal to receive a plurality of requests to route data from a plurality of data sources to a plurality of data sinks, where the data sources and the data sinks are connected to each other through a plurality of network nodes forming the network, and a network configuration unit. The network configuration unit includes a selection module configured to select a configuration of the network nodes that allows the network to have a lowest overall power consumption of the network among a plurality of configurations of the network, and an output module configured to output a plurality of instruction signals to the network nodes to perform the network configuration. A network path for transmitting a network flow is selected that does not allow the network flow to be split and flow through another network path. | 03-03-2011 |
20110119284 | GENERATION OF A REPRESENTATIVE DATA STRING - Provided are, among other things, systems, methods and techniques for generating a representative data string. In one representative implementation: (a) starting data positions are identified within input strings of data values; (b) a subsequence of output data values is determined based on the data values at data positions determined with reference to the starting data positions within the input strings; (c) an identification is made as to which of the input strings have segments that match the subsequence of output data values, based on a matching criterion; (d) steps (a)-(c) are repeated for a number of iterations; and (e) the subsequences of output data values are combined across the iterations to provide an output data string, with the determination in step (b) for a current iteration being based on the identification in step (c) for a previous iteration. | 05-19-2011 |
20110184934 | WAVELET COMPRESSION WITH BOOTSTRAP SAMPLING - A method for compressing an initial dataset may be implemented on a data processing system. The method may include generating a group of bootstrap samples of wavelet coefficients from the initial dataset using a wavelet basis function. An average quantile of the group of bootstrap samples of wavelet coefficients may be determined. The group of wavelet coefficients may be compressed by deleting initial wavelet coefficients having magnitudes less than the coefficient cutoff value equal to the average quantile. The compressed group of wavelet coefficients and the wavelet basis function may be used to approximate the initial dataset. | 07-28-2011 |
20120102377 | METHOD FOR CONSTRUCTING A HISTOGRAM - A method for constructing a histogram can include sampling attributes in a column of a database on a server and determining a bucket set for the histogram based on a number of buckets that represents a distribution of the attributes with minimum error. A bucket in the bucket set includes boundaries and an approximation of a count of attributes falling within the boundaries. The method further includes determining a precision for encoding the approximation, such that the histogram having the bucket set fits within a storage limit on a tangible computer-readable medium. The histogram can then be stored for the database on a tangible computer-readable medium by encoding the approximation with the precision. | 04-26-2012 |
20120243687 | ENCRYPTION KEY FRAGMENT DISTRIBUTION - An encryption key may be fragmented into n encryption key fragments such that k09-27-2012 | |
20130007242 | COMPOSITION OF SERVICES - A method of generating a set of composite services is provided herein. The method includes receiving standardized service descriptions of a set of component services from service providers. The standardized description of a component service may be translated to an automaton-based description. A specified goal associated with the set of component services may be received. The set of composite services may be generated based on the automaton-based description and the specified goal. Each of the generated composite services may accomplish the specified goal. | 01-03-2013 |
20130010966 | ENCRYPTION KEY STORAGE - Systems, methods, and machine-readable and executable instructions are provided for encryption key storage. Encryption key storage may include associating each of a plurality of identifiers with a different one of a plurality of key fragment stores, determining a plurality of indexes, where each of the plurality of indexes is based upon a handle provided by a customer, an authorization token provided by the customer, and a different one of the plurality of identifiers, partitioning an encryption key provided by the customer into a number of encryption key fragments, and distributing the plurality of indexes and the number of encryption key fragments to the plurality of key fragment stores. | 01-10-2013 |
20130111430 | PROVIDING GOODS OR SERVICES | 05-02-2013 |
20130177157 | ENCRYPTION KEY MANAGEMENT - An encryption key fragment is divided into a number of encryption key fragments. Requests to store different ones of the encryption key fragments are transmitted to different computer memory storage systems. An individual request to store an encryption key fragment includes one of the encryption key fragments and bears an access control hallmark for regulating access to the encryption key fragment. | 07-11-2013 |