Issue No. 03 - March (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.491576
<p><b>Abstract</b>—We study the problem of leader election in the presence of intermittent link failures. We assume that up to <it>N</it>/2 − 1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity <it>O</it>(<it>N</it><super>2</super>).</p>
Election, complete networks, intermittent link failures, distributed algorithms, message complexity.
G. Singh, "Leader Election in the Presence of Link Failures," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 231-236, 1996.