A probabilistic routing policy, the Z2 (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
Published in:
Computers, IEEE Transactions on
(Volume:38
,
Issue:
10
)
Date of Publication:
Oct 1989
- Page(s):
-
1362
-
1371
- ISSN :
-
0018-9340
- INSPEC Accession Number:
-
3527241
- Digital Object Identifier :
-
10.1109/12.35831
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Oct 1989
- Sponsored by :
-
IEEE Computer Society