@inproceedings{125,
abstract = {{Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.}},
author = {{Feldmann, Michael and Scheideler, Christian}},
booktitle = {{Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
isbn = {{978-3-319-69083-4}},
pages = {{250--264 }},
publisher = {{Springer, Cham}},
title = {{{A Self-Stabilizing General De Bruijn Graph}}},
doi = {{10.1007/978-3-319-69084-1_17}},
volume = {{10616}},
year = {{2017}},
}