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

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 topology and communication among individual computers takes places by some form of message exchange. The authors prove the optimality of this policy with respect to two criteria: (1) maximizing the probability of reaching the destination from a given source without delays at intermediate nodes; and (2) minimizing the expected lifetime of a message. >

[1]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  B W Arden,et al.  Analysis of Chordal Ring Network , 1981, IEEE Transactions on Computers.

[3]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

[4]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[5]  MAURICIO ARANGO,et al.  Staged Circuit Switching , 1985, IEEE Transactions on Computers.

[6]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[7]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[8]  Dhiraj K. Pradhan,et al.  Dynamically Restructurable Fault-Tolerant Processor Network Architectures , 1985, IEEE Transactions on Computers.

[9]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[10]  H. T. Mouftah,et al.  Towards Performance Improvement of Cut-Through Switching in Computer Networks , 1986, Perform. Evaluation.

[11]  Dhiraj K. Pradhan,et al.  A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.

[12]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  David Gelernter,et al.  Staged circuit switching for network computers , 1983, SIGCOMM 1983.

[14]  Herb Schwetman,et al.  Cost-Performance Bounds for Multimicrocomputer Networks , 1983, IEEE Transactions on Computers.

[15]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[16]  Hector Garcia-Molina,et al.  Using semantic knowledge for transaction processing in a distributed database , 1983, TODS.

[17]  Keki B. Irani,et al.  Minimization of Interprocessor Communication for Parallel Computation , 1982, IEEE Transactions on Computers.

[18]  David Gelernter,et al.  An Adaptive Communications Protocol for Network Computers , 1986, Perform. Evaluation.

[19]  Karl W. Doty,et al.  New Designs for Dense Processor Interconnection Networks , 1984, IEEE Transactions on Computers.