Abstract
It is sometimes necessary in the course of a distributed computation to arrange that a certain set of operations is carried out in the correct order and the correct number of times (typically once). If several sets of operations are performed on different machines on the network there is no obvious mechanism for enforcing such ordering constraints in a fully distributed way. This lack basically stems from the difficulty of preventing copying and repetition of messages by machines and from the impossibility of constraining externally the actions of machines in response to messages that come into their hands.
This paper presents a possible method for ensuring the integrity of sequences of operations on different machines. The technique may be thought of as a means of enabling machines to ensure that requests made of them are valid and timely, not as means of centralized control of services.
- 1 R.M. Needham & M.D. Schroeder, "Using Encryption for Authentication in Large Networks of Computers", Communications of the Association for Computing Machinery, Vol. 21, No. 12, pp. 933-999, December 1978. Google ScholarDigital Library
- 2 D. Gifford, "Weighted Voting For Replicated Data", Proc. Seventh Symposium on Operating Systems Principles Asilomar, California, December 1979. Google ScholarDigital Library
Comments