Calling names on nameless networks

Baruch Schieber, Marc Snir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


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(n2/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.

Original languageEnglish (US)
Title of host publicationProc Eighth ACM Symp Princ Distrib Comput
PublisherPubl by ACM
Number of pages10
ISBN (Print)0897913264
StatePublished - 1989
Externally publishedYes
EventProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing - Edmonton, Alberta, Can
Duration: Aug 14 1989Aug 16 1989

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


ConferenceProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing
CityEdmonton, Alberta, Can

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this