TY - CONF AB - This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected. AU - Richa, Andrea W. AU - Scheideler, Christian ID - 646 T2 - Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) TI - Self-Stabilizing DeBruijn Networks ER -