Skip to main content
SpringerLink
Log in
Book cover

International Conference on Distributed Computing and Internet Technology

ICDCIT 2004: Distributed Computing and Internet Technology pp 22–31Cite as

Fair Leader Election by Randomized Voting

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3347))

Abstract

Leader election

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahamson, K., Adler, A., Gelbart, R., Higham, L., Kirkpatrick, D.: The bit complexity of randomized leader election on a ring. SIAM J. Comput. 18(1), 12–29 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the twelfth annual ACM symposium on Theory of computing, pp. 82–93 (1980)

    Google Scholar 

  3. Chang, E., Roberts, R.: An improved algorithm for decentralized extrema-finding in circularly configurations of processes. Commun. ACM 22(5), 281–283 (1979)

    Article  MATH  Google Scholar 

  4. Dolev, D., Klawe, M.M., Rodeh, M.: An O(n logn) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms 3(3), 245–260 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Franklin, R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM 25(5), 336–337 (1982)

    Article  MathSciNet  Google Scholar 

  6. Higham, L.: Randomized Distributed Computing on Rings. Phd thesis, University of British Columbia (1988)

    Google Scholar 

  7. Higham, L.: Simple randomized leader election with extensions. Technical report, University of Calgary (1988)

    Google Scholar 

  8. Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processors. Commun. ACM 23(11), 627–628 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  9. Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation 88(1), 60–87 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Burns, J.E.: A formal model for message passing systems. Technical Report TR-91, Indiana University (1980)

    Google Scholar 

  11. Le Lann, G.: Distributed systems-towards a formal approach. In: Proceedings of the IFIP Congress 77, pp. 155–160. North-Holland, Amsterdam (1977)

    Google Scholar 

  12. Peterson, G.L.: An O(n logn) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems 4(4), 758–762 (1982)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Enginnering, IIT, Kharagpur, 721302, India

    Siddhartha Brahma, Sandeep Macharla & Sudebkumar Prasant Pal

  2. Dept. of Mathematics, IIT, Kharagpur

    Sudhir Kumar Singh

Authors
  1. Siddhartha Brahma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandeep Macharla
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sudebkumar Prasant Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sudhir Kumar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India

    R. K. Ghosh

  2. Department of Computer and Information Science, University of Hyderabad, Central University PO, 500 046, AP, India

    Hrushikesha Mohanty

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brahma, S., Macharla, S., Pal, S.P., Singh, S.K. (2004). Fair Leader Election by Randomized Voting. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30555-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24075-4

  • Online ISBN: 978-3-540-30555-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation