An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies
Issue No. 10 - October (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.35831
A probabilistic routing policy, the Z/sup 2/ (zigzag) routing policy, is presented within the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of the research is routing in networks of computers in a distributed computing environment, where constituent subcomputers are organized in a mesh-connected
shortest-path routing; network computers; mesh-connected topologies; probabilistic routing policy; distributed computing; computer networks; network topology.
H. Badr and S. Podar, "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies," in IEEE Transactions on Computers, vol. 38, no. , pp. 1362-1371, 1989.