On the fault-tolerant routing in distributed loop networks

Based on their “Theorem 2”, an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both “Theorem 2” and its proof are in error. A new and more faster O(Δ)-time, Δ≤δ, algorithm will be presented in this paper. Supported by the National Natural Science Foundation of China(No.69772035)