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

We consider leader election and spanning tree construction problems in a synchronous network. Protocols are designed under the assumption that nodes in the network have identifiers but the size of an identifier is unlimited. We present fast protocols with runtime $O(D\log L+L)$, where $L$ is the size of the minimal identifier and $D$ is the network diameter.