article

Stabilizing data-link over non-FIFO channels with optimal fault-resilience

Authors:

Maria Potop-Butucaru,

Sébastien TixeuilAuthors Info & Claims

Information Processing Letters, Volume 111, Issue 18

Pages 912 - 920

https://doi.org/10.1016/j.ipl.2011.06.010

Published: 01 September 2011 Publication History

Abstract

Self-stabilizing systems have the ability to converge to a correct behavior when started in any configuration. Most of the work done so far in the self-stabilization area assumed either communication via shared memory or via FIFO channels. This paper is the first to lay the bases for the design of self-stabilizing message passing algorithms over unreliable non-FIFO channels. We propose an optimal stabilizing data-link layer that emulates a reliable FIFO communication channel over unreliable capacity bounded non-FIFO channels (the channel capacity is known to the protocol).

References

[1]

Afek, Yehuda and Brown, Geoffrey M., Self-stabilization over unreliable communication media. Distributed Computing. v7 i1. 27-34.

[2]

Alon, Noga, Attiya, Hagit, Dolev, Shlomi, Dubois, Swan, Potop-Butucaru, Maria and Tixeuil, Sébastien, Brief announcement: Sharing memory in a self-stabilizing manner. In: Lecture Notes in Computer Science, Springer, Berlin/Heidelberg.

[3]

Beauquier, Joffroy and Kekkonen-Moneta, Synnöve, Fault-tolerance and self stabilization: Impossibility results and solutions using self-stabilizing failure detectors. International Journal of Systems Science. v28 i11. 1177-1187.

[4]

Burns, James E., Gouda, Mohamed G. and Miller, Raymond E., Stabilization and pseudo-stabilization. Distributed Computing. v7 i1. 35-42.

[5]

Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain, Snap-stabilizing linear message forwarding, in: 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010), 2010, pp. 546-559.

[6]

Alain Cournier, Swan Dubois, Vincent Villain, How to improve snap-stabilizing point-to-point communication space complexity? in: SSS 2009, pp. 195-208.

[7]

Alain Cournier, Swan Dubois, Vincent Villain, A snap-stabilizing point-to-point communication protocol in message-switched networks, in: IPDPS 2009, pp. 1-11.

[8]

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail and Tixeuil, Sébastien, Snap-stabilization in message-passing systems. Journal of Parallel and Distributed Computing (JPDC). v70 i12. 1220-1230.

[9]

Dijkstra, Edsger W., Self-stabilizing systems in spite of distributed control. Communications of the ACM. v17 i11. 643-644.

[10]

Dolev, Shlomi, Self-Stabilization. 2000. MIT Press, Cambridge.

[11]

Dolev, Shlomi, Israeli, Amos and Moran, Shlomo, Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing. v7 i1. 3-16.

[12]

Dolev, Shlomi, Israeli, Amos and Moran, Shlomo, Resource bounds for self-stabilizing message-driven protocols. SIAM Journal on Computing. v26 i1. 273-290.

[13]

Dolev, Shlomi and Tzachar, Nir, Empire of colonies: Self-stabilizing and self-organizing distributed algorithms. In: Shvartsman, Alexander A. (Ed.), Lecture Notes in Computer Science, vol. 4305. Springer. pp. 230-243.

[14]

Gouda, Mohamed G. and Multari, Nicholas J., Stabilizing communication protocols. IEEE Transactions on Computers. v40 i4. 448-458.

[15]

Howell, Rodney R., Nesterenko, Mikhail and Mizuno, Masaaki, Finite-state self-stabilizing protocols in message-passing systems. In: Arora, Anish (Ed.), WSS, IEEE Computer Society. pp. 62-69.

[16]

Lynch, Nancy A., Distributed Algorithms. 1996. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.

[17]

Tixeuil, Sébastien, Self-stabilizing algorithms. In: Chapman & Hall/CRC Applied Algorithms and Data Structures, CRC Press, Taylor & Francis Group. pp. 26.1-26.45.

[18]

Varghese, George, Self-stabilization by counter flushing. SIAM Jounal on Computing. v30 i2. 486-510.

Cited By

Oglio JHood KNesterenko MTixeuil SGeorgiou CSchiller EAli-Eldin AIosup A(2022)QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract SimulatorProceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems10.1145/3524053.3542744(40-46)Online publication date: 25-Jul-2022
https://dl.acm.org/doi/10.1145/3524053.3542744
Dolev SPetig TSchiller E(2022)Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing NetworksAlgorithmica10.1007/s00453-022-01023-w85:1(216-276)Online publication date: 20-Aug-2022
https://dl.acm.org/doi/10.1007/s00453-022-01023-w
Dong RSudo YIzumi TMasuzawa T(2021)Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable CommunicationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_22(335-349)Online publication date: 17-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-91081-5_22
Show More Cited By

Index Terms

Stabilizing data-link over non-FIFO channels with optimal fault-resilience
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Index terms have been assigned to the content through auto-classification.

Recommendations

Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Abstract
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed ...
Fault-containing self-stabilizing distributed protocols

Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...
A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks
OPODIS'05: Proceedings of the 9th international conference on Principles of Distributed Systems

Self-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring ...

Comments

Information & Contributors

Information

Published In

cover image Information Processing Letters

Information Processing Letters Volume 111, Issue 18

September, 2011

51 pages

ISSN:0020-0190

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2011.

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 September 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Oglio JHood KNesterenko MTixeuil SGeorgiou CSchiller EAli-Eldin AIosup A(2022)QUANTAS: Quantitative User-friendly Adaptable Networked Things Abstract SimulatorProceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems10.1145/3524053.3542744(40-46)Online publication date: 25-Jul-2022
https://dl.acm.org/doi/10.1145/3524053.3542744
Dolev SPetig TSchiller E(2022)Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing NetworksAlgorithmica10.1007/s00453-022-01023-w85:1(216-276)Online publication date: 20-Aug-2022
https://dl.acm.org/doi/10.1007/s00453-022-01023-w
Dong RSudo YIzumi TMasuzawa T(2021)Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable CommunicationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_22(335-349)Online publication date: 17-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-91081-5_22
Devismes SIlcinkas DJohnen CHansdah RKrishnaswamy DVaidya N(2019)Silent self-stabilizing scheme for spanning-tree-like constructionsProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288607(158-167)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288607
Bonomi SDolev SPotop-Butucaru MRaynal MGeorgiou CSpirakis P(2015)Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing SystemsProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767441(471-479)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767441
Dolev SHanemann ASchiller ESharma S(2012)Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networksProceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems10.1007/978-3-642-33536-5_14(133-147)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33536-5_14
Alon NAttiya HDolev SDubois SPotop-Butucaru MTixeuil S(2011)Pragmatic self-stabilization of atomic memory in message-passing systemsProceedings of the 13th international conference on Stabilization, safety, and security of distributed systems10.5555/2050613.2050617(19-31)Online publication date: 10-Oct-2011
https://dl.acm.org/doi/10.5555/2050613.2050617

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents