@inproceedings{646,
abstract = {{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.}},
author = {{Richa, Andrea W. and Scheideler, Christian}},
booktitle = {{Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
pages = {{416--430}},
title = {{{Self-Stabilizing DeBruijn Networks}}},
doi = {{10.1007/978-3-642-24550-3_31}},
year = {{2011}},
}