Selecting values in a distributed computing system

Details Selecting values in a distributed computing system Selecting values in a distributed computing system

2009-09-30

2011-12-06

Wasel, Mohamed (Department: 2454)

Electrical computers and digital processing systems: multicomput

Distributed data processing

C709S202000, C709S248000

Reexamination Certificate

active

08073897

ABSTRACT:
A distributed computing system can operate in the face of malicious failures on the part of some of its constituent devices, and provide a minimum of message delays between receiving a client request and providing a response, when each device within the system verifies the sender of any message it receives, and the propriety of the message.

REFERENCES:
patent: 5261085 (1993-11-01), Lamport
patent: 6202067 (2001-03-01), Blood et al.
patent: 6216150 (2001-04-01), Badovinatz et al.
patent: 6351811 (2002-02-01), Groshon et al.
patent: 6567927 (2003-05-01), Brinkmann
patent: 6587860 (2003-07-01), Chandra et al.
patent: 6671821 (2003-12-01), Castro et al.
patent: 6704887 (2004-03-01), Kwiat et al.
patent: 6754845 (2004-06-01), Kursawe et al.
patent: 6826601 (2004-11-01), Jacobs et al.
patent: 6931431 (2005-08-01), Cachin et al.
patent: 7249280 (2007-07-01), Lamport et al.
patent: 7334154 (2008-02-01), Lorch et al.
patent: 7454521 (2008-11-01), Howell et al.
patent: 7555516 (2009-06-01), Lamport
patent: 7558883 (2009-07-01), Lamport
patent: 7565433 (2009-07-01), Lamport
patent: 2001/0025351 (2001-09-01), Kursawe et al.
patent: 2002/0116611 (2002-08-01), Zhou et al.
patent: 2005/0149609 (2005-07-01), Lamport
patent: 2005/0198106 (2005-09-01), Lamport
patent: 2005/0283373 (2005-12-01), Lamport et al.
patent: 2006/0136781 (2006-06-01), Lamport
patent: 2009/0089358 (2009-04-01), Beckwith et al.
Adya, et al., “FARSITE: Federated, Available, and Reliable Storage for and Incompletely Trusted Environment”, In Proc. 5th OSDI, Boston, MA, pp. 1-14. Dec. 2002.
Anceaume, et al., “Converging Toward Decision Conditions”, 6th International Conference on Principles of Distributed Systems, France, pp. 53-63, Dec. 11-13, 2002.
Awerbuch, et al., “Maintaining Database Consistency in Peer to Peer Networks”, Department of Computer Science, John Hopkins University; Technical Report CNDS-2002-1, pp. 1-14, Feb. 6, 2002.
Birrel, et al., “The Echo Distributed File System”, Digital Equipment Corp. Systems Research Center; Technical Report 111, pp. 1-22, Sep. 10, 1993.
Bracha, “An Asynchronous [(n-1)/3]-resilient consensus protocol,” this paper was presented at the ACM Symposium on Principles of Distributed Computing 1984, pp. 154-162.
Brasileiro, et al, “Consensus in One Communication Step”, IRISA, 2001, Universite de Rennes 1, France, 9 pages.
Brasileiro, et al., “IRISA Research Report No. 1321” (Apr. 2000).
Canetti, et al., “Fast Asynchronous Byzantine Agreement with Optimal Resilience”, Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42-51, 1993.
Castro, et al., “Practical Byzantine Fault Tolerance”, appears in Proceedings of the Third-Symposium on Operating Design and Implementation, New Orleans, USA, Feb. 1999, pp. 1-14.
Castro, “Practical Byzantine Fault Tolerance”, Ph.D. Thesis Technical Report MIT-LCS-TR-817, MIT, Jan. 2001.
Castro, et al., “Proactive Recovery in a Byzantine-Fault-Tolerant System”, appears in the Proceedings of the Fourth Symposium on Operating Systems Design and Implementation (OSDI '00), San Diego, USA, Oct. 2000, pp. 1-15.
Charron-Bost, et al., “Uniform Consensus is Harder than Consensus (extended abstract)”, Technical Report DSC/2000/028, Switzerland, May 2000.
Chockler, et al., “Group Communication Specifications: A Comprehensive Study”, ACM Computing Surveys, pp. 33(4): 427-469, Dec. 2001.
Cukier, et al., “AQuA: An Adaptive Architecture that Provides Dependable Distributed Objects”, IEEE Transactions on Computers, vol. 52, No. 1, pp. 31-50, Jan. 2003.
Cukier, et al., “AQuA: An Adaptive Architecture that Provides Dependable Distributed Objects”, In Proc. 17th Symposium on Reliable Distributed Systems, pp. 245-253, West Lafayette, IN, Oct. 1998.
DePrisco, et al., “Revisiting the PAXOS Algorithm”, Theroretical Computer Science, 243: 35-91, 2000.
Deprisco, et al., “Revisiting the Paxos Algorithm”, In Proc. 11th Int'l Workshop on Distributed Algorithms, pp. 111-125, Sep. 1997.
Deswarte, et al., “Intrusion Tolerance in Distributed Computing Systems”, Proceedings of the 1991 IEEE Symposium on Research in Security and Privacy, pp. 110-121, May 1991.
Dwork, et al., “Consensus in the Presence of Partial Synchrony” Journal of the ACM, 35(2): 288-323, Apr. 1988.
Fischer, et al., “Impossibility of Distributed Consensus with One Faulty Process”, Journal of the ACM, 32(2): 374-382, Apr. 1985.
Goldberg, et al., “Towards an Archival Intermemory”, International Forum on Research and Technology Advances in Digital Libraries, IEEE, pp. 147-156, 1998.
Gong, et al., “Byzantine Agreement With Authentication: Observations and Applications in Tolerating Hybrid and Link Faults”, Dependable Computing for Critical Applications- 5, pp. 79-90, IFIP WG 10.4, preliminary proceedings, 1995.
Guerraoui, et al., “Reducing the Cost for Non-Blocking in Atomic Commitment”, Departement d'Informatique, Ecole Polytechnique Federale de Lausanne, pp. 1-11, May 1996.
Hartman, et al., “The Swarm Scalable Storage System,” 19th ICDCS, pp. 74-81, 1999.
Hayashibara, et al., “Performance Comparison Between the Paxos and Chandra-Toueg Consensus Algorithms”, Department d'Informatique, Ecole Polytechnoque Federale de LAusanne; Technical Report IC-2002-61, pp. 1-11, Aug. 2002.
Hisgen, et al., “New-Value Logging in the Echo Replicated File System”, Digital Equipment Corp. Systems Research Center, Research Report 104, pp. 1-39, Jun. 1993.
Huang, et al., “Software Rejuvenation: Analysis, Module and Applications,” Proc. International Symposium on Fault Tolerant Computing, pp. 381-390 (1995).
Keidar, et al., “Moshe: A Group Membership Service for WANs,” to appear in ACM Transactions on Computer Systems (TOCS), Aug. 2002, pp. 1-47, retrieved at <<http://theory.1cs.mit.edu/˜idish/ftp/mpshe-tocs02.pdf>>.
Keidar, et al., “On the Cost of Fault-Tolerant Consensus When There Are No Faults—A Tutorial” SIGACT News 32(2), Distributed Computing column, pp. 45-63; Jun. 2001.
Khazan, “A One-Round Algorithm for Virtually Synchronous Group Communication in Wide Area Networks”, Ph.D. dissertation, Department of Electrical Engineering and Computer Science, MIT, May 22, 2002, Thesis Supervisors: Prof. Nancy A. Lynch and Dr. Idit Keidar. retrieved at <<http://theory.1cs.mit.edu/˜roger/Research/Papers/khazan-phd.pdf>>.
Kihlstrom, et al., “Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector”, Proceedings of the International Conference on Principles of Distributed Systems (OPODIS '97), Hermes, Chantilly, France, 61-76, 1997.
Kihlstrom, et al., “The SecureRing Protocols for Securing Group Communication”, Proceedings of the 31st Hawaii International Conference on System Sciences, vol. 3, pp. 317-326, Jan. 1998.
Lamport, et al., “Cheap Paxos”, In Proc. International Conference on Dependable Systems and Networks (DSN), Florence, Italy, 2004.
LAmport; “Lower Bounds for Asynchronous Consensus”, in Future Distibuted Computing, vol. 2584 of Lecture Notes in Computer Science, pp. 22-23, Spring, 2003.
Lamport, “Paxos Made Simple,” ACM SIGACT News (Distributed Computing Column), 32, 4 (Whole No. 121, Dec. 2001) pp. 18-25.
Lamport, et al., “The Byzantine Generals Problem”, ACM Transactions on Programming Languages and Systems, vol. 4, No. 3, Jul. 1982, pp. 382-401.
Lamport, “The Implementation of Reliable Distributed Multiprocess Systems”, Computer Networks, 2:95-114, 1978.
Lamport, “The Part-Time Parliamen,” ACM Transactions on Computer Systems 16, 2 (May 1998), pp. 133-169. Also appeared as SRC Research Report 49.
Lamport, “Time, Clocks

Affiliated with

Also associated with

Rating

Selecting values in a distributed computing 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 Selecting values in a distributed computing system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selecting values in a distributed computing system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4314083