Communications of the ACM - Special section on computer architecture
The connection machine
Towards performance improvement of cut-through switching in computer networks
Performance Evaluation
An adaptive communications protocol for network computers
Performance Evaluation
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Computer Networks
Art and Theory of Dynamic Programming
Art and Theory of Dynamic Programming
Staged circuit switching for network computers
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
The interaction between virtual channel flow control and adaptive routing in wormhole networks
ICS '94 Proceedings of the 8th international conference on Supercomputing
PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks
IEEE Transactions on Parallel and Distributed Systems
Unslotted deflection routing: a practical and efficient protocol for multihop optical networks
IEEE/ACM Transactions on Networking (TON)
Performance tuning of adaptive wormhole routing through selection function choice
Journal of Parallel and Distributed Computing
There is no optimal routing policy for the torus
Information Processing Letters
IEEE Transactions on Computers
Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults
IEEE Transactions on Computers
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
Proceedings of the 3rd international symposium on Information processing in sensor networks
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On the influence of the selection function on the performance of fat-trees
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 14.99 |
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.