Election in asynchronous complete networks with intermittent link failures

DOI10.1109/12.293257MaRDI QIDQ4419728zbMATH OpenOpenAlexFDO

Authors Hosame Abu-Amara, Jahnavi Lokre

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.293257

zbMATH Keywords

distributed networksfault-tolerant leader election

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4096766
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Fault tolerant distributed majority commitment
• Electing a leader in a ring with link failures
• Leader election in the presence of n-1 initial failures

Cited in

(5)

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Fault tolerant distributed majority commitment
• scientific article; zbMATH DE number 4096766 (Why is no real title available?)
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• From an intermittent rotating star to a leader

This page was built for publication: Election in asynchronous complete networks with intermittent link failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419728)