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

Timothy Weller, Bruce Hajek

Research output: Contribution to journalComment/debate

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 languageEnglish (US)
Pages (from-to)862-863
Number of pages2
JournalIEEE Transactions on Computers
Volume43
Issue number7
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'Comments on “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies”'. Together they form a unique fingerprint.

  • Cite this