CSE-591: Term Project Self-stabilizing Network Algorithms by Tridib Mukherjee ASU ID : 993-76-1704.

Slides:



Advertisements
Similar presentations
Self Stabilizing Algorithms for Topology Management Presentation: Deniz Çokuslu.
Advertisements

Self-stabilizing Distributed Systems Sukumar Ghosh Professor, Department of Computer Science University of Iowa.
Self-Stabilization in Distributed Systems Barath Raghavan Vikas Motwani Debashis Panigrahi.
Chapter 18 Self-Stabilization. Introduction Self-stabilization: Tolerate ‘data faults’  Example: Parent pointers in a spanning tree getting corrupted.
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Self Stabilization 1.
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.
Self Stabilizing Distributed File System Department of Computer Science, Ben-Gurion University A BGU – IBM joint project.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
CPSC 668Self Stabilization1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
LSRP: Local Stabilization in Shortest Path Routing Anish Arora Hongwei Zhang.
CS294, YelickSelf Stabilizing, p1 CS Self-Stabilizing Systems
Self-Stabilization An Introduction Aly Farahat Ph.D. Student Automatic Software Design Lab Computer Science Department Michigan Technological University.
Self Stabilization Classical Results and Beyond… Elad Schiller CTI (Grece)
Copyright 2003 CCNA 1 Chapter 6, part 2 Ethernet Switching By Your Name.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Selected topics in distributed computing Shmuel Zaks
1 A Mutual Exclusion Algorithm for Ad Hoc Mobile networks Presentation by Sanjeev Verma For COEN th Nov, 2003 J. E. Walter, J. L. Welch and N. Vaidya.
Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.
Distributed Computation in MANets Robot swarm developed by James Rice University.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Snap-Stabilizing PIF and Useless Computations Alain Cournier, Stéphane Devismes, and Vincent Villain ICPADS’2006, July , Minneapolis (USA)
Crowd Management System A presentation by Abhinav Golas Mohit Rajani Nilay Vaish Pulkit Gambhir.
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 10 Instructor: Haifeng YU.
1 Self-stabilizing Algorithms and Frequency Assignment Problems.
Efficient Overlay Multicast Protocol in Mobile Ad hoc Networks Hochoong Cho, Sang-Ho Lee Mobile Telecommunication Research Division, ETRI, KOREA Younghwan.
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.
Dissecting Self-* Properties Andrew Berns & Sukumar Ghosh University of Iowa.
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)
Stabilization Presented by Xiaozhou David Zhu. Contents What-is Motivation 3 Definitions An Example Refinements Reference.
Weak vs. Self vs. Probabilistic Stabilization Stéphane Devismes (CNRS, LRI, France) Sébastien Tixeuil (LIP6-CNRS & INRIA, France) Masafumi Yamashita (Kyushu.
Token-DCF, COMSNET(2013) -> MOBICOM(2014). Introduction ▣ To improve standard MAC protocol of IEEE for WLAN. ▣ S-MAC, A-MAC, SPEED-MAC, and etc.
Fault Management in Mobile Ad-Hoc Networks by Tridib Mukherjee.
University of Iowa1 Self-stabilization. The University of Iowa2 Man vs. machine: fact 1 An average household in the developed countries has 50+ processors.
Fusion-Oriented Sensor Networking : Network Architectures, Communication Protocols, and Routing Algorithms Dr. Wei Chen.
Self-stabilization. What is Self-stabilization? Technique for spontaneous healing after transient failure or perturbation. Non-masking tolerance (Forward.
CS 542: Topics in Distributed Systems Self-Stabilization.
Self-stabilizing energy-efficient multicast for MANETs.
1 Review Questions Define n variables, types of shared variables, message-passing, shared-memory system, system topology n program-counter/guarded command.
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.
Superstabilizing Protocols for Dynamic Distributed Systems Authors: Shlomi Dolev, Ted Herman Presented by: Vikas Motwani CSE 291: Wireless Sensor Networks.
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.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Computer Science 425/ECE 428/CSE 424 Distributed Systems (Fall 2009) Lecture 20 Self-Stabilization Reading: Chapter from Prof. Gosh’s book Klara Nahrstedt.
Energy-aware Self-stabilizing Multicasting for MANETs Tridib Mukherjee IMPACT Lab Arizona State University impact.asu.edu.
第1部: 自己安定の緩和 すてふぁん どぅゔぃむ ポスドク パリ第11大学 LRI CNRS あどばいざ: せばすちゃ てぃくそい
New Variants of Self-Stabilization
Large-scale (Campus) Lan design (Part I)
Self-stabilization.
Research: algorithmic solutions for networking
Energy-Aware Proactive Routing in MANETs
Robustness of wireless ad hoc network topologies
CS60002: Distributed Systems
A Snap-Stabilizing DFS with a Lower Space Requirement
Robustness of wireless ad hoc network topologies
Advisor: Dr. Frank Y. S. Lin Presented by Pei-Wei Li
Prim’s algorithm for minimum spanning trees
On Constructing k-Connected k-Dominating Set in Wireless Networks
Constructing a m-connected k-Dominating Set in Unit Disc Graphs
Presentation transcript:

CSE-591: Term Project Self-stabilizing Network Algorithms by Tridib Mukherjee ASU ID :

Self-stabilization Introduced by Dijkstra in 1974 Brings the system back to a valid state from any arbitrary initial state Used for tolerating intermittent and unpredictable transient faults Network Algorithms Token Rings Spanning Trees Network Resets

Top Level State Diagram Self-stabilization (Closure) Faults in the network Self- stabilization (Convergence) Invalid System State Valid System State System Start-up Self- stabilization (Convergence)

Diajkstra’s Definition Privilege Boolean predicate which is true in at least one process in the system Authorizes a process to make a move Action Legal system (global) state There must be at least one privilege in the system During an infinite time every process should be able to receive a privilege an infinite number of times

Network Algorithms Network Spanning Trees The basic network architecture for routing and token passing Broadcasting, Multicasting Operation A privileged action is executed if a fault occurs in a node Multicast trees for mobile ad-hoc networks Counter Flushing Used for network resets Can be used in token Rings or trees using PIF

Valid Spanning Tree Level 1 Level 2 Level 3 Level 4 Root Node (Source Node) Leaf Nodes (Group Members)

Invalid Spanning Tree Root Node (Source Node) Leaf Nodes (Group Members)

First Step of Stabilization Root Node (Source Node) Leaf Nodes (Group Members) Level 1

Subsequent Stabilization Step (Constitutes the valid tree in this case) Root Node (Source Node) Leaf Nodes (Group Members) Level 1 Level 2 Level 3 Level 4

Practical Issues Stabilization Time Can be reduced by proper scheduling Optimized by the use of Fault-containment Contains the effect of faults Scheduling is implicit Service Unavailable during the time of stabilization Increases end-to-end latency for the network service Effects of faults are unnecessarily propagated through the network Mobile Ad hoc networks & Sensor Networks Energy Efficiency Periodic information exchange can expensive

Questions??