Self-stabilizing De Bruijn networks

Andrea Richa, Christian Scheideler, Phillip Stevens

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

16 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages416-430
Number of pages15
Volume6976 LNCS
DOIs
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Overlay networks
Topology
De Bruijn Graph
Local Algorithms
Overlay Networks
Dynamic Networks
Vertex of a graph
Network Topology
Control Algorithm
Routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Richa, A., Scheideler, C., & Stevens, P. (2011). Self-stabilizing De Bruijn networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6976 LNCS, 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

Self-stabilizing De Bruijn networks. / Richa, Andrea; Scheideler, Christian; Stevens, Phillip.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS 2011. p. 416-430 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6976 LNCS).

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

Richa, A, Scheideler, C & Stevens, P 2011, Self-stabilizing De Bruijn networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6976 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6976 LNCS, pp. 416-430, 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011, Grenoble, France, 10/10/11. https://doi.org/10.1007/978-3-642-24550-3_31
Richa A, Scheideler C, Stevens P. Self-stabilizing De Bruijn networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS. 2011. p. 416-430. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24550-3_31
Richa, Andrea ; Scheideler, Christian ; Stevens, Phillip. / Self-stabilizing De Bruijn networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6976 LNCS 2011. pp. 416-430 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4c6f4e47baf0454e8f78c2f7a5f66b37,
title = "Self-stabilizing De Bruijn networks",
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.",
author = "Andrea Richa and Christian Scheideler and Phillip Stevens",
year = "2011",
doi = "10.1007/978-3-642-24550-3_31",
language = "English (US)",
isbn = "9783642245497",
volume = "6976 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "416--430",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

VL - 6976 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 416

EP - 430

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -