Abstract
In this paper we consider an open queueing network having multiple classes, priorities, and general service time distributions. In the case where there is a single bottleneck station we conjecture that normalized queue length and sojourn time processes converge, in the heavy traffic limit, to one-dimensional reflected Brownian motion, and present expressions for its drift and variance. The conjecture is motivated by known heavy traffic limit theorems for some special cases of the general model, and some conjectured “Heavy Traffic Principles” derived from them.
Using the known stationary distribution of one-dimensional reflected Brownian motion, we present expressions for the heavy traffic limit of stationary queue length and sojourn time distributions and moments. For systems with Markov routing we are able to explicitly calculate the limits.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abramowitz and I.A. Stegun,Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables (National Bureau of Standards, Applied Mathematics Series, 1964) chap. 9.
F. Baskett, M. Chandy, R. Muntz and J. Palacios, Open, closed, and mixed networks of queues with different classes of customers, JACM 22 (1975) 248–260.
P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).
D.Y. Burman and D.R. Smith, An asymptotic analysis of queueing systems with Markov modulated arrivals, Oper. Res. 34 (1986) 105–119.
H. Chen and A. Mandelbaum, Stochastic discrete flow networks: diffusion approximations and bottlenecks, submitted for publication.
E.G. Coffman Jr. and M.I. Reiman, Diffusion approximations for computer/communication systems, in:Mathematical Computer Performance and Reliability, G. Iazeolla, P.J. Courtois and A. Hordijk, Eds. (Elsevier, North-Holland, 1984) 33–53.
P.J. Fleming and B. Simon, Interpolation approximations for response time distributions, Oper. Res., to appear.
J.M. Harrison, A limit theorem for priority queues in heavy traffic, J. Appl. Prob. 10 (1973) 907–912.
J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations. in:Stochastic Differential Systems, Stochastic Control Theory and Applications, W. Fleming and P.L. Lions, Eds. (Springer, Berlin, 1988) pp. 147–186.
J.M. Harrison and V. Nguyen, The QNET method for two-moment analysis of open queueing networks, Queueing Systems 6 (1990) 1–32.
D.L. Iglehart, Weak convergence of compound stochastic processes, Stoch. Proc. Appl. 1 (1973) 11–31.
D.L. Iglehart and W. Whitt, Multiple channel queues in heavy traffic, I and II, Adv. Appl. Prob. 2 (1970) 150–177 and 355–364.
D.P. Johnson, Diffusion approximations for optimal filtering of jump processes and for queueing networks, Ph.D. Thesis, University of Wisconsin (1983).
W.P. Peterson, A heavy traffic limit theorem for networks of queues with multiple customer types, Math. Oper. Res., to appear.
M.I. Reiman, Some diffusion approximations with state space collapse, in:Modelling and Performance Evaluation Methodology, F. Baccelli and G. Fayolle, Eds. (Springer, Berlin, 1984) pp. 209–240.
M.I. Reiman, Open queueing networks in heavy traffic, Math. Oper. Res. 9 (1984) 441–458.
M.I. Reiman, A multi-class feedback queue in heavy traffic, Adv. Appl. Prob. 20 (1988) 179–207.
M.I. Reiman and B. Simon, Light traffic limits of sojourn time distributions in Markovian queueing networks, Commun. Statist.-Stoch. Models 4 (1988) 191–233.
M.I. Reiman and B. Simon, An interpolation approximation for queueing systems with Poisson input, Oper. Res. 36 (1988) 454–469.
M.I. Reiman and B. Simon, Open queueing systems in light traffic, Math. Oper. Res. 14 (1989) 26–59.
M.I. Reiman, B. Simon and J.S. Willie, Simterpolation: a simulation based interpolation approximation for queueing systems, submitted for publication.
M.I. Reiman and A. Weiss, Light traffic derivatives via likelihood ratios, IEEE Trans. Info. Th. IT-35 (1989) 648–654.
B. Simon, Networks of priority queues with nested Markov routing, Draft.
B. Simon and J.S. Willie, Estimation of response time characteristics in priority queueing networks via an interpolation methodology based on simulation and heavy traffic limits, in:Computer Science and Statistics: Proc. 18th Symp. on the Interface, T.J. Boardman, Ed. (American Statistical Association, Wash. DC, 1986) pp. 251–256.
W. Whitt, Weak convergence theorems for priority queues: preemptive resume discipline, J. Appl. Prob. 8 (1971) 74–94.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reiman, M.I., Simon, B. A network of priority queues in heavy traffic: One bottleneck station. Queueing Syst 6, 33–57 (1990). https://doi.org/10.1007/BF02411464
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02411464