Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

DECOMPOSITION APPROXIMATION FOR OPEN QUEUEING NETWORKS

  • Lim, Jong-Seul (Division of Electronics, Information and Communication Engineering, Sunmoon University)
  • Published : 2001.09.01

⟨ Previous Next ⟩

Abstract

We present two decomposition approximations for the mean sojourn times in open single class queing networks. If there is a single bottleneck station, the approximations are asymptotically exact in both light and heavy traffic. When applied to a Jackson network or an M/G/1 queue, these approximations are exact for all values of the traffic intensity.

Keywords

References

  1. Point Processes and Queues P.Bremaud
  2. Brownian models of queueing network with heterogeneous customer populations Stochastic Differential Systems, Stochastic Control Theory and Applications J.M.Harrison;W.Fleming(ed.);P.L.Lions(ed.)
  3. I. Adv. Appl. Prob. v.2 Multiple channel queues in heavy traffic D.L.Iglehart;W.Whitt
  4. Oper. Res. v.5 Networks of waiting lines J.R.Jackson
  5. Ph. D. Thesis, University of Wisconsin Diffusion approximations for optimal filtering of jump processes and for queueing network D.P.Johnson
  6. Congressbook, Eighth Int. Teletraffic Cong. Approximate formulae for the delay in the queueing system GI/G/1 W.Kraemer;M.Langenbach-Belz
  7. IEEE Trans. Comm. v.27 Approximate analysis of general queueing networks by decomposition P.J.Kuehn
  8. Bell Syst. Tech. J. v.62 The queueing network analyzer W.Whitt