A deterministic worst-case message complexity optimal solution for resource discovery

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)) or bits (O(n log n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)) on the number of rounds.

A Self-stabilizing General De Bruijn Graph

“…People came up with self-stabilizing protocols for various types of overlays, like sorted lists [17], rings [19], spanning trees [1], Chord graphs [11], Skip graphs [5] and many more. A self-stabilizing protocol for the clique has been presented in [12]. There is even a universal approach, which is able to derive self-stabilizing protocols for several types of topologies [3].…”