Issue No. 12 - December (1995 vol. 44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.477250
<p><it>Abstract</it>—The ring network is a popular network topology for implementation in local area networks and other configurations. But it has a disadvantage of high diameter and large communication delay. So loop networks were introduced with fixed-jump links added over the ring. In this paper, we characterize some values for the number of nodes for which the lower bound on the diameter of loop networks is achieved. We also give an <it>O</it>(δ) time algorithm (where δ is the diameter of the graph) for finding a shortest path between any two nodes of a general loop network. We also propose a scheme to find a near optimal path (not more than one over the optimal) in case of a single node or link failure.</p>
Diameter, link-fault, loop networks, network topology, node-fault, routing.
B. P. Sinha and K. Mukhopadhyaya, "Fault-Tolerant Routing in Distributed Loop Networks," in IEEE Transactions on Computers, vol. 44, no. , pp. 1452-1456, 1995.