Fast protocols for leader election and spanning tree construction in a distributed network

DOI10.1134/S0032946017020065MaRDI QIDQ2285076zbMATH OpenOpenAlexFDO

Authors I. M. Khuziev, Mikhail Vyalyi

Publication date 16 January 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946017020065

Mathematics Subject Classification ID

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

Recommendations

• Leader election in complete networks
• Leader Election in Complete Networks
• Distributed communication complexity of spanning tree construction
• Deterministic leader election in O(D+ n) time with messages of size O(1)
• scientific article; zbMATH DE number 6313182

Cites work

• A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
• Bit complexity of breaking and achieving symmetry in chains and rings
• Distributed communication complexity of spanning tree construction
• Symmetry breaking in distributed networks

Cited in

(1)

• Distributed communication complexity of spanning tree construction

This page was built for publication: Fast protocols for leader election and spanning tree construction in a distributed network

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