Skip to main content
SpringerLink
Log in

Fast protocols for leader election and spanning tree construction in a distributed network

  • Communication Network Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We consider leader election and spanning tree construction problems in a synchronous network. Protocols are designed under the assumption that nodes in the network have identifiers but the size of an identifier is unlimited. We present fast protocols with runtime O(D log L+L), where L is the size of the minimal identifier and D is the network diameter.

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. Lynch, N.A., Distributed Algorithms, San Francisco, CA: Morgan Kaufmann, 1997.

    Google Scholar 

  2. Wattenhofer, R, Principles of Distributed Computing, Lecture Material, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2014. Available at http://dcg.ethz.ch/lectures/fs14/podc.

    Google Scholar 

  3. Peleg, D. and Rubinovich, V., A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction, SIAM J. Comput., 2000, vol. 30, no. 5, pp. 1427–1442.

    Article  MathSciNet  MATH  Google Scholar 

  4. Dinitz, Y., Moran, Sh., and Rajsbaum, S, Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings, J. ACM, 2008, vol. 55, no. 1, pp. 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  5. Vyalyi, M.N. and Khuziev, I.M, Distributed Communication Complexity of Spanning Tree Construction, Probl. Peredachi Inf., 2015, vol. 51, no. 1, pp. 54–71 [Probl. Inf. Trans. (Engl. Transl.), 2015, vol. 51, no. 1, pp. 49–65].

    MathSciNet  MATH  Google Scholar 

  6. Itai, A. and Rodeh, M, Symmetry Breaking in Distributed Networks, Inform. Comput., 1990, vol. 88, no. 1, pp. 60–87.

    Article  MathSciNet  MATH  Google Scholar 

  7. Perlman, R, An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN, ACM SIGCOMM Comput. Commun. Rev., 1985, vol. 15, no. 4, pp. 44–53.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, Russia

    M. N. Vyalyi

  2. National Research University—Higher School of Economics, Moscow, Russia

    M. N. Vyalyi

  3. Moscow Institute of Physics and Technology (State University), Moscow, Russia

    M. N. Vyalyi & I. M. Khuziev

Authors
  1. M. N. Vyalyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. M. Khuziev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. N. Vyalyi.

Additional information

Supported in part by the Russian Foundation for Basic Research, project no. 14-01-00641.

Original Russian Text © M.N. Vyalyi, I.M. Khuziev, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 2, pp. 91–111.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vyalyi, M.N., Khuziev, I.M. Fast protocols for leader election and spanning tree construction in a distributed network. Probl Inf Transm 53, 183–201 (2017). https://doi.org/10.1134/S0032946017020065

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946017020065

Search

Navigation