Efficient leader election using sense of direction

DOI10.1007/S004460050033MaRDI QIDQ5137338zbMATH OpenOpenAlexFDO

Authors Gurdip Singh

Publication date 2 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050033

zbMATH Keywords

complete networksdistributed algorithmleader electionmessage complexity

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Leader election in complete networks
• Leader Election in Complete Networks
• scientific article; zbMATH DE number 1759418
• An improved election algorithm in chordal ring networks
• Deterministic leader election in O(D+ n) time with messages of size O(1)

Cites work

• A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
• Efficient elections in chordal ring networks
• scientific article; zbMATH DE number 3864485 (Why is no real title available?)
• Optimal lower bounds for some distributed algorithms for a complete network of processors
• Towards optimal distributed election on chordal rings

Cited in

(10)

• Symmetries and sense of direction in labeled graphs
• Computing on anonymous networks with sense of direction
• Sense of direction in distributed computing
• Distributed election in a circle without a global sense of orientation
• scientific article; zbMATH DE number 1305532 (Why is no real title available?)
• Leader Election in Complete Networks
• scientific article; zbMATH DE number 1759418 (Why is no real title available?)
• Torus orientation
• Simple and Efficient Leader Election
• Singularly optimal randomized leader election

This page was built for publication: Efficient leader election using sense of direction

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