Constructing Fault-Tolerant Communication Trees for Hypercubes

• Main Authors: Shih-Yuan Chen, 陳世元
• Other Authors: Po-Jen Chuang
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/00908740626221315218

碩士 === 淡江大學 === 電機工程學系 === 89 === Title of Thesis: Constructing Fault-Tolerant Communication Total pages: 92 Trees for Hypercubes Key words: Hypercubes, fault-tolerance, faulty links, fault-tolerant communication trees, distributed approaches, maximal fault-free subcubes. Name of Institute: Department of Electrical Engineering, Tamkang University Graduate date: June, 2001 Degree conferred: Master Name of student: Shih-Yuan Chen Advisor: Dr. Po-Jen Chuang 陳 世 元 莊 博 任 博士 Abstract: A hypercube system can construct a non-faulty communication tree even if some faulty links exist in the system. Since the faulty links are randomly distributed, the faulty links may still exist in the communication tree when there are many faulty links. Consequently, sending data messages through neighboring nodes is necessary in such a situation. We propose a fault-tolerant scheme for improving the success rate of sending data messages through neighboring nodes. The scheme improves the fault-tolerant capability efficiently with a little added time complexity. In the previous related research, a node is first selected as the root and a fault-tolerant communication tree is then constructed in a non-distributed way. In this research, we present a distributed approach able to construct a fault-tolerant communication tree with lower time complexity. By this approach, a maximal fault-free subcube by using our proposed algorithms is found first and all nodes of the fault-free subcube are considered to be subroots. Then the fault-tolerant communication subtrees from the subroots can be constructed in a distributed way. Fault-tolerant communication trees can be successfully constructed as in the non-distributed way for all of the subroots so selected. As a result, the distributed approach not only speeds up the fault-tolerant communication tree construction but also improves the performance and keeps the original fault-tolerant capability.