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

IEEE Transactions on Computers

Volumn 43, Issue 7, 1994, Pages 862-863

  Weller, Timothy ^a   Hajek, Bruce ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

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

Indexed keywords

COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PACKET SWITCHING; THEOREM PROVING; TOPOLOGY;

GRID NETWORKS; MESH CONNECTED TOPOLOGIES; OPTIMAL SHORTEST PATH ROUTING POLICY; ZIG ZAG ROUTING POLICY;

CRITICAL PATH ANALYSIS;

EID: 0028468025     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.293267     Document Type: Note

References (3)

1. S. Badr and P. Podar, “An optimal shortest-path routing policy for network computers with regular mesh-connected topologies,” IEEE Trans. Compute., vol. 38, no. 10, pp 1362-1371, Oct. 1989.
2. D. Bertsekas, Dynamic Programming. Englewood Cliffs, NJ: Prentice-Hall, 1987.
3. T. Weller and B. Hajek, “Optimal routing policies for 2-dimensional grid networks,” presented at the 26th Annu. Princeton Conf. Inform. Sci. Syst., Mar. 1992.