@article{327,
abstract = {{We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.}},
author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
journal = {{Theoretical Computer Science}},
pages = {{67--79}},
publisher = {{Elsevier}},
title = {{{A deterministic worst-case message complexity optimal solution for resource discovery}}},
doi = {{10.1016/j.tcs.2014.11.027}},
year = {{2015}},
}