Leader election in the presence of link failures
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (3), 231-236
- https://doi.org/10.1109/71.491576
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Making distributed spanning tree algorithms fault-resilientPublished by Springer Nature ,2006
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete NetworksSIAM Journal on Computing, 1991
- Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of directionLecture Notes in Computer Science, 1989
- Fault-tolerant distributed algorithm for election in complete networksIEEE Transactions on Computers, 1988
- The effects of link failures on computations in asynchronous ringsPublished by Association for Computing Machinery (ACM) ,1986