Self-stabilizing De Bruijn networks

Andrea Richa, Christian Scheideler, Phillip Stevens

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

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(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.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings
Pages416-430
Number of pages15
DOIs
StatePublished - Oct 21 2011
Event13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011 - Grenoble, France
Duration: Oct 10 2011Oct 12 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6976 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011
CountryFrance
CityGrenoble
Period10/10/1110/12/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Self-stabilizing De Bruijn networks'. Together they form a unique fingerprint.

  • Cite this

    Richa, A., Scheideler, C., & Stevens, P. (2011). Self-stabilizing De Bruijn networks. In Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings (pp. 416-430). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6976 LNCS). https://doi.org/10.1007/978-3-642-24550-3_31