Abstract
A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures, the algorithm can send a packet along the shortest path to the destination; when there are failures, the packet can bypass failed nodes and links.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li Layuan, Computer Local Networks, Hubei Press Agency of Sci. and Tech., 1986.
Wen-Ning Hsiehet al., Routing strategies in computer networks,Computer,17:6(1984), 46–56.
Li Layuan, The routing approach for distributed local networks,Journal of Wuhan Univ. of Water Trans. Eng., 1(1985).
C.S. Raghavendraet al., Optimal loop topologies for distributed systems, in Proc. 7th Data Commun. Symp., Oct. 1981, 218–222.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, L. A routing algorithm for distributed optimal double loop computer networks. J. of Comput. Sci. & Technol. 2, 92–98 (1987). https://doi.org/10.1007/BF02973487
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02973487