This Article 
 Bibliographic References 
 Add to: 
Routing in Wormhole-Switched Clustered Networks with Applications to Fault Tolerance
October 1999 (vol. 10 no. 10)
pp. 1001-1011

Abstract—This paper presents a novel technique for routing in wormhole-switched multiprocessor interconnection networks with clustered configuration. The network model used here consists of a set of clusters interfaced through a common central network. We assume that the central network and the clusters use independent algorithms to route messages between their internal nodes. A technique for deriving a global routing algorithm based on the local algorithms is presented, which allows the transfer of messages between any pair of nodes in the network. This proposed method is shown to be deadlock-free with two virtual channels. The clustered network model and the proposed routing technique can be used to enhance the fault tolerance capability of existing routing algorithms. In particular, we describe fault-tolerant routing methods for meshes, which can tolerate any arbitrary fault distribution without disabling connected healthy nodes.

[1] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[2] R. Boppana and S. Chalasani, "Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks," IEEE Trans. Computers, vol. 44, no. 7, pp. 848-864, July 1995.
[3] P.-H. Sui and S.-D. Wang, “An Improved Algorithm for Fault-Tolerant Wormhole Routing in Meshes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 1040–1042, Sept. 1997.
[4] C. Su and K. G. Shin, “Adaptive Fault Tolerant Deadlock-Free Routing in Meshes and Hypercubes,” IEEE Trans. Computers, vol. 45, no. 6, pp. 666–683, June 1996.
[5] W. Ho and Y. Cheung, “Fault Tolerant Wormhole Routing in Mesh Networks with Non-Rectangular Fault Regions,” Proc. Int'l Conf. Parallel and Distributed Computing Systems, pp. 551–557, 1997.
[6] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[7] S. Chalasani and R. Boppana, “Communication in Multicomputers with Nonconvex Faults,” IEEE Trans. Computers, vol. 46, no. 5, pp. 616–622, May 1997.
[8] S.-D. Wang and M.-J. Tsai, “Adaptive and Fault-Tolerant Routing with 100% Node Utilization for Mesh Multicomputer,” Proc. Int'l Conf. Parallel and Distributed Systems, 1998.
[9] M. Schroeder et. al., "Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links," DEC Technical Report SRC 59, 1990.
[10] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Through Switches,” Proc. 1996 Int'l Conf. Parallel Processing, Aug. 1996.
[11] Y.C. Tseng, D.K. Panda, and T.H. Lai, "A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels," IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 2, Feb. 1996, pp.138-150.
[12] R. Hadas, K. Watkins, and T. Hehre, “Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels,” Proc. 1996 Int'l Symp. High-Performance Computer Architecture, pp. 180–190, 1996.
[13] R. Perlman, “An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN,” Proc. Ninth Data Comm. Symp., pp. 44–53, 1985.

Index Terms:
Wormhole-switching, routing algorithms, clustered networks, scalable systems, fault tolerance, meshes.
Vivek Halwan, Füsun Özgüner, Atakan Dogan, "Routing in Wormhole-Switched Clustered Networks with Applications to Fault Tolerance," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 10, pp. 1001-1011, Oct. 1999, doi:10.1109/71.808138
Usage of this product signifies your acceptance of the Terms of Use.