|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/12.293267, author = {T. Weller and B. Hajek}, title = {Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies"}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {7}, issn = {0018-9340}, year = {1994}, pages = {862-863}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.293267}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies" IS - 7 SN - 0018-9340 SP862 EP863 EPD - 862-863 A1 - T. Weller, A1 - B. Hajek, PY - 1994 KW - 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. VL - 43 JA - IEEE Transactions on Computers ER - | |||
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.
[1] S. Badr and P. Podar, "An optimal shortest-path routing policy for network computers with regular mesh-connected topologies,"IEEE Trans. Comput., vol. 38, no. 10, pp. 1362-1371, Oct. 1989.
[2] D. Bertsekas,Dynamic Programming. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[3] T. Weller and B. Hajek, "Optimal routing policies for 2-dimensional grid networks," presented at the26th Annu. Princeton Conf. Inform. Sci. Syst., Mar. 1992.