A linear fault-tolerant naming algorithm

  • Joffroy Beauquier
  • Paul Gastin
  • Vincent Villain
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)

Abstract

We solve the naming problem (how to give a unique identifier to each site of an unknown network), when some sites are supposed to have a faulty behaviour of fail-stop type. The solution uses several tokens, in order to ensure that, despite crash failure of some sites, at least one token will perform a complete traversal of the network. The complexities in time and in number of messages of this algorithm are linear with respect to the size of the network (number of communication lines), which improves the exponential solution already known in the Byzantine case with some special assumptions.

Key words

distributed algorithms naming problem fault-tolerance fail-stop synchronous message passing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Attiya H., Bar-Noy A., Dolev D., Koller D., Peleg D. and Reischuk R., "Achievable Cases in a Asynchronous Environment", Proceedings of the 28th Found. of Comput. Science IEEE, pages 337–347, 1987.Google Scholar
  2. Bar-Noy A., Dolev D., Koller D. and Peleg D., "Fault-Tolerant Critical Section Management in Asynchronous Networks", in Distributed Algorithms, Lecture Notes in Computer Science 392, pages 13–23, 1989.Google Scholar
  3. Beauquier J., "Distribution d'Identificateurs avec des Processus Byzantins", Actes du séminaire franco-brésilien sur les systèmes répartis, Florianopolis, pages 235–239, 1989.Google Scholar
  4. Cheung T., "Graph Traversal Techniques and the Maximal Flow Problem in Distributed Computation", IEEE Trans. on SE, SE 9 (4), pages 504–512, 1983.Google Scholar
  5. Hélary J.M. and Raynal M., "Assigning Distinct Identities to Sites of an Anonymous Distributed System", Proc. IEEE, Workshop on the Future Trends of Distributed Computing Systems in the 1990s, Hong Kong, pages 82–86, September 1988.Google Scholar
  6. Lamport L., Shostak and Pease, "Reaching Agreement in the Presence of Faults", J.A.C.M., pages 228–234, 1980.Google Scholar
  7. Masukawa T., Nishikawa N., Hagihara K. and Tokura N., "Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction", in Distributed Algorithms, Lecture Notes in Computer Science 392, pages 171–182, 1989.Google Scholar
  8. Segall A., "Distributed Network Protocols", IEEE Trans. on Inf. Theory, IT 29 (1), pages 23–25, 1983.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Joffroy Beauquier
    • 1
  • Paul Gastin
    • 2
  • Vincent Villain
    • 3
  1. 1.L.R.I., Université Paris 11, Bât 490Orsay CedexFrance
  2. 2.L.I.T.P., Université Paris 6Paris Cedex 05France
  3. 3.L.I.F.A., Université de PicardieAmiens CedexFrance

Personalised recommendations