Distributed protocols for spanning tree construction and leader election

TL;DR

This paper introduces efficient deterministic distributed protocols for leader election and spanning tree construction in synchronous networks, with time complexity depending on network diameter and identifier size.

Contribution

The paper proposes new protocols that operate in optimal time bounds based on network diameter and identifier size, improving existing distributed algorithms.

Findings

Protocols run in $O(D ext{log}L + L)$ time

Protocols are deterministic and fast in synchronous networks

Time bounds depend on identifier size and network diameter

Abstract

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(D\log L+L)$, where $L$ is the size of the minimal identifier and $D$ is the diameter of a network.