Journal of applied mathematics & informatics

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

DOI QR Code

SOME WAITING TIME ANALYSIS FOR CERTAIN QUEUEING POLICIES

  • Received : 2010.10.14
  • Accepted : 2010.11.30
  • Published : 2011.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.

Keywords

References

  1. Altinkerner, K. Average Waiting of Customer in An M/D/k Queue With Nonpreemptive Priorities, Vol. 25, No 4, 317-328, 1999.
  2. Doshi, B.T. A Note on Stochastic Decomposition in a GI/G/1 Queue with Vacations or Set-Up Times, J. Appl. Prob., 22, 419-428, 1985. https://doi.org/10.2307/3213784
  3. Fuhrmann, S.W. and Cooper, R.B. Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations, Opns.Res., 33, 1117-1129, 1985. https://doi.org/10.1287/opre.33.5.1117
  4. Harrison, J. M. Brownian models of queueing network with heterogeneous customer populations, Stochastic Differential Systems, Stochastic Control Theory and Applications, W. Fleming and P. L. Lions Eds., Springer-Verlag, 147-186, 1998.
  5. Johnson, D. P. Diffusion approximations for optimal filtering of jump processes and for queueing network, Ph. D. Thesis, University of Wisconsin, 1983.
  6. Kleinrock, L. Queueing Systems Vol.II: Computer Application, John Wiley & Sons, Inc., New York, 1976.
  7. Wolff ,R.W. Sample-Path Derivations of the Excess, Age, and Spread Distributions, J. Appl. Prob. 25, 432-436, 1988. https://doi.org/10.2307/3214453