--- res: bibo_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.@eng' bibo_authorlist: - foaf_Person: foaf_givenName: Michael foaf_name: Feldmann, Michael foaf_surname: Feldmann foaf_workInfoHomepage: http://www.librecat.org/personId=23538 - 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-69084-1_17 bibo_volume: 10616 dct_date: 2017^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/978-3-319-69083-4 dct_language: eng dct_publisher: Springer, Cham@ dct_title: A Self-Stabilizing General De Bruijn Graph@ ...