---
res:
bibo_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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Sebastian
foaf_name: Kniesburges, Sebastian
foaf_surname: Kniesburges
- foaf_Person:
foaf_givenName: Andreas
foaf_name: Koutsopoulos, Andreas
foaf_surname: Koutsopoulos
- foaf_Person:
foaf_givenName: Christian
foaf_name: Scheideler, Christian
foaf_surname: Scheideler
foaf_workInfoHomepage: http://www.librecat.org/personId=20792
bibo_doi: 10.1007/978-3-319-03578-9_14
dct_date: 2013^xs_gYear
dct_title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource
Discovery@
...