• DocumentCode
    3213722
  • Title

    Optimal distributed leader election algorithm for synchronous complete network

  • Author

    Francis, Prince ; Saxena, Sanjeev

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
  • Volume
    1
  • fYear
    1998
  • fDate
    1998
  • Firstpage
    86
  • Abstract
    We address the problem of electing a leader in a synchronous complete network consisting of n nodes, each node has a unique ID. We give a message-optimal algorithm which runs in O(k) time using O(knα(k)) messages, where α(k)=1+(1/2k) and parameter k is a positive integer; in particular we get a constant time algorithm which uses O(n1+ε ) messages
  • Keywords
    computational complexity; distributed algorithms; optimisation; synchronisation; telecommunication networks; constant time algorithm; distributed algorithm; distributed system; message-optimal algorithm; network nodes; optimal distributed leader election algorithm; synchronous complete network; Bidirectional control; Clocks; Computer networks; Computer science; Costs; Distributed algorithms; Distributed computing; Intrusion detection; Nominations and elections;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON '98. 1998 IEEE Region 10 International Conference on Global Connectivity in Energy, Computer, Communication and Control
  • Conference_Location
    New Delhi
  • Print_ISBN
    0-7803-4886-9
  • Type

    conf

  • DOI
    10.1109/TENCON.1998.797083
  • Filename
    797083
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3213722