APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT

作者：Pender Jamol^*; Massey William A

来源：Probability in the Engineering and Informational Sciences, 2017, 31(1): 1-42.

DOI：10.1017/S0269964816000371

• queueing theory
• applied probability
• computational probability
• simulation probabilistic networks
• stochastic modeling

In this paper, we generalize the Gaussian Variance Approximation (GVA), developed by Massey and Pender [16], to Jackson networks with abandonment. We approximate the queue length process with a multivariate Gaussian distribution and thus, we are able to estimate the mean and covariance matrix of the entire network with more accuracy than the associated fluid and diffusion limits of Mandelbaum, Massey, and Reiman [14]. We also show how the GVA method can be used to construct staffing schedules that approximately stabilize salient performance measures such as the probability of delay and the abandonment probabilities for the entire network. Unlike the work of Feldman et al. [5] which uses Monte Carlo simulation to stabilize the delay probabilities, our method does not require simulation and only requires the numerical integration of 1/2 (N-2 + 3N) differential equations for an N-dimensional network, which is more computationally efficient. Lastly, to confirm our approximations are accurate, we perform several numerical experiments for a wide range of parameter settings.

• 出版日期2017-1