Calling names on nameless networks

We consider the problem of constructing a rooted spanning tree in an anonymous (connected) network. For the case where no bound is known on the network size, we give the following algorithms, that have error probability ε. (1) A message terminating algorithm that runs in O(n) time and O(n log n + m(1 + log(n²/m))) messages, each of size O(log(n/ε)), where n and m are the number of nodes and links in the network. (2) A message terminating algorithm with expected running time O(n log log(n/ε)) and expected message complexity O(n log n + m log log (n/ε)), each of size O(log(n/ε)). For any fixed error probability ε, the expected time and message complexity can be reduced to O(nf(n)) and O(n log n + mf(n)), respectively, where f(n) is some slowly-growing function, such as log n. However, this requires the use of longer messages. In case an upper bound on the network size is known, we give a processor terminating algorithm with error probability ε that runs in O(n) time, and O(n log n + m) messages. Finally, in case both an upper bound and a lower bound are known, which are within a factor of two, we give an algorithm that processor terminates and always succeeds, in expected O(n) time and O(n log n + m) messages.