Issue No. 04 - April (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2189
Electron in asynchronous complete networks is considered for the case in which the links may fail intermittently and undetectably. Undetectable link failure is consistent with the standard model of distributed algorithms in which link delays can be arbitrary but finite. An algorithm is given that correctly solves the problem when the links fail before or during the execution of the algorithm. I
fault tolerant distributed algorithms; undetected link failure; election; complete networks; design parameter; node identifiers; computer networks; distributed processing; fault tolerant computing.
H. Abu-Amara, "Fault-Tolerant Distributed Algorithm for Election in Complete Networks," in IEEE Transactions on Computers, vol. 37, no. , pp. 449-453, 1988.