We present fast deterministic distributed protocols in synchronous networks for leader election and spanning tree construction. The protocols are designed under the assumption that nodes in a network have identifiers but the size of an identifier is unlimited. So time bounds of protocols depend on the sizes of identifiers. We present fast protocols running in time O(DlogL+L), where L is the size of the minimal identifier and D is the diameter of a network.
@article{arxiv.1512.01795,
title = {Distributed protocols for spanning tree construction and leader election},
author = {I. M. Khuziev and M. N. Vyalyi},
journal= {arXiv preprint arXiv:1512.01795},
year = {2016}
}
Comments
There are a lot of changes in the second version. Exposition was made more detailed. Protocols are changed to make formal proofs easier and to get a better time bounds. Submitted to Problems of Information Transmission