关键词: star互连网络, 自适应, 容错寻径算法, 容错性概率

Abstract: Seeking paths algorithm constitutes the primary factor influencing the communication performance of interconnection networks and the performance of massive parallel processors systems，so solutions for seeking paths problems of star network as one of the best alternatives to hypercube become very important.Under the conditional fault tolerant model，rules used for seeking paths are researched，and a fault-tolerance seeking paths algorithm based on adaptive rules is proposed.The correctness and the fault tolerance are analyzed.The simulation experiment confirms that the algorithm has very high success probability.Under the situation of edge failing independently，the communication reliability between two terminals in star networks is analyzed，and its lower bound limited is derived and confirmed.

Key words: star interconnection network, adaptivity, fault-tolerance seeking paths algorithm, fault-tolerance probability