| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 96 === Finding the most vital edge problem in a minimum spanning tree is to calculate the vital number of every nodes. If the vital value of node i is the largest one, then the tree-edge connected by this node and its parent is the most vital edge[13]. In order to find the most vital edge in a network, we can pre-estimate the loss of our cost and go to find an optimal alternative tree-edge to keep the connectedness of a minimum spanning tree. In the present research on the most vital edge, they always adopt the traditional algorithm to solve this kind of problem, and never use the self-stabilizing algorithm. So in this thesis, we propose a brand new self-stabilizing algorithm with the central daemon contained thirteen rules for this problem, and guarantee that will be converged in O(n2) eventually, where n is the number of the nodes.
|
|---|
