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

Authors:
T. Weller;B. Hajek
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 1
Cited 2

An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies

IEEE Transactions on Computers

There is no optimal routing policy for the torus

Information Processing Letters
A simple and efficient input selection function for networks-on-chip

ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.