Polynomial silent self-stabilizing p-star decomposition

Mohammed Haddad; Colette Johnen; Sven Köhler

doi:10.1007/978-3-319-49259-9_15

Polynomial silent self-stabilizing p-star decomposition

Mohammed Haddad
, Colette Johnen
, Sven Köhler

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12Δm+ O(m+ n) moves, where m is the number of edges, n is the number of nodes, and Δ is the maximum node degree. Regarding the move complexity, our algorithm outperforms the previously known best algorithm by a factor of Δ. While the round complexity for the previous algorithm was unknown, we show a 5[n/p+1] + 5 bound for our algorithm.

Original language	English
Title of host publication	Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings
Editors	Franck Petit, Borzoo Bonakdarpour
Publisher	Springer Verlag
Pages	185-189
Number of pages	5
ISBN (Print)	9783319492582
DOIs	https://doi.org/10.1007/978-3-319-49259-9_15
State	Published - 2016
Externally published	Yes
Event	18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016 - Lyon, France Duration: 7 Nov 2016 → 10 Nov 2016

Publication series

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

Conference

Conference	18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016
Country/Territory	France
City	Lyon
Period	7/11/16 → 10/11/16

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG 2016.

Funding

This study has been carried out with financial support from the French State, managed by the French National Research Agency (ANR) in the frame of the “Investments for the future” Programme IdEx Bordeaux - CPU (ANR-10-IDEX-03-02) and by the Sustainability Center Freiburg, Germany.

Funders
ANR-10-IDEX-03-02
Sustainability Center Freiburg
Agence Nationale de la Recherche

Access to Document

10.1007/978-3-319-49259-9_15

Cite this

Haddad, M., Johnen, C., & Köhler, S. (2016). Polynomial silent self-stabilizing p-star decomposition. In F. Petit, & B. Bonakdarpour (Eds.), Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings (pp. 185-189). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10083 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-49259-9_15

Haddad, Mohammed ; Johnen, Colette ; Köhler, Sven. / Polynomial silent self-stabilizing p-star decomposition. Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. editor / Franck Petit ; Borzoo Bonakdarpour. Springer Verlag, 2016. pp. 185-189 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{58d5420ad01c44dcbf8c0e46d79dde9a,

title = "Polynomial silent self-stabilizing p-star decomposition",

abstract = "We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12Δm+ O(m+ n) moves, where m is the number of edges, n is the number of nodes, and Δ is the maximum node degree. Regarding the move complexity, our algorithm outperforms the previously known best algorithm by a factor of Δ. While the round complexity for the previous algorithm was unknown, we show a 5[n/p+1] + 5 bound for our algorithm.",

author = "Mohammed Haddad and Colette Johnen and Sven K{\"o}hler",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016 ; Conference date: 07-11-2016 Through 10-11-2016",

year = "2016",

doi = "10.1007/978-3-319-49259-9\_15",

language = "אנגלית",

isbn = "9783319492582",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "185--189",

editor = "Franck Petit and Borzoo Bonakdarpour",

booktitle = "Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings",

address = "גרמניה",

}

Haddad, M, Johnen, C & Köhler, S 2016, Polynomial silent self-stabilizing p-star decomposition. in F Petit & B Bonakdarpour (eds), Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10083 LNCS, Springer Verlag, pp. 185-189, 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016, Lyon, France, 7/11/16. https://doi.org/10.1007/978-3-319-49259-9_15

Polynomial silent self-stabilizing p-star decomposition. / Haddad, Mohammed; Johnen, Colette; Köhler, Sven.
Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. ed. / Franck Petit; Borzoo Bonakdarpour. Springer Verlag, 2016. p. 185-189 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10083 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Polynomial silent self-stabilizing p-star decomposition

AU - Haddad, Mohammed

AU - Johnen, Colette

AU - Köhler, Sven

PY - 2016

Y1 - 2016

N2 - We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12Δm+ O(m+ n) moves, where m is the number of edges, n is the number of nodes, and Δ is the maximum node degree. Regarding the move complexity, our algorithm outperforms the previously known best algorithm by a factor of Δ. While the round complexity for the previous algorithm was unknown, we show a 5[n/p+1] + 5 bound for our algorithm.

AB - We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12Δm+ O(m+ n) moves, where m is the number of edges, n is the number of nodes, and Δ is the maximum node degree. Regarding the move complexity, our algorithm outperforms the previously known best algorithm by a factor of Δ. While the round complexity for the previous algorithm was unknown, we show a 5[n/p+1] + 5 bound for our algorithm.

UR - https://www.scopus.com/pages/publications/84995582890

U2 - 10.1007/978-3-319-49259-9_15

DO - 10.1007/978-3-319-49259-9_15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84995582890

SN - 9783319492582

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

SP - 185

EP - 189

BT - Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings

A2 - Petit, Franck

A2 - Bonakdarpour, Borzoo

PB - Springer Verlag

T2 - 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2016

Y2 - 7 November 2016 through 10 November 2016

ER -

Haddad M, Johnen C, Köhler S. Polynomial silent self-stabilizing p-star decomposition. In Petit F, Bonakdarpour B, editors, Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, SSS 2016, Proceedings. Springer Verlag. 2016. p. 185-189. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-49259-9_15

Polynomial silent self-stabilizing p-star decomposition

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this