IEEE Transactions on Computers
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Diameters of weighted double loop networks
Journal of Algorithms
Tolerance of Double-Loop Computer Networks to Multinode Failures
IEEE Transactions on Computers
Optimal communication algorithms in distributed loop networks
Journal of Parallel and Distributed Computing
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
An optimal message routing algorithm for double-loop networks
Information Processing Letters
A dynamic fault-tolerant message routing algorithm for double-loop networks
Information Processing Letters
The Minimum Distance Diagram of Double-Loop Networks
IEEE Transactions on Computers
An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks
IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Fault-Tolerant Routing in Distributed Loop Networks
IEEE Transactions on Computers
Survival Reliability of Some Double-Loop Networks and Chordal Rings
IEEE Transactions on Computers
A Rectilinear-Monotone Polygonal Fault Block Model for Fault-Tolerant Minimal Routing in Mesh
IEEE Transactions on Computers
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
Theoretical Computer Science
Hi-index | 0.00 |
Double-loop networks are widely used in computer networks. In this paper, we present an optimal message routing algorithm and an optimal fault-tolerant message routing algorithm for weighted bidirectional double-loop networks. The algorithms presented are novel, and they do not use routing tables. After a precalculation of O(\log N) steps to determine network parameters, the algorithms can route messages using constant time at each node along the route. The algorithm presented can route messages in the presence of up to three faulty nodes or links. The fault-tolerant routing algorithm guarantees an optimal route in the presence of one node failure.