Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies"
Issue No.07 - July (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.293267
<p>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.</p>
network routing; multiprocessor interconnection networks; dynamic programming; optimal shortest-path routing policy; network computers; regular mesh-connected topologies; zig-zag routing policy; infinite grid networks; torus networks.
T. Weller, B. Hajek, "Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies"", IEEE Transactions on Computers, vol.43, no. 7, pp. 862-863, July 1994, doi:10.1109/12.293267