Chaperones in a distributed system

Details Chaperones in a distributed system Chaperones in a distributed system

2005-03-01

2009-11-03

Strange, Aaron (Department: 2448)

Electrical computers and digital processing systems: multicomput

Computer conferencing

Cooperative computer processing

C709S224000, C726S017000

Reexamination Certificate

active

07613774

ABSTRACT:
A method for approving a response or a decision of an observed node in a distributed system that includes generating at least one selected from the group consisting of the response and the decision by the observed node, forwarding the at least one selected from the group consisting of the response and the decision to at least one of the plurality of chaperones associated with the observed node based on a chaperone scheme, and approving the least one selected from the group consisting of the response and the decision by the plurality of chaperones using a chaperone voting policy and a chaperone approval policy to obtain at least one selected from the group consisting of a approved response and a approved decision, wherein the distributed system implements an overlay network for message delivery, and wherein the observed node and the plurality of chaperones communicate using the overlay network.

REFERENCES:
patent: 5996075 (1999-11-01), Matena
patent: 6205510 (2001-03-01), Mendel
patent: 6311217 (2001-10-01), Ehlinger et al.
patent: 7296298 (2007-11-01), Salgado
patent: 2004/0085329 (2004-05-01), Xu et al.
patent: 2004/0085912 (2004-05-01), Xu et al.
patent: 2004/0165536 (2004-08-01), Xu et al.
patent: 2006/0021023 (2006-01-01), Stewart et al.
patent: 2006/0191020 (2006-08-01), Miller
patent: 2007/0192321 (2007-08-01), Farr et al.
A. Adya, et al.; “Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment”; Proceedings of the 5thSymposium on Operating Systems and Design Implementation OSDI; Dec. 2002 (14 pages).
I. Clarke, et al.; “Freenet: A Distributed Anonymous Information Storage and Retrieval System”; Lecture Notes in Computer Science; 2000 (21 pages).
J. Kubiatowicz, et al.; “OceanStore: An Architecture for Global-Scale Persistent Storage”; Proceedings of ACM ASPLOS; Nov. 2000 (12 pages).
A. Rowstron, et al.; “Storage Management and Caching in PAST, a Large-Scale, Peristent Peer-to-Peer Storage Utility”; Symposium on Operating Systems Principles; Oct. 2001 (13 pages).
S. Quinlan, et al.; “Venti: A New Approach to Archival Storage”; Proceedings of the FAST 2002 Conference on File and Storage Technologies; First USENIX Conference on File and Storage Technologies; Jan. 2002 (14 pages).
A. Muthitacharoen, et al.; “Ivy: A Read/Write Peer-to-Peer File System”; Proceedings of the 5thUSENIX Symposium on Operating Systems Design and Implementation (OSDI '02); Dec. 2002 (23 pages).
F. Dabek, et al.; “Towards a Common API for Structured Peer-to-Peer Overlays”; Proceedings of 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), Feb. 2003 (11 pages).
I. Stoica, et al.; “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”; Proceedings of the SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications; Aug. 2001 (12 pages).
B. Zhao, et al.; “Tapestry: A Resilient Global-Scale Overlay for Service Deployment”; IEEE Journal on Selected Areas in Communications; Jan. 2004 (15 pages).
A. Rowstron, et al.; “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems”; Lecture Notes in Computer Science; 2001 (22 pages).
C. Greg Plaxton, et al.; “Accessing Nearby Copies of Replicated Objects in a Distributed Environment”; ACM Symposium on Parallel Algorithms and Architectures, Jun. 1997 (23 pages).
M. Castro, et al.; “Practical Byzantine Fault Tolerance”; Symposium on Operating Systems Design and Implementation; Feb. 1999 (14 pages).
D. B. Terry, et al.; “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System”; Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles; Dec. 1995 (12 pages).
D. Boneh, et al.; “Efficient Generation of Shared RSA Keys”; Journal of the ACM; 2001 (21 pages).
Y. Frankel, et al.; “Robust Efficient Distributed RSA-Key Generation”; Proc. 30thAnnual ACM Symposium on Theory of Computing (STOC); May 1998 (10 pages).

Affiliated with

Also associated with

Rating

Chaperones in a distributed system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Chaperones in a distributed system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chaperones in a distributed system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4082777