Self-stabilizing algorithm for the shortest detour problem in biconnected graph

• Main Authors: Chun-wei Tsai, 蔡俊偉
• Other Authors: Chiun-chieh Hsu
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/389k5z

碩士 === 國立臺灣科技大學 === 資訊管理系 === 95 === In this thesis, we propose a self-stabilizing algorithm for the shortest detour problem assuming the distributed demon in biconnected graph. We call a system self-stabilizing if regardless of the initial state the system will return to legitimate state after finite steps. Shortest detour length determining is very important from the viewpoint of network management. Due to a sudden link failure from some node, the message must be retransmitted from the current node, not necessarily the source node, to the destination node through a detour. We apply the concept of self-stabilizing to solve the shortest detour problem in biconnected graph and assume the presence of distributed demon in system. Our algorithm contains nine rules and is based on [8]. The work in this paper is significant because in the existing literature on self-stabilizing systems, most of the papers regarding the distributed demon are for the ring networks only; there are very few papers that discuss the self-stabilizing algorithms for other network topology assuming the distributed demon model.