Abstract
We present solutions to two classical problems concerning distributed systems in which some sites or processes can possibly have byzantine faulty behavior.
We first study the naming problem (how to give each site of a network an unique identifier). We are naturally led to make some supplementary assumptions about the synchrony of message passing, the connectivity of the underlying graph and the existence of a special site, provided with a digital signature, for initiating the protocol. The solution that we present uses three waves of messages between the initiator and any other site.
Then, we solve the mutual exclusion problem with particular assumptions about the behavior of byzantine processes. The solution implements each critical section as a separate segment, whose address (necessary to access it) is "hidden". A process must reconstruct this address before entering its critical section, involving the cooperation of a number of other processes.
For the two problems, protocols are given and their complexity is estimated.
This research has been supported by the PRC C3.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
"Achievable Cases in a Asynchronous Environment", Proceedings of the 28th Found. of Comput. Science IEEE, pages 337–347, November 1987.
"Locally byzantine processes", in Proc. of the Workshop IEEE on the future trends of distributed systems in the 1990s, Hong-Kong, pages 232–236, September 1988.
"A failure tolerant centralized mutual exclusion algorithm", in Proc. of the 4th Inter. Conf. on Distributed Comp. Syst., pages 347–356, 1984.
"Cryptography and data security", Addison-Wesley, 1983.
"Reaching agreement in the presence of faults", J.A.C.M., pages 228–234, 1980.
"Graph Traversal Techniques and the Maximal Flow Problem in Distributed Computation", IEEE Trans. on SE, SE 9(4), pages 504–512, 1983.
"Assigning Distinct Identities to Sites of an the Future Trends of Distributed Computing Systems in the 1990s, Hong Kong, pages 82–86, September 1988.
"Reaching Agreement in the Presence of Faults", J.A.C.M., pp. 228–234, 1980.
"Randomized byzantine generals", 24th F.O.C.S. I.E.E.E., Tucson, pages 403–409, November 1983.
"An optimal algorithm for mutual exclusion in computer networks", C.A.C.M., vol. 24, pages 9–17, 1981.
"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", CACM, vol. 21, pages 120–126, 1978.
"Distributed Network Protocols", IEEE Trans. on Inf. Theory, IT 29 (1), pages 23–25, 1983.
"How to share a secret", C.A.C.M., vol. 22, pages 612–613, 1979.
"Simulating authenticated broadcasts to derive simple fault-tolerant algorithms", Distributed Computing, vol. 2, pp. 80–94, 1987.
"Randomized asynchronous byzantine agreements", Proc. 3rd Symposium of the principles of Distributed Computing, Vancouver, Canada, Aug. 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Beauquier, J. (1990). Fault-tolerant naming and mutual exclusion. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-53479-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53479-2
Online ISBN: 978-3-540-46897-4
eBook Packages: Springer Book Archive