• DocumentCode
    858128
  • Title

    Leader election in the presence of link failures

  • Author

    Singh, Gurdip

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
  • Volume
    7
  • Issue
    3
  • fYear
    1996
  • fDate
    3/1/1996 12:00:00 AM
  • Firstpage
    231
  • Lastpage
    236
  • Abstract
    We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2-1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N2)
  • Keywords
    communication complexity; distributed algorithms; protocols; leader election; link failures; message complexity; message optimal algorithm; protocol; Algorithm design and analysis; Distributed algorithms; Distributed computing; Electronic mail; Nominations and elections; Protocols;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.491576
  • Filename
    491576
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=858128