Abstract

The stochastic properties of a class of communication networks whose dynamics are Markovian are analysed. The asymptotic behaviour of such a network in terms of the first and second moments of a stochastic process that describes the network dynamics is characterised and tools for their calculation are provided. Specifically, computation techniques for the calculation of these statistics are provided and that these algorithms converge exponentially fast is shown. Finally, how the results may be used for the design of network routers to realise networks with desired statistical properties is suggested.