An efficient fault-containing self-stabilizing algorithm for the shortest path problem in a distributed system
碩士 === 元智大學 === 資訊工程學系 === 90 === In this thesis,we design a fault-containing self-stabilizing algorithmwhich finds shortest paths in a distributed system. In the single-fault situation,the worst case stabilization time of our algorithm is O(Δ),where Δ is the maximum node degre...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/95749989171239935009 |