AN OPTIMAL SHORTEST-PATH ROUTING POLICY FOR NETWORK COMPUTERS WITH REGULAR MESH-CONNECTED TOPOLOGIES - COMMENT

被引：4

作者：

WELLER, T

HAJEK, B

机构：

[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801

[2] UNIV ILLINOIS,DEPT ELECT & COMP ENGN,URBANA,IL 61801

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1994年 / 43卷 / 07期

关键词：

DYNAMIC PROGRAMMING; DYNAMIC ROUTING; GRID NETWORKS; MESH-CONNECTED TOPOLOGIES; SHORTEST-PATH ROUTING;

D O I：

10.1109/12.293267

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：862 / 863

页数：2