Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults
- 539 Downloads
This brief announcement presents a fault-tolerant self-stabilizing distributed clock synchronization protocol for an arbitrary, non-partitioned digraph. Synchronization algorithms are essential for managing the use of resources and controlling communication in a distributed system. Synchronization of a distributed system is the process of achieving and maintaining a bounded skew among independent local time clocks. A distributed system is said to be self-stabilizing if, from an arbitrary state, it is guaranteed to reach a legitimate state in a finite amount of time and remain in a legitimate state. For clock synchronization, a legitimate state is a state where all parts in the system are in synchrony. The self-stabilizing distributed-system clock synchronization problem is, therefore, to develop an algorithm (i.e., a protocol) to achieve and maintain synchrony of local clocks in a distributed system after experiencing system-wide disruptions in the presence of network element imperfections. The convergence and closure properties address achieving and maintaining networksynchrony, respectively.
Unable to display preview. Download preview PDF.
- 1.Torres-Pomales, W., Malekpour, M.R., Miner, P.S.: ROBUS-2: A fault-tolerant broadcast communication system. NASA/TM-2005-213540, p. 201 (March 2005)Google Scholar
- 5.Malekpour, M.R.: A Self-Stabilizing Synchronization Protocol For Arbitrary Digraphs. In: The 17th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2011), Pasadena, California, December 12-14 (2011)Google Scholar
- 6.Malekpour, M.R.: Model Checking A Self-Stabilizing Synchronization Protocol For Arbitrary Digraphs. In: The 31st Digital Avionics Systems Conference (DASC), Williamsburg, Virginia (to appear October 14-18, 2012)Google Scholar
- 7.Malekpour, M.R.: Correctness Proof of A Self-Stabilizing Synchronization Protocol For Arbitrary Digraphs. NASA/TM-2011-217184, p. 31 (October 2011)Google Scholar