A self-stabilizing link-coloring protocol resilient to Byzantine faults in tree networks

Lecture Notes in Computer Science

Volumn 3544, Issue , 2005, Pages 283-298

  Sakurai, Yusuke ^a   Ooshita, Fukuhito ^b   Masuzawa, Toshimitsu ^b  

^a SHARP CORPORATION   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; STABILIZATION;

FAULT CONTAINMENT; NONFAULTY PROCESS; SELF-STABILIZING LINK-COLORING PROTOCOL; TREE NETWORKS;

NETWORK PROTOCOLS;

EID: 26444508878     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11516798_21     Document Type: Conference Paper

References (19)

1. E. Anagnostou and V. Hadzilacos. Tolerating transient and permanent failures. Lectures Notes in Computer Science, Vol 725 (Springer-Verlag), pages 174-188, 1993.
2. A. Arora and H. Zhang. Lsrp: Local stabilization in shortest path routing. In Proceedings of the 2003 International Conference on Dependable Systems and Networks, pages 139-148, 2003.
3. J. Beauquier and S. Kekkonen-Moneta. Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabiling failure detectors. International Journal of Systems Science, 28(11):1177-1187, 1997.
4. J. Beauquier and S. Kekkonen-Moneta. On ftss-solvable distributed problems. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, page 290, 1997.
5. E. W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
6. S. Dolev. Self-Stabilization. MIT Press, 2000.
7. S. Ghosh and A. Gupta. An exercise in fault-containment: self-stabilizing leader election. Information Processing Letters, 59(5):281-288, 1996.
8. S. Ghosh, A. Gupta, T. Herman, and S. V. Pemmaraju. Fault-containing self-stabilizing algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 45-54, 1996.
9. S. Ghosh and S. V. Pemmaraju. Tradeoffs in fault-containing self-stabilization. In Proceedings of the 3rd Workshop on Self-Stabilizing Systems, pages 157-169, 1997.
10. A. S. Gopal and K. J. Perry. Unifying self-stabilization and fault-tolerance. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 195-206, 1993.
11. D. A. Grable and A. Panconesi. Nearly optimal distributed edge colouring in o(log log n) rounds. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 278-285, 1997.
12. Y. Katayama and T. Masuzawa. A fault-containing self-stabilizing protocol for constructing a minimum spanning tree. IEICE Transactions, J84-D-I(9):1307-1317, 2001.
13. S. Kutten and B. Patt-Shamir. Stabilizing time-adaptive protocols. Theoretical Computer Science, 220(1):93-111, 1999.
14. M. V. Marathe, A. Panconesi, and L. D. Risinger. An experimental study of a simple, distributed edge coloring algorithm. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 166-175, 2000.
15. T. Masuzawa. A fault-tolerant and self-stabilizing protocol for the topology problem. In Proceedings of the 2nd Workshop on Self-Stabilizing Systems, pages 1.1-1.15, 1995.
16. H. Matsui, M. Inoue, T. Masuzawa, and H. Fujiwara. Fault-tolerant and self-stabilizing protocols using an unreliable failure detector. IEICE Transactions on Information and Systems, E83-D(10):1831-1840, 2000.
17. M. Nesterenko and A. Arora. Tolerance to unbounded byzantine faults. In Proceedings of 21st IEEE Symposium on Reliable Distributed Systems, pages 22-29, 2002.
18. A. Panconesi and A. Srinivasan. Fast randomized algorithms for distributed edge coloring. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 251-262, 1992.
19. S. Ukena, Y. Katayama, T. Masuzawa, and H. Fujiwara. A self-stabilizing spanning tree protocol that tolerates non-quiescent permanent faults. IEICE Transaction, J85-D-I(11):1007-1014, 2002.