Fault-tolerant Message Routing in Computer Networks

We are considering a problem of faulttolerant wormhole unicast routing in computer networks, consisting of nodes (processor units), connected by bi-directional links. Each node can be viewed as the combination of a router and a processor with some RAM, bus and I/O circuitry. We concentrate on networks with arbitrary (irregular) topologies. The problem of routing in the presence of faults is divided into two sub-problems: diagnosis and reconfiguration of the network and deadlock-free routing in the new network. In this paper we consider non-adaptive routing, not taking the sizes of corresponding message queues into account.

[1]  Che-Liang Yang,et al.  An Efficient Algorithm for Multiprocessor Fault Diagnosis Using the Comparison Approach , 1987, Inf. Comput..

[2]  Suresh Chalasani,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995, IEEE Trans. Computers.

[3]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[4]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[5]  Dhiraj K. Pradhan,et al.  Dynamic Testing Strategy for Distributed Systems , 1989, IEEE Trans. Computers.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Jehoshua Bruck,et al.  Fault-tolerant switched local area networks , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[8]  Pierre Fraigniaud,et al.  A General Theory for Deadlock Avoidance in Wormhole-Routed Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  John P. Hayes,et al.  A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.

[10]  Mark G. Karpovsky,et al.  Fault-Tolerant Message Routing for Multiprocessors , 1998, IPPS/SPDP Workshops.

[11]  C. R. Kime,et al.  System diagnosis , 1986 .

[12]  Mark G. Karpovsky,et al.  On the Covering of Vertices for Fault Diagnosis in Hypercubes , 1999, Inf. Process. Lett..

[13]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[14]  Lionel M. Ni,et al.  Fault-tolerant wormhole routing in meshes , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[15]  Aileen Mary Mcloughlin,et al.  On the covering radius. , 1977 .

[16]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[17]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[18]  oni,et al.  Tree-Based Multicasting in Wormhole-Routed Irregular Topologies , 1998 .