Title :
Leader election in the presence of link failures
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
fDate :
3/1/1996 12:00:00 AM
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;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
