Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”

Timothy Weller; Bruce Hajek

doi:10.1109/12.293267

Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”

Timothy Weller
, Bruce Hajek

Research output: Contribution to journal › Comment/debate › peer-review

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.

Original language	English (US)
Pages (from-to)	862-863
Number of pages	2
Journal	IEEE Transactions on Computers
Volume	43
Issue number	7
DOIs	https://doi.org/10.1109/12.293267
State	Published - Jul 1994

Keywords

Dynamic programming
dynamic routing
grid networks
mesh-connected topologies
shortest-path routing

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Online availability

10.1109/12.293267

Library availability

Discover UIUC Full Text

Cite this

@article{367710e3c5f847f6a4b5949f30264aff,

title = "Comments on {\textquotedblleft}An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies{\textquotedblright}",

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 = "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",

}

TY - JOUR

T1 - Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”

AU - Weller, Timothy

AU - Hajek, Bruce

N1 - 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.

PY - 1994/7

Y1 - 1994/7

N2 - 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.

AB - 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.

KW - Dynamic programming

KW - dynamic routing

KW - grid networks

KW - mesh-connected topologies

KW - shortest-path routing

UR - https://www.scopus.com/pages/publications/0028468025

UR - https://www.scopus.com/pages/publications/0028468025#tab=citedBy

U2 - 10.1109/12.293267

DO - 10.1109/12.293267

M3 - Comment/debate

AN - SCOPUS:0028468025

SN - 0018-9340

VL - 43

SP - 862

EP - 863

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 7

ER -

Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this