@article{367710e3c5f847f6a4b5949f30264aff,
title = "Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”",
abstract = "Badr and Podar introduced a zig-zag routing policy and showed its optimality for shortest-path routing on square or infinite grid networks with independent link failures. These comments show 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, dynamic routing, grid networks, mesh-connected topologies, shortest-path routing",
author = "Timothy Weller and Bruce Hajek",
note = "Funding Information: Manuscript received November 9, 1992. This work is based on work supported by a National Science Foundation Graduate Fellowship and the National Science Foundation under contract NSF NCR 90 04355 T. Weller was with Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL 61801 USA. He is now with Donaldson, Luflcin & Jenrette, 35th Floor, 140 Broadway, New York, NY 10005 USA. B. Hajek is with Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois, Urbana IL 61801 USA. IEEE Log Number 9214712.",
year = "1994",
month = jul,
doi = "10.1109/12.293267",
language = "English (US)",
volume = "43",
pages = "862--863",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "7",
}