Fault-tolerant Message Routing in Computer Networks.
L.A. Zakrevski, Mark G. Karpovsky · 1999
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.