Fixed content distributed data storage using permutation...

Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S752000

Reexamination Certificate

active

10806488

ABSTRACT:
A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN—C] where INis an n×n identity sub-matrix and C is a k×n sub-matrix of code blocks. The identity sub-matrix is used to preserve the data blocks intact. The sub-matrix C preferably comprises a set of permutation ring operators that are used to generate the code blocks. The operators are preferably superpositions that are selected from a group ring of a permutation group with base ring Z2.

REFERENCES:
patent: 5485474 (1996-01-01), Rabin
patent: 5644695 (1997-07-01), Blaum et al.
patent: 6088330 (2000-07-01), Bruck et al.
patent: 6370670 (2002-04-01), Le Dantec et al.
patent: 6614366 (2003-09-01), Luby
patent: 7133853 (2006-11-01), Richardson et al.
patent: 2005/0088986 (2005-04-01), Sun et al.
Good et al., “A Robust Storage System Architecture,” Technical Report: CS-95-10, Dept. of Computer Science, University of Waterloo, Mar. 9 , 1995.
Bestavros, “A VLSI Chip for the Real-time Information Dispersal and Retrieval for Security and Fault-Tolerance,” Harvard University, Sep. 1989.
Plank, “A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems,” Technical Report UT-CS-96-332, Dept. of Comp. Science, Univ. of Tennessee, Jul. 19, 1996.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Fixed content distributed data storage using permutation... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fixed content distributed data storage using permutation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed content distributed data storage using permutation... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3731165

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.