Altisen Karine
ABSTRACT
Self-stabilization is a general paradigm that characterizes the ability of a distributed system to recover from transient faults. Since its introduction by Dijkstra in 1974, self-stabilization has been successfully applied to efficiently solve many networking tasks. However, most of the literature focuses on bidirectional networks. Now, in today’s networks such as WSNs, some communication channels may be one-way only. Considering such network topologies, a.k.a. directed graphs, makes self-stabilization more complicated, and sometimes even impossible. In this paper, we investigate the gap in terms of requirements and efficiency when considering a directed graph instead of an undirected one as network topology for a self-stabilizing algorithm. Our case study is a variant of a synchronous unison algorithm proposed by Arora et al.; the synchronous unison being a clock synchronization problem.
- Yehuda Afek and Anat Bremler-Barr. 1998. Self-Stabilizing Unidirectional Network Algorithms by Power Supply. Chic. J. Theor. Comput. Sci. 1998 (1998).Google Scholar
- Karine Altisen and Stéphane Devismes. 2017. On probabilistic snap-stabilization. TCS 688(2017), 49–76.Google ScholarCross Ref
- Karine Altisen, Stéphane Devismes, Swan Dubois, and Franck Petit. 2019. Introduction to Distributed Self-Stabilizing Algorithms. Morgan & Claypool Publishers.Google Scholar
- Anish Arora, Shlomi Dolev, and Mohamed G. Gouda. 1991. Maintaining Digital Clocks in Step. PPL 1, 11–18.Google ScholarCross Ref
- Samuel Bernard, Stéphane Devismes, Maria Gradinariu Potop-Butucaru, and Sébastien Tixeuil. 2009. Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. In IPDPS’09. Roma, Italia, 1–8.Google Scholar
- Zeev Collin and Shlomi Dolev. 1994. Self-Stabilizing Depth-First Search. Inf. Process. Lett. 49, 6 (1994), 297–301.Google ScholarDigital Library
- Alain Cournier, Stéphane Devismes, and Vincent Villain. 2005. A Snap-Stabilizing DFS with a Lower Space Requirement. In SSS’05. 33–47.Google Scholar
- Alain Cournier, Stéphane Devismes, and Vincent Villain. 2006. Snap-Stabilizing PIF and Useless Computations. In ICPADS’06. 39–48.Google Scholar
- Jean-Michel Couvreur, Nissim Francez, and Mohamed G. Gouda. 1992. Asynchronous Unison (Extended Abstract). In ICDCS’92. 486–493.Google Scholar
- Ajoy Kumar Datta, Lawrence L. Larmore, and Priyanka Vemula. 2011. An O(n)-time self-stabilizing leader election algorithm. JPDC 71, 11 (2011), 1532–1544.Google ScholarDigital Library
- Sylvie Delaët, Bertrand Ducourthial, and Sébastien Tixeuil. 2006. Self-stabilization with r-operators revisited. Journal of Aerospace Computing, Information, and Communication (JACIC) 3, 10(2006), 498–514.Google ScholarCross Ref
- Edsger W. Dijkstra. 1974. Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 11 (1974), 643–644.Google ScholarDigital Library
- Shimon Even and Sergio Rajsbaum. 1990. Unison in Distributed Networks. In Sequences, Renato M. Capocelli (Ed.). New York, NY, 479–487.Google Scholar
- Shing-Tsaan Huang and Tzong-Jye Liu. 1999. Self-stabilizing 2m-Clock for Unidirectional Rings of Odd Size. Distributed Comput. 12, 1 (1999), 41–46.Google ScholarDigital Library
- Hirotsugu Kakugawa and Masafumi Yamashita. 2002. Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon. JPDC 62, 5 (2002), 885–898.Google ScholarDigital Library
- Shmuel Katz and Kenneth J. Perry. 1993. Self-Stabilizing Extensions for Message-Passing Systems. Distributed Comput. 7, 1 (1993), 17–26.Google ScholarDigital Library
- Alain J. Mayer, Rafail Ostrovsky, and Moti Yung. 1996. Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. In SODA’96. 564–573.Google Scholar
- Sébastien Tixeuil. 2006. Vers l’auto-stabilisation des systèmes à grande échelle. Habilitation à diriger des recherches. Université Paris Sud - Paris XI.Google Scholar
Index Terms
- Self-stabilizing Synchronous Unison in Directed Networks
Recommendations
Self-stabilizing group communication in directed networks
This paper presents the first self-stabilizing group membership service, multicast service, and resource allocation service for directed networks. The first group communication algorithm is based on a token circulation over a virtual ring. The second ...
Self-stabilizing group communication in directed networks
SSS'03: Proceedings of the 6th international conference on Self-stabilizing systemsSelf-stabilizing group membership service, multicast service, and resource allocation service in directed network are presented. The first group communication algorithm is based on a token circulation over a virtual ring. The second algorithm is based ...
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem in uniform distributed systems. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protocol runs in synchronous systems, it ...
Comments