Arrangement in a network node for secure storage and...

Details Arrangement in a network node for secure storage and... Arrangement in a network node for secure storage and...

2007-04-10

2007-04-10

Dildine, R. Stephen (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Replacement of memory spare location, portion, or segment

C714S784000, C711S148000

Reexamination Certificate

active

10859209

ABSTRACT:
Data is stored using multiple selected network nodes in a network based on encoding of the data into multiple distinct encoded data units according to a prescribed encoding operation. The secure encoding operation generates a first prescribed number of encoded data units, whereas merely a second prescribed number of the encoded data units are necessary for recovery of the original data, the second prescribed number being less than the first prescribed number. The encoded data units are distributed among selected network nodes in a network, where any one network node receives less than the second prescribed number to ensure security. A requesting node recovers the original data by requesting the second prescribed number of encoded data units from among the network nodes having stored the respective encoded data units.

REFERENCES:
patent: 5937428 (1999-08-01), Jantz
patent: 6024486 (2000-02-01), Olarig et al.
patent: 6173374 (2001-01-01), Heil et al.
patent: 6307487 (2001-10-01), Luby
patent: 6373406 (2002-04-01), Luby
patent: 6411223 (2002-06-01), Haken et al.
patent: 6425052 (2002-07-01), Hashemi
patent: 6486803 (2002-11-01), Luby et al.
patent: 6557123 (2003-04-01), Wiencko, Jr. et al.
patent: 6614366 (2003-09-01), Luby
patent: 2002/0190878 (2002-12-01), Luby
patent: 2003/0046637 (2003-03-01), Zhang
patent: 2003/0058958 (2003-03-01), Shokrallahi et al.
patent: 2003/0226089 (2003-12-01), Rasmussen
patent: 2004/0021588 (2004-02-01), Luby
patent: 2004/0075592 (2004-04-01), Shokrollahi et al.
patent: 2004/0075593 (2004-04-01), Shokrollahi et al.
patent: 2004/0101274 (2004-05-01), Foisy et al.
patent: 2006/0107131 (2006-05-01), Mills et al.
patent: 2006/0161823 (2006-07-01), Sato
Reed et al., “Polynomial Codes Over Certain Finite Fields”,J. Soc. Indust. Appl. Math., Jun. 1960, pp. 300-304, vol. 8, No. 2.
Cates, “Robust and Efficient Data Management for a Distributed Hash Table”, Master's thesis, Mass. Institute of Technology, May 2003.
Liben-Nowell et al., “Analysis of the Evolution of Peer-to-Peer Systems”, ACM Conf. On Principles of Distributed Computing (PODC), Monterey, CA, Jul. 2002.
Karger et al., “Finding Nearest Neighbors in Growth-restricted Metrics”, ACM Symposium on Theory of Computing (STOC '92), Montreal, May 2002.
Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications”, date unknown.
Cox et al., “Serving DNS using a Peer-to-Peer Lookup Service”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA.
Liben-Nowell et al., “Observations on the Dynamic Evolution of Peer-to-Peer Networks”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA.
Sit et al., “Security Considerations for Peer-to-Peer Distributed Hash Tables”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA.
Dabek, “A Cooperative File System”, Master's Thesis, Massachusetts Institute of Technology, Sep. 2001.
Dabek et al., “Wide-area cooperative storage with CFS”, ACM SOSP 2001, Banff, Oct. 2001.
Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Services for Internet Applications”, ACM SIGCOMM 2001, San Diego, Aug. 2001, pp. 149-160.
Dabek et al., “Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service”, Proceedings of the 8thWorkshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.
Burkard, “Herodotus: A Peer-to-Peer Web Archival System”, Master's Thesis, Massachusetts Institute of Technology, Jun. 2002.

Affiliated with

Also associated with

Rating

Arrangement in a network node for secure storage and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Arrangement in a network node for secure storage and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement in a network node for secure storage and... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3796756