Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. W. Arden, H. Lee, Analysis of chordal ring, IEEE Trans. on Comput., C-30(1981)2, 291–292.
K. Mukhopadyaya, B. P. Sinha, Fault-tolerant routing in distributed loop networks, IEEE Trans. on Comput., C-44(1995)12, 1452–1456.
D. Z. Du, D. F. Hsu, Qiao Li, Junming Xu, A combinatorial problem related to distributed loop networks, Networks, 20(1990)3, 173–180.
C. K. Wong, D. Coppersmith, A combinatorial problem related to multimodule memory organizations, J. ACM, 21(1974)4, 392–402.
F. T. Boesch, J. F. Wang, Reliable circulant networks with minimum transmission delay, IEEE Trans. on Circuits and Syst., CAS-32(1985)12, 1286–1291.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China(No.69772035)
About this article
Cite this article
Liu, H., Yang, Y. On the fault-tolerant routing in distributed loop networks. J. of Electron.(China) 17, 84–89 (2000). https://doi.org/10.1007/s11767-000-0026-8
Issue Date:
DOI: https://doi.org/10.1007/s11767-000-0026-8