• DocumentCode
    914529
  • Title

    Optimal resilient distributed algorithms for ring election

  • Author

    Chan, M.Y. ; Chin, F.Y.L.

  • Author_Institution
    Dept. of Comput. Sci., Hong Kong Univ., Hong Kong
  • Volume
    4
  • Issue
    4
  • fYear
    1993
  • fDate
    4/1/1993 12:00:00 AM
  • Firstpage
    475
  • Lastpage
    480
  • Abstract
    The problem of electing a leader in a dynamic ring in which processors are permitted to fail and recover during election is discussed. It is shown that θ(n log n+kr) messages, counting only messages sent by functional processors, are necessary and sufficient for dynamic ring election, where kr is the number of processor recoveries experienced
  • Keywords
    computational complexity; multiprocessing systems; system recovery; distributed algorithms; dynamic ring; message complexity; processor recoveries; ring election; Computer science; Distributed algorithms; Nominations and elections; Protocols; Relays; Switches; Telecommunication network reliability;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.219762
  • Filename
    219762
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=914529