@inproceedings{564,
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 add ress 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)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.}},
author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
booktitle = {{Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}},
pages = {{165--176}},
title = {{{A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}}},
doi = {{10.1007/978-3-319-03578-9_14}},
year = {{2013}},
}