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

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

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

Bruce E. Hajek | Timothy Weller | B. Hajek | T. Weller

[1] R. Bellman. Dynamic programming. , 1957, Science.

[2] Hussein G. Badr,et al. An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies , 1989, IEEE Trans. Computers.