%T Randomised routing: "Hot potato" simulations
%A  Xu Ming Qiang,  Stephen J. Turner
%E  Charlie Askew
%B OUG\-9: Occam and the Transputer \-\- Research and Applications
%X In this paper, we describe experiments which simulate
   communication in a network of processors organised as a
   hypercube. A stochastic model o\[Po] communication has been
   implemented in which each processor chooses at random
   another processor in the network with which to communicate.
   Deterministic and randomized routing algorithms are compared
   with respect to both the time taken for packets to reach
   their destinations and the space required for packet queues.
   A mixed strategy is discussed and evaluated which combines
   some of the advantages of each method. Questions of fault
   tolerance are also discussed and possible solutions
   presented.