---
res:
bibo_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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Andrea W.
foaf_name: Richa, Andrea W.
foaf_surname: Richa
- 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-642-24550-3_31
dct_date: 2011^xs_gYear
dct_title: Self-Stabilizing DeBruijn Networks@
...