Weak vs. Self vs. Probabilistic Stabilization Stéphane Devismes (CNRS, LRI, France) Sébastien Tixeuil (LIP6-CNRS & INRIA, France) Masafumi Yamashita (Kyushu.

Slides:



Advertisements
Similar presentations
Impossibility of Distributed Consensus with One Faulty Process
Advertisements

Chapter 6 - Convergence in the Presence of Faults1-1 Chapter 6 Self-Stabilization Self-Stabilization Shlomi Dolev MIT Press, 2000 Shlomi Dolev, All Rights.
Teaser - Introduction to Distributed Computing
Snap-stabilizing Committee Coordination Borzoo Bonakdarpour Stephane Devismes Franck Petit IEEE International Parallel and Distributed Processing Symposium.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Self-Stabilization in Distributed Systems Barath Raghavan Vikas Motwani Debashis Panigrahi.
Snap-Stabilizing Detection of Cutsets Alain Cournier, Stéphane Devismes, and Vincent Villain HIPC’2005, December , Goa (India)
Fast Leader (Full) Recovery despite Dynamic Faults Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Sébastien Tixeuil.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Self Stabilization 1.
Stéphane Devismes VERIMAG UMR 5104 Univ. Joseph Fourier Grenoble, France Optimal Exploration of Small Rings Talk by Franck Petit, Univ. Pierre et Marie.
Introduction to Self-Stabilization Stéphane Devismes.
From Self- to Snap- Stabilization Alain Cournier, Stéphane Devismes, and Vincent Villain SSS’2006, November 17-19, Dallas (USA)
Self-Stabilization: An approach for Fault-Tolerance in Distributed Systems Stéphane Devismes 16/12/2013MAROC'2013.
Asynchronous Consensus (Some Slides borrowed from ppt on Web.(by Ken Birman) )
CPSC 668Set 3: Leader Election in Rings1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
CPSC 668Self Stabilization1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
CS294, YelickSelf Stabilizing, p1 CS Self-Stabilizing Systems
Outline Max Flow Algorithm Model of Computation Proposed Algorithm Self Stabilization Contribution 1 A self-stabilizing algorithm for the maximum flow.
Self-Stabilization An Introduction Aly Farahat Ph.D. Student Automatic Software Design Lab Computer Science Department Michigan Technological University.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Selected topics in distributed computing Shmuel Zaks
Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Distributed Algorithms – 2g1513 Lecture 9 – by Ali Ghodsi Fault-Tolerance in Distributed Systems.
Fault-containment in Weakly Stabilizing Systems Anurag Dasgupta Sukumar Ghosh Xin Xiao University of Iowa.
Snap-Stabilizing PIF and Useless Computations Alain Cournier, Stéphane Devismes, and Vincent Villain ICPADS’2006, July , Minneapolis (USA)
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 10 Instructor: Haifeng YU.
Franck Petit INRIA, LIP Lab. Univ. / ENS of Lyon France Optimal Probabilistic Ring Exploration by Semi-Synchronous Oblivious Robots Joint work with Stéphane.
1 Self-stabilizing Algorithms and Frequency Assignment Problems.
Review for Exam 2. Topics included Deadlock detection Resource and communication deadlock Graph algorithms: Routing, spanning tree, MST, leader election.
Fault-containment in Weakly Stabilizing Systems Anurag Dasgupta Sukumar Ghosh Xin Xiao University of Iowa.
By J. Burns and J. Pachl Based on a presentation by Irina Shapira and Julia Mosin Uniform Self-Stabilization 1 P0P0 P1P1 P2P2 P3P3 P4P4 P5P5.
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
A Self-Stabilizing O(n)-Round k-Clustering Algorithm Stéphane Devismes, VERIMAG.
Self Stabilizing Smoothing and Counting Maurice Herlihy, Brown University Srikanta Tirthapura, Iowa State University.
Autonomic distributed systems. 2 Think about this Human population x10 9 computer population.
Self-Stabilizing K-out-of-L Exclusion on Tree Networks Stéphane Devismes, VERIMAG Joint work with: – Ajoy K. Datta (Univ. Of Nevada) – Florian Horn (LIAFA)
Self-Stabilizing K-out-of-L Exclusion on Tree Networks Stéphane Devismes, VERIMAG Joint work with: – Ajoy K. Datta (Univ. Of Nevada) – Florian Horn (LIAFA)
Approximation of δ-Timeliness Carole Delporte-Gallet, LIAFA UMR 7089, Paris VII Stéphane Devismes, VERIMAG UMR 5104, Grenoble I Hugues Fauconnier, LIAFA.
Stabilization Presented by Xiaozhou David Zhu. Contents What-is Motivation 3 Definitions An Example Refinements Reference.
Self-stabilization. What is Self-stabilization? Technique for spontaneous healing after transient failure or perturbation. Non-masking tolerance (Forward.
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
Agreement in Distributed Systems n definition of agreement problems n impossibility of consensus with a single crash n solvable problems u consensus with.
CS 542: Topics in Distributed Systems Self-Stabilization.
Sorting on Skip Chains Ajoy K. Datta, Lawrence L. Larmore, and Stéphane Devismes.
1 Fault tolerance in distributed systems n Motivation n robust and stabilizing algorithms n failure models n robust algorithms u decision problems u impossibility.
Self-stabilization. Technique for spontaneous healing after transient failure or perturbation. Non-masking tolerance (Forward error recovery). Guarantees.
Self-Stabilizing Algorithm with Safe Convergence building an (f,g)-Alliance Fabienne Carrier Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Yvan Rivierre.
Hwajung Lee.  Technique for spontaneous healing.  Forward error recovery.  Guarantees eventual safety following failures. Feasibility demonstrated.
“Towards Self Stabilizing Wait Free Shared Memory Objects” By:  Hopeman  Tsigas  Paptriantafilou Presented By: Sumit Sukhramani Kent State University.
Fault tolerance and related issues in distributed computing Shmuel Zaks GSSI - Feb
Snap-Stabilization in Message-Passing Systems Sylvie Delaët (LRI) Stéphane Devismes (CNRS, LRI) Mikhail Nesterenko (Kent State University) Sébastien Tixeuil.
ITEC452 Distributed Computing Lecture 15 Self-stabilization Hwajung Lee.
Self-stabilizing (f,g)-Alliances with Safe Convergence Fabienne Carrier Ajoy K. Datta Stéphane Devismes Lawrence L. Larmore Yvan Rivierre.
Snap-Stabilizing Depth-First Search on Arbitrary Networks Alain Cournier, Stéphane Devismes, Franck Petit, and Vincent Villain OPODIS 2004, December
Around Self-Stabilization Part 2: Strengthened Forms of Self-Stabilization Stéphane Devismes Post-Doc CNRS at the LRI (Paris VII)
CSE-591: Term Project Self-stabilizing Network Algorithms by Tridib Mukherjee ASU ID :
Computer Science 425/ECE 428/CSE 424 Distributed Systems (Fall 2009) Lecture 20 Self-Stabilization Reading: Chapter from Prof. Gosh’s book Klara Nahrstedt.
Competitive Self-Stabilizing k-Clustering
第1部: 自己安定の緩和 すてふぁん どぅゔぃむ ポスドク パリ第11大学 LRI CNRS あどばいざ: せばすちゃ てぃくそい
Evaluating and Optimizing Stabilizing Dining Philosophers
New Variants of Self-Stabilization
Analysis of Link Reversal Routing Algorithms
CS60002: Distributed Systems
A Snap-Stabilizing DFS with a Lower Space Requirement
Robust Stabilizing Leader Election
Algorithms for Extracting Timeliness Graphs
Introduction to Self-Stabilization
Snap-Stabilization in Message-Passing Systems
Presentation transcript:

Weak vs. Self vs. Probabilistic Stabilization Stéphane Devismes (CNRS, LRI, France) Sébastien Tixeuil (LIP6-CNRS & INRIA, France) Masafumi Yamashita (Kyushu University, Japan)

19/06/2008ICDCS'08, Beijing, China1 Introduction (Deterministic) Self-Stabilization:  « A protocol P is self-stabilizing if, starting from any initial configuration, every execution of P eventually reaches a point from which its behaviour is correct » Advantages: 1.Tolerance to any transient fault 2.No hypothesis on the nature or extent of faults 3.Recovers from the effects of those faults in a unified manner

19/06/2008ICDCS'08, Beijing, China2 Definition: Closure + Convergence States of the system Illegitimate states Legitimate States Convergence Closure

19/06/2008ICDCS'08, Beijing, China3 Execution of a Self-Stabilizing Algorithm SPS …

19/06/2008ICDCS'08, Beijing, China4 Drawbacks of Self-Stabilization 1. May make use of a large amount of resources 2. May be difficult to design and to prove 3. Could be unable to solve some fundamental problems

19/06/2008ICDCS'08, Beijing, China5 Weaker Properties Probabilistic Stabilization [Israeli and Jalfon, PODC’90]: probabilistic convergence Pseudo stabilization [Burns et al, WSS’89]: always a correct suffix K-stabilization [Beauquier et al, PODC’98]: at most K faults in the initial configuration Weak-Stabilization [Gouda, WSS’01]: from any configuration, there is at least one possible execution which converges

19/06/2008ICDCS'08, Beijing, China6 Weak-Stabilization SPS …

19/06/2008ICDCS'08, Beijing, China7 Probabilistic Stabilization SPS … The expected time before reaching a green segment is finite

19/06/2008ICDCS'08, Beijing, China8 Problem centric point of view Probabilistic Stabilization Pseudo-Stabilization K-Stabilization Open question: Weak-Stabilization > Self-stabilization E.g. graph coloring, token passing, alternating bit, …

19/06/2008ICDCS'08, Beijing, China9 Our Results 1. From a problem centric point of view, Weak-Stabilization > Self-Stabilization 2. Weak-Stabilization & Probabilistic Stabilization are strongly connected

19/06/2008ICDCS'08, Beijing, China10 Weak > Self (Problem centric point of view) Two examples:  Token Circulation in unidirectional rings under a distributed scheduler  Leader Election in anonymous tree under a distributed scheduler (2 algorithms)

19/06/2008ICDCS'08, Beijing, China11 Impossibility for Leader Election (under a distributed scheduler) Synchronous Execution

19/06/2008ICDCS'08, Beijing, China12 Weak-Stabilizing Leader Election Using a parent pointer Par  Neig  {  }, 3 cases: (1) (2) (3)

19/06/2008ICDCS'08, Beijing, China13 Why Weak is easier than Self ? Scheduler in Self-Stabilization: adversary Scheduler in Weak-Stabilization: friend Synchronous scheduler: Weak = Self

19/06/2008ICDCS'08, Beijing, China14 Observation: Weak vs. Probabilistic If a protocol P has a finite number of configurations, then P is weak-stabilizing iff P is probabilistically stabilizing under a randomized scheduler Outline Execution: random walk in a finite set (of configurations)

19/06/2008ICDCS'08, Beijing, China15 Problem: Synchronous Case Weak-Stalibiling under a distributed scheduler Probabilistically Stabilizing In any case Not Probabilistically Stabilizing in the general case Random Schedule (Asynchronous) Synchronous Solution: When activated, tosse a coin before moving

19/06/2008ICDCS'08, Beijing, China16 Conclusion From the problem centric point of view, Weak-Stabilization > Self-Stabilization Weak-Stabilization = Probabilistic Stabilization if the scheduler is probabilistic and the set of configurations is finite  Interesting in practical settings: Weak-Stabilization is easier to design than probabilistic stabilization In real systems, the scheduler behaves randomly Can be easily transformed to support the synchronous scheduler Perspective: evaluating a expected convergence time

Thank you