Self-Stabilizing Byzantine Asynchronous Unison

We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm has minimum possible containment radius and optimal stabilization time.

[1]  Boaz Patt-Shamir,et al.  A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock , 2007, IEEE Transactions on Dependable and Secure Computing.

[2]  Toshimitsu Masuzawa,et al.  Strong Stabilization: Bounding Times Affected by Byzantine Processes in Stabilization , 2008 .

[3]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[4]  Franck Petit,et al.  When graph theory helps self-stabilization , 2004, PODC '04.

[5]  Ajoy K. Datta,et al.  Stabilization, Safety, and Security of Distributed Systems: 8th International Symposium, SSS 2006Dallas, TX, USA, November 17-19, 2006Proceedings (Lecture Notes in Computer Science) , 2006 .

[6]  Danny Dolev,et al.  Self-stabilization of Byzantine Protocols , 2005, Self-Stabilizing Systems.

[7]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[8]  Fukuhito Ooshita,et al.  A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks , 2004, OPODIS.

[9]  Mohamed G. Gouda,et al.  Stabilizing Unison , 1990, Inf. Process. Lett..

[10]  Maria Gradinariu Potop-Butucaru,et al.  Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison , 2009, DISC.

[11]  Danny Dolev,et al.  On Self-stabilizing Synchronous Actions Despite Byzantine Attacks , 2007, DISC.

[12]  W DijkstraEdsger.  Self-stabilizing systems in spite of distributed control , 1974 .

[13]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[14]  Danny Dolev,et al.  Fast self-stabilizing byzantine tolerant digital clock synchronization , 2008, PODC '08.

[15]  Mohamed G. Gouda,et al.  Asynchronous Unison (Extended Abstract). , 1992, ICDCS 1992.

[16]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[17]  T. Masuzawa,et al.  Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults , 2007 .

[18]  Sébastien Tixeuil,et al.  Self-Stabilizing Systems: 7th International Symposium, SSS 2005, Barcelona, Spain, October 26-27, 2005 (Lecture Notes in Computer Science) , 2005 .

[19]  Danny Dolev,et al.  Self-stabilizing Byzantine Digital Clock Synchronization , 2006, SSS.

[20]  Sébastien Tixeuil,et al.  Bounding the Impact of Unbounded Attacks in Stabilization , 2006, IEEE Transactions on Parallel and Distributed Systems.

[21]  Jennifer L. Welch,et al.  Self-Stabilizing Clock Synchronization in the Presence of ByzantineFaults ( Preliminary Version ) Shlomi Dolevy , 1995 .

[22]  Franck Petit,et al.  Synchronous vs. Asynchronous Unison , 2005, Self-Stabilizing Systems.

[23]  Anish Arora,et al.  Tolerance to unbounded Byzantine faults , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[24]  Sébastien Tixeuil,et al.  Bounding the Impact of Unbounded Attacks in Stabilization , 2006, SSS.

[25]  R. Downey,et al.  Algorithms and Theory of Computation Handbook, Second Edition , 2007 .

[26]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[27]  Jayadev Misra,et al.  Phase Synchronization , 1991, Inf. Process. Lett..

[28]  Sébastien Tixeuil,et al.  The Impact of Topology on Byzantine Containment in Stabilization , 2010, DISC.

[29]  Maria Gradinariu Potop-Butucaru,et al.  Self-stabilizing byzantine asynchronous unison , 2012, J. Parallel Distributed Comput..

[30]  Sébastien Tixeuil,et al.  On Byzantine Containment Properties of the $min+1$ Protocol , 2010, SSS.