TY - GEN
T1 - Self-stabilizing De Bruijn networks
AU - Richa, Andrea
AU - Scheideler, Christian
AU - Stevens, Phillip
PY - 2011
Y1 - 2011
N2 - 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(logn) 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.
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(logn) 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.
UR - http://www.scopus.com/inward/record.url?scp=80054709738&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054709738&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24550-3_31
DO - 10.1007/978-3-642-24550-3_31
M3 - Conference contribution
AN - SCOPUS:80054709738
SN - 9783642245497
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 416
EP - 430
BT - Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings
T2 - 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011
Y2 - 10 October 2011 through 12 October 2011
ER -