Visualization of a simple routing scheme for meshes

The authors propose a simple quasi-static routing scheme for buffered mesh connected network computers. Under the assumption of uniform traffic demands, it is demonstrated numerically that their simple routing scheme achieves near-optimal performance; in the sense of minimizing the total number of outstanding packets in a Jackson-type network. Simulation results are also presented for the case of non-uniform traffic demands. These simulations illustrate that our quasi-static control scheme can dynamically adjust the values of routing probabilities so as to provide acceptable and stable network performance. The results of these simulations are displayed using advanced video graphics