An optimal probabilistic routing policy for a large packet–switched network
David Michael. Rose, Yurii M. Suhov, Vvedenskaya · Stochastic Models · 1998
Two probabilistic routing models for a fully–connected packet–switched network with N nodes are considered. Messages with different source–destination pairs are generated as independent Poisson processes of rate ν. The message lengths, which are IID and bounded, indicate the number of data packets the messages contain. We investigate how to route packets in each of the two models in such a way that the mean end–to–end delay of the messages is minimised. Part of that investigation relies on theory related to the Poisson–independence hypothesis, in which the network is analysed as N → ∞. The theoretical results are complemented by numerical work