Erasure coding technique for scalable and fault tolerant...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S770000, C714S776000

Reexamination Certificate

active

07979771

ABSTRACT:
A method for encoding a block of data to allow it to be stored or transmitted correctly in the face of accidental or deliberate modifications, the method including constructing a number n greater than one of original components, each of which is derived from the block and each of which is smaller than the block, and combining original components to construct a number m greater than one of new components, wherein each of the new components is smaller than the sum of the sizes of the original components combined to produce it, wherein the block can be reconstructed from any set of n different components selected from the original components and new components, and wherein a set of n different components selected from the original components and new components contains more redundant information about the block than the set of n original components.

REFERENCES:
patent: 4438522 (1984-03-01), Bluethgen
patent: 5485474 (1996-01-01), Rabin
patent: 5499253 (1996-03-01), Lary
patent: 5617541 (1997-04-01), Albanese et al.
patent: 5754756 (1998-05-01), Watanabe et al.
patent: 6079042 (2000-06-01), Vaman et al.
patent: 6320520 (2001-11-01), Luby
patent: 6553420 (2003-04-01), Karger et al.
patent: 7062648 (2006-06-01), Moulton et al.
patent: 7103824 (2006-09-01), Halford
patent: 7219289 (2007-05-01), Dickson
patent: 7233264 (2007-06-01), Luby
patent: 7240236 (2007-07-01), Cutts et al.
patent: 7304990 (2007-12-01), Rajwan
patent: 7363346 (2008-04-01), Groner et al.
patent: 7472334 (2008-12-01), Scott et al.
patent: 7577866 (2009-08-01), Fan et al.
patent: 2004/0167898 (2004-08-01), Margolus et al.
patent: 2005/0063217 (2005-03-01), Shiraishi et al.
patent: 2006/0116990 (2006-06-01), Margolus et al.
G. Feng et al., “New Efficient MDS Array Codes for RAID, Part I: Reed-Solomon-Like Codes for Tolerating, Three Disk Failures,” IEEE Trans. On Computers, vol. 54, No. 9, Sep. 2005.
G. Feng et al., “New Efficient MDS Array Codes for RAID, Part II: Rabin-Like Codes for Tolerating Multiple (≧4) Disk Failures,” IEEE Trans. On Computers, vol. 54, No. 12, Dec. 2005.
Honicky et al., “Replication Under Scalable Hashing: A Family of Algorithms for Scalable Decentralized Data Distribution,” Procs. Of the 18thInt. Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, NM, Apr. 2004.
Karger et al, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web, Procs. Of the 29thAnn. ACM Symposium on Theory of Computing, El Paso, TX, May 1997.
Patterson et al., “A Case for Redundant Arrays of Inexpensive Disks (RAID),” Procs. Of the 1988 ACM SIGMOD Int. Conf. on Management of Data, Sep. 1988.
Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,” Procs. Of the ACM SIGCOMM'01, San Diego, CA, Sep. 2001.
Thomasian, “Multi-Level RAID for Very Large Disk Arrays,” ACM SIGMETRICS Performance Evaluation Review, Mar. 2006.

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

Erasure coding technique for scalable and fault tolerant... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Erasure coding technique for scalable and fault tolerant..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Erasure coding technique for scalable and fault tolerant... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2730049

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