A Self-Stabilizing General De Bruijn Graph Feldmann, Michael Scheideler, Christian ddc:040 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. Springer, Cham 2017 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://ris.uni-paderborn.de/record/125 Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In: <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 10616. Lecture Notes in Computer Science. Springer, Cham; 2017:250-264. doi:<a href="https://doi.org/10.1007/978-3-319-69084-1_17">10.1007/978-3-319-69084-1_17</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-69084-1_17 info:eu-repo/semantics/altIdentifier/isbn/978-3-319-69083-4 info:eu-repo/semantics/altIdentifier/arxiv/1708.06542 info:eu-repo/semantics/closedAccess