Title :
Comments on "An optimal shortest-path routing policy for network computers with regular mesh-connected topologies"
Author :
Weller, Tom ; Hajek, Bruce
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fDate :
7/1/1994 12:00:00 AM
Abstract :
S. Badr and P. Podar (1989) introduced a zig-zag routing policy and showed its optimality for shortest-path routing on square or infinite grid networks with independent link failures. This paper shows that, contrary to the claim of Badr and Podar, a zig-zag policy is not optimal for shortest-path routing on torus networks.<>
Keywords :
dynamic programming; multiprocessor interconnection networks; network routing; infinite grid networks; network computers; optimal shortest-path routing policy; regular mesh-connected topologies; torus networks; zig-zag routing policy; Computer networks; Grid computing; Network topology; Routing; Stochastic processes; Telecommunication traffic;
Journal_Title :
Computers, IEEE Transactions on
