Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs

Provided by: ETH Zurich
Topic: Networking
Format: PDF
The authors study computability in networks, referred to hereafter as distributed computability. Distributed computability is equivalent to classic centralized (turing machine) computability when the nodes are equipped with unique (comparable) identifiers. However, as the researcher noticed in seminal work, distributed computability becomes fascinating in anonymous networks, where nodes do not have unique IDs. What can be computed with deterministic algorithms merely depends on the topology of the network, and it is well known that problems like maximal independent set can be solved in an anonymous network only if the nodes are allowed to toss coins.

Find By Topic