| Course Code: CS517 Course Name: Self-Stabilizing Algorithm Prerequisites: NIL Syllabus: Introduction to Self-stabilization, Different Models, Performance of stabilizing algorithms, Design of Basic Self-stabilizing Distributed Algorithms (Self-stabilizing BFS tree, Self-stabilizing DFS tree etc), Role of daemon (central, distributed), Distributed reset, Local Stabilization, Fault-Containment, Self-stabilization using random walk, Snap-stabilization and Superstabilization, Adaptive stabilization, Self-stabilizing algorithms for dynamic networks Texts: 1. S. Dolev, Self-Stabilization, MIT Press, 2000. 2.A. D. Kshemkalyani and M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, 2010. 3.S. Ghosh, Distributed Systems: An Algorithmic Approach, Chapman & Hall/CRC, 2010. |