An efficient fault-containing self-stabilizing algorithm for finding centers on a tree network
碩士 === 元智大學 === 資訊工程學系 === 90 === In this thesis, we design a fault-containing self-stabilizing algorithm which finds centers for a distributed system. Our algorithm is based on the algorithm in [5]. In the single-fault situation, the worst case stabilization time of our algorithm is O(∆) which is m...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90317303219595554204 |
| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 90 === In this thesis, we design a fault-containing self-stabilizing algorithm which finds centers for a distributed system. Our algorithm is based on the algorithm in [5]. In the single-fault situation, the worst case stabilization time of our algorithm is O(∆) which is much better than all existing algorithms for the same problem, where ∆ is the maximum node degree. The contamination number of our algorithm is 1.
|
|---|