| Presentation | 2001/9/7 A Self-Stabilizing Spanning Tree Protocol that Tolerates Non-Quiescent Permanent Faults Satoshige UKENA, Yoshiaki KATAYAMA, Toshimitsu MASUZAWA, Hideo FUJIWARA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Researches on fault-tolerance of distributed systems are very important and are extensively carried out. Self-stabilization is one of the most effective and promising paradigms for realizing fault-tolerance of distributed systems because a self-stabilizing protocol can tolerate any number and any type of transient faults. In this paper, we newly define non-quiescent permanent faults and present a self-stabilizing protocol that constructs a spanning tree under the faults. The presented protocol stabilizes within n(n/2+F)d rounds ; n is the number of processes, d is the maximum degree of the network, and F is the upper bound that each state change of faulty process is observed by neighbor process. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | distributed protocols / self-stabilization / SS / fault-tolerance / non-quiescent permanent fault / spanning tree |
| Paper # | COMP2001-31 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2001/9/7(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Self-Stabilizing Spanning Tree Protocol that Tolerates Non-Quiescent Permanent Faults |
| Sub Title (in English) | |
| Keyword(1) | distributed protocols |
| Keyword(2) | self-stabilization |
| Keyword(3) | SS |
| Keyword(4) | fault-tolerance |
| Keyword(5) | non-quiescent permanent fault |
| Keyword(6) | spanning tree |
| 1st Author's Name | Satoshige UKENA |
| 1st Author's Affiliation | Graduate School of Information Science, Nara Institute of Science and Technology() |
| 2nd Author's Name | Yoshiaki KATAYAMA |
| 2nd Author's Affiliation | Information Technology Center, Nara Institute of Science and Technology |
| 3rd Author's Name | Toshimitsu MASUZAWA |
| 3rd Author's Affiliation | Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University |
| 4th Author's Name | Hideo FUJIWARA |
| 4th Author's Affiliation | Graduate School of Information Science, Nara Institute of Science and Technology |
| Date | 2001/9/7 |
| Paper # | COMP2001-31 |
| Volume (vol) | vol.101 |
| Number (no) | 307 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |