Skip to main content
SpringerLink
Log in

Electing a leader in a ring with link failures

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We investigate the message complexity of electing a leader in a ring of asynchronous processors. Our work deviates from the previous works on electing a leader in that we consider the effect of link failures. A link is said to fail if some message sent through it never reaches its destination. We distinguish the case where n is known from the case n unknown. Our main result is a O(n · log n) algorithm for electing a leader on a n-processor ring (the case n is known).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Burns, J.E.: A Formal Model for Message Passing Systems. TR-91, Indiana University 1980

  2. Chang, E., Roberts, R.: An Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processes. Commun ACM 22, 281–283 (1979)

    Google Scholar 

  3. Dolev, D., Klawe, M., Rodeh, M.: An O(n log n) Unidirectional Distributed Algorithm for Extremafinding in a Circle. J. Algorithms 3, 245–250 (1982)

    Google Scholar 

  4. Franklin, R.: On an Improved Algorithm for Decentralized Extrema-Finding in Circular Configuration of Processes. Commun. ACM 25, 336–337 (1982)

    Google Scholar 

  5. Frederickson, G.R., Lynch, N.A.: The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring. Proc. of the 16th ACM Symp. on Theory of Computing. pp. 493–503. Washington, D.C., 1984

  6. Frederickson, G.R., Lynch, N.A.: A General Lower Bound for Electing a Leader in a Ring. To appear in JACM

  7. Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Tree. ACM Trans. Program Lang Syst. 5, 66–77 (1983)

    Google Scholar 

  8. Goldreich, O., Shrira, L.: Consultation in the Presence of Faults: Two Lower Bounds. TR-355, Computer Science Dept., Technion, Haifa 32000, February 1985

    Google Scholar 

  9. Goldreich, O., Shrira, L.: Electing a Leader in the Presence of Faults: A Ring as a Special Case. TR-354, Computer Science Dept., Technion, Haifa 32000, February 1985

    Google Scholar 

  10. Hirschberg, D.E., Sinclair, J.B.: Decentralized Extrema-Finding in Circular Configuration of Processors. Commun. ACM 23, 627–628 (1980)

    Google Scholar 

  11. Itai, A., Rodeh, M.: Symmetry Breaking in a Distributed Environment, Proc. of the 22nd IEEE Symp. on Foundation Comput. Sci. pp. 150–157. Nashville, Tennessee, 1981

  12. Itai, A., Rodeh, M.: The Multi-Tree Approach to Reliability in Distributed Networks. Proc. of the 25th IEEE Symp. on Foundation Comput. Sci. pp. 137–147. Singer Island, Florida, 1984

    Google Scholar 

  13. LeLann, G.: Distributed Systems-Towards a Formal Approach. In: Information Processing 77. (Gilchrist B. ed.), pp. 155–160. Amsterdam: North Holland 1977

    Google Scholar 

  14. Lynch, N.A., Fischer, M.J.: On Describing the Behavior and Implementation of Distributed Systems. Theor. Comput. Sci. 13, 17–43 (1981)

    Google Scholar 

  15. Meritt, M: Elections in the Presence of Faults. Proc. of the 3fd PODC. pp. 134–142. 1984

  16. Peterson, G.L.: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Trans. Program. Lang. Syst. 4, 758–762 (1982)

    Google Scholar 

  17. Shrira, L., Rodeh, M.: Methodological Construction of Reliable Distributed Algorithms. TR-361, Computer Science Dept., Technion, Haifa 32000, February 1985

    Google Scholar 

  18. Vitanyi, P.M.B.: Distributed Election in an Archimedean Ring of Processors. Proc. of the 16th ACM Symp. on Theory of Computing. pp. 542–547. Washington, D.C., 1984

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion - Israel Institute of Technology, 32000, Haifa, Israel

    Oded Goldreich

  2. Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Oded Goldreich & Liuba Shrira

Authors
  1. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liuba Shrira
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goldreich, O., Shrira, L. Electing a leader in a ring with link failures. Acta Informatica 24, 79–91 (1987). https://doi.org/10.1007/BF00290707

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00290707

Keywords

Search

Navigation