Fault-tolerant distributed algorithm for election in complete networks
The authors consider election in asynchronous complete networks when 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. They give an algorithm that correctly solves the problem when the links fail before or during the execution of the algorithm. Let n be the number of nodes in the network, f be the maximum number of faulty links, and r be a design parameter. The algorithm uses no more than O(nrf + (nr/(r - 1)) log (n/(r - 1)f)) messages, runs in time O(n/(r - 1)f), and uses at most O(log vertical bar T vertical bar) bits per message, where vertical bar T vertical bar is the cardinality of the set of node identifiers.
- Research Organization:
- Dept. of Electrical and Computer Engineering and the Coordinated Science Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL (US)
- OSTI ID:
- 7106986
- Journal Information:
- IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. 37:4; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
An asynchronous algorithm for scattering information between the active nodes of a multicomputer system
Fast fault-tolerant concurrent access to shared objects