Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability
Reexamination Certificate
2005-02-07
2010-10-19
Wilson, Yolanda L (Department: 2113)
Error detection/correction and fault detection/recovery
Data processing system error or fault handling
Reliability and availability
C714S005110
Reexamination Certificate
active
07818607
ABSTRACT:
Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information.
REFERENCES:
patent: 5675767 (1997-10-01), Baird et al.
patent: 5909540 (1999-06-01), Carter et al.
patent: 5937428 (1999-08-01), Jantz
patent: 6024486 (2000-02-01), Olarig et al.
patent: 6154852 (2000-11-01), Amundson 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: 6516350 (2003-02-01), Lumelsky et al.
patent: 6523036 (2003-02-01), Hickman et al.
patent: 6529917 (2003-03-01), Zoltan
patent: 6532535 (2003-03-01), Maffezzoni et al.
patent: 6539381 (2003-03-01), Prasad et al.
patent: 6549949 (2003-04-01), Bowman-Amuah
patent: 6550057 (2003-04-01), Bowman-Amuah
patent: 6557111 (2003-04-01), Theimer et al.
patent: 6557123 (2003-04-01), Wiencko, Jr. et al.
patent: 6560609 (2003-05-01), Frey et al.
patent: 6567818 (2003-05-01), Frey et al.
patent: 6571282 (2003-05-01), Bowman-Amuah
patent: 6574617 (2003-06-01), Immerman et al.
patent: 6574749 (2003-06-01), Parsons
patent: 6574750 (2003-06-01), Felber et al.
patent: 6578068 (2003-06-01), Bowman-Amuah
patent: 6578069 (2003-06-01), Hopmann et al.
patent: 6614366 (2003-09-01), Luby
patent: 6742137 (2004-05-01), Frey, Jr.
patent: 6779025 (2004-08-01), Wolfe et al.
patent: 6938056 (2005-08-01), Burns et al.
patent: 7031986 (2006-04-01), Ito
patent: 2002/0059539 (2002-05-01), Anderson
patent: 2002/0138784 (2002-09-01), Mann et al.
patent: 2002/0162047 (2002-10-01), Peters et al.
patent: 2002/0190878 (2002-12-01), Luby
patent: 2003/0058958 (2003-03-01), Shokrollahi 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: 2005/0022051 (2005-01-01), Zane et al.
patent: 2005/0229031 (2005-10-01), Kojenov et al.
patent: 2007/0088977 (2007-04-01), Eguchi et al.
U.S. Appl. No. 10/859,209, filed Jun. 3, 2004, Turner et al.
U.S. Appl. No. 10/859,208, filed Jun. 3, 2004, Turner et al.
U.S. Appl. No. 11/051,333, filed Feb. 7, 2005, Turner et al.
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 Service 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.
Petersen et al., “Flexible Update Propagation for Weakly Consistent Replication”, Proceedings of the 16th(ACM) Symposium on Operating Systems Principles (SSOP-16), Saint Malo, France, 1997.
Hildrum, “Why Do We Need Locality?”, Feb. 17, 2004, http://oceanstore.cs.berkeley.edu/info/whytapestry.html.
Hildrum, “The Ocean Store Project”, Feb. 17, 2004, http://oceanstore.cs.berkeley.edu/info/overview.html.
Wells, “The OceanStore Archive: Goals, Structures, and Self-Repair”, U.C. Berkeley Masters Report, May 2000.
Burkard, “Herodotus: A Peer-to-Peer Web Archival System”, Master's Thesis, Massachusetts Institute of Technology, Jun. 2002.
Joseph et al., “Evolution of grid computing architecture and grid adoption models”,IBM Systems Journal, 2004, vol. 43, No. 4.
Bourbonnais et al, “Towards an information infrastructure for the grid”,IBM Systems Journal, 2004, vol. 43, No. 4.
Meliksetian et al., “Design and implementation of an enterprise grid”,IBM Systems Journal, 2004, vol. 43, No. 4.
Carpenter et al., “Abstract interdomain security assertions: A basis for extra-grid virtual organizations”,IBM Systems Journal, 2004, vol. 43, No. 4.
Network Working Group, Request for Comments: 1094, “NFS: Network File System Protocol Specification”, Mar. 1989.
Toebes John
Turner Bryan C.
Walker Douglas Jay
Cisco Technology Inc.
Turkevich Leon R.
Wilson Yolanda L
LandOfFree
Arrangement for recovery of data by network nodes based on... 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 for recovery of data by network nodes based on..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement for recovery of data by network nodes based on... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4218189