DIFFUSION APPROXIMATION FOR STATIONARY ANALYSIS OF QUEUES AND THEIR NETWORKS: A REVIEW

Abstract

Diffusion processes have been widely used for approximations in the queueing theory. There are different types of diffusion approximations. Among them, we are interested in those obtained through limits of a sequence of models which describe queueing networks. Such a limit is typically obtained by the weak convergence of either stochastic processes or stationary distributions. We already have nice reviews and text books for them. However, this area is still actively studied, and it seems getting hard to have a comprehensive overview because mathematical results are highly technical. We try toll this gap presenting technical background. Although those diffusion approximations have been well developed, there remains a big problem, which is difficulty to get useful information from the limiting diffusion processes. Their state spaces are multidimensional whose dimension corresponds to the number of nodes for a single-class case and the number of customer types for a multi-class case. We now have a better view for the two dimensional case, but still know very little about the higher dimensional case. This intractability is somehow against a spirit of diffusion approximation. This motivates us to reconsider diffusion approximation from scratch. For this, we highlight the stationary distributions, and make clear a mechanism to produce diffusion approximations.