Space-efficient fault-containment in dynamic networks

Sven Köhler; Volker Turau

doi:10.1007/978-3-642-24550-3_24

Space-efficient fault-containment in dynamic networks

Sven Köhler, Volker Turau

Hamburg University of Technology

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

2 Scopus citations

Abstract

Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault-containment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for fault-containing self-stabilization increase the memory footprint by a factor of 2m/n.

Original language	English
Title of host publication	Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings
Pages	311-325
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-24550-3_24
State	Published - 2011
Externally published	Yes
Event	13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011 - Grenoble, France Duration: 10 Oct 2011 → 12 Oct 2011

Publication series

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

Conference

Conference	13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011
Country/Territory	France
City	Grenoble
Period	10/10/11 → 12/10/11

Bibliographical note

Funding Information:
This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.

Funding

This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.

Funders	Funder number
Deutsche Forschungsgemeinschaft	TU 221/3-1

Access to Document

10.1007/978-3-642-24550-3_24

Cite this

Köhler, S., & Turau, V. (2011). Space-efficient fault-containment in dynamic networks. In Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings (pp. 311-325). (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_24

@inproceedings{7e5126e375e74772a53a4404202a7d84,

title = "Space-efficient fault-containment in dynamic networks",

abstract = "Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault-containment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for fault-containing self-stabilization increase the memory footprint by a factor of 2m/n.",

author = "Sven K{\"o}hler and Volker Turau",

note = "Funding Information: This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.; 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011 ; Conference date: 10-10-2011 Through 12-10-2011",

year = "2011",

doi = "10.1007/978-3-642-24550-3_24",

language = "אנגלית",

isbn = "9783642245497",

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

pages = "311--325",

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

}

Köhler, S & Turau, V 2011, Space-efficient fault-containment in dynamic networks. in Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6976 LNCS, pp. 311-325, 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_24

Space-efficient fault-containment in dynamic networks. / Köhler, Sven; Turau, Volker.
Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings. 2011. p. 311-325 (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 proceeding › Conference contribution › peer-review

TY - GEN

T1 - Space-efficient fault-containment in dynamic networks

AU - Köhler, Sven

AU - Turau, Volker

N1 - Funding Information: This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.

PY - 2011

Y1 - 2011

N2 - Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault-containment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for fault-containing self-stabilization increase the memory footprint by a factor of 2m/n.

AB - Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault-containment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for fault-containing self-stabilization increase the memory footprint by a factor of 2m/n.

UR - http://www.scopus.com/inward/record.url?scp=80054687284&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24550-3_24

DO - 10.1007/978-3-642-24550-3_24

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

AN - SCOPUS:80054687284

SN - 9783642245497

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

SP - 311

EP - 325

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 -

Köhler S, Turau V. Space-efficient fault-containment in dynamic networks. In Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings. 2011. p. 311-325. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-24550-3_24

Space-efficient fault-containment in dynamic networks

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this