IEEE Transactions on Computers
Diameters of weighted double loop networks
Journal of Algorithms
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
Fault tolerant token ring embedding in double loop networks
Information Processing Letters
A dynamic fault-tolerant message routing algorithm for double-loop networks
Information Processing Letters
An Optimal Fault-Tolerant Routing Algorithm for Weighted Bidirectional Double-Loop Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal routing in double loop networks
Theoretical Computer Science
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 14.98 |
A weighted double-loop network can be modeled by a directed graph $G(n;h_1,h_2;w_1,w_2)$ with vertex set $Z_n=\{0,1,\ldots,n-1\}$ and edge set $E=E_1\cup E_2$, where $E_1=\{(u,u+h_1)\;|\; u\in Z_n\}$, $E_2=\{(u,u+h_2)\;|\; u\in Z_n\}$. Assume that the weight of each edge in $E_1$ is $w_1$ and the weight of each edge in $E_2$ is $w_2$. In this paper, we present an optimal routing algorithm on double-loop networks under the case where there is at most one faulty element. Our algorithm is based on the fact that the shortest path from a vertex to any other vertex in a double-loop network is in the L-shape region.