对具有错误结点的星形网络中的点与点之间的容错并行路由问题进行了研究,提出了一种新的具有容错能力的点对点的并行路由算法。严格证明了新算法的正确性,讨论了新算法的时间复杂度,并对新算法所找到的路径的长度进行了分析。用概率分析的方法对新算法的容错性概率进行了严格地推导,计算出概率的上下界。
In the paper,the node-to-node fault-tolerance parallel routing problem of star network with faulty nodes is studied.A new node-to-node parallel routing algorithm with certain fault-tolerance ability is proposed.The new algorithm is strictly proved to be correct.The time complexity of new algorithm is discussed and the length of paths found by new algorithm is analyzed.The fault-tolerance probability of new algorithm is strictly analyzed by probabilistic analysis approach and its limitation range is calculated respectively.