Fast and compact self stabilizing verification, computation, and fault detection of an MST

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 311-320

  Korman, Amos ^a   Kutten, Shay ^b   Masuzawa, Toshimitsu ^c  

^a CNRS   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

distributed algorithms; distributed verification; fault detection; local proof checking; locality; MST; self stabilization

Indexed keywords

DISTRIBUTED VERIFICATION; LOCAL PROOFS; LOCALITY; MST; SELF STABILIZATION;

DISTRIBUTED COMPUTER SYSTEMS; FAULT DETECTION; OPTIMIZATION;

ALGORITHMS;

EID: 79959892387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993866     Document Type: Conference Paper

References (36)

1. Y. Afek and A. Bremler-Barr. Self-Stabilizing Unidirectional Network Algorithms by Power Supply. Chicago J. Theor. Comput. Sci. 1998: (1998).
2. Y. Afek, S. Kutten, and M. Yung. The Local Detection Paradigm and Its Application to Self-Stabilization. TCS 186(1-2): 199-229 (1997).
3. S. Aggarwal and S. Kutten. Time Optimal Self Stabilizing Spanning Tree Algorithms. FSTTCS 1993.
4. A. Arora, M. G. Gouda. Distributed Reset. IEEE Trans. Computers (TC) 43(9):1026-1038 (1994).
5. B. Awerbuch. Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems. STOC 1987: 230-240. (Pubitemid 18643410)
6. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese. A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock. IEEE Trans. Dependable Sec. Comput. 4(3): 180-190 (2007).
7. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese. Time optimal self-stabilizing synchronization. STOC 1993: 652-661. (Pubitemid 23668730)
8. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization By Local Checking and Correction. FOCS 1991, pp. 268-277.
9. B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols. FOCS 1991: 258-267.
10. L. Blin, M. Potop-Butucaru, S. Rovedakis and S. Tixeuil. A New Self-stabilizing minimum spanning tree construction with loop-Free property. DISC 2009.
11. L. Blin, S. Dolev, M. Gradinariu Potop-Butucaru, and S. Rovedakis. Fast Self-Stabilizing Minimum Spanning Tree Construction. DISC 2010: 312-327.
12. A. Bui, A. K. Datta, F. Petit, V. Villain. Space optimal PIF algorithm: self-stabilized with no extra space. IPCCC 1999:20-26.
13. Z. Collin and S. Dolev. Self-stabilizing depth-first search. IPL, 49(6): 297-301 (1994).
14. C. Boulinier, F. Petit, and V. Villain. When graph theory helps self-stabilization. PODC 2004.
15. Y. K. Dalal. A Distributed Algorithm for Constructing Minimal Spanning Trees. IEEE Trans. Software Eng. 13(3): 398-405 (1987).
16. A. K. Datta, L. L. Larmore, and P. Vemula. Self Stabilizing Leader Election in Optimal Space. SSS 2008: 109-123.
17. A. K. Datta, L. L. Larmore, H. Piniganti. Self stabilizing Leader Election in Dynamic Networks. SSS 2010: 35-49.
18. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. CACM, 17(11), 643-644, 1974.
19. S. Dolev, M. Gouda, and M. Schneider. Requirements for silent stabilization. Acta Informatica, 36(6), 447-462, 1999.
20. P. Fraigniaud and C. Gavoille. Routing in trees. ICALP 2001, pp. 757-772.
21. R. G. Gallager, P. A. Humblet, and P. M. Spira. A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM TOPLAS, 5(1): 66-77, 1983.
22. J. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm. FOCS, 1993.
23. S. Ghosh, A. Gupta, T. Herman, and S. V. Pemmaraju. Fault-Containing Self-Stabilizing Algorithms. PODC 1996.
24. S.K.S Gupta, P.K. Srimani. Self-stabilizing multicast protocols for ad hoc networks. JPDC, 63(1): 87-96.
25. L. Higham, and Z. Liang. Self-stabilizing minimum spanning tree construction on message passing networks. DISC 2001: 194-208.
26. D. Peleg. Distributed computing: a locality-sensitive approach. SIAM, 2000, ISBN:0-89871-464-8.
27. G.M. Jayaram and G. Varghese. The fault span of crash failures. JACM, 47(2): 244-293 (2000).
28. S. Katz, K. J. Perry. Self-Stabilizing Extensions for Message-Passing Systems. DC, 7(1): 17-26 (1993).
29. A. Korman and S. Kutten. Distributed verification of minimum spanning trees. DC, 20(4):253-266 (2007).
30. A. Korman, S. Kutten, and T. Masuzawa. Fast and Compact Self-Stabilizing Verification, Computation, and Fault Detection of an MST, an extended version of the PODC paper. http://iew3.technion.ac.il/~kutten/KKM2011-ext.pdf.
31. A. Korman, S. Kutten, and D Peleg. Proof labeling schemes. DC, 22:215-233, 2010.
32. A. Korman and D. Peleg. Compact Separator Decomposition for Dynamic Trees and Applications. DC, (2008), 21(2): 141-161.
33. S. Kutten and D. Peleg. Fast Distributed Construction of k-Dominating Sets and Applications. PODC 1995.
34. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. DC, 18(6), 2006.
35. D. Peleg, V. Rubinovich: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum Weight Spanning Tree Construction. SICOMP 30(5).
36. R. E. Tarjan. Applications of path compression on balanced trees. JACM 26 (1979), pp. 690-715.