Skip to main content
Log in

The M/G/1 Queue with Finite Workload Capacity

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider the M/G/1 queueing system in which customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Various results on the distribution of the workload are derived; in particular, we give explicit formulas for its stationary distribution for M/M/1 and in the general case, under the preemptive LIFO discipline, for the joint stationary distribution of the number of customers in the system and their residual service times. Furthermore, the Laplace transform of the length of a busy period is determined. Finally, for M/D/1 the busy period distribution is derived in closed form.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. Asmussen, Applied Probability and Queues (Wiley, New York, 1987).

    Google Scholar 

  2. J. DeLucia and H.V. Poor, The moment generating function of the stopping time for a linearly stopped Poisson process, Stochastic Models 13 (1997) 275–292.

    Google Scholar 

  3. A. Dvoretzky, J. Kiefer and J. Wolfowitz, Sequential decision problems for processes with continuous time parameter, Ann. Math. Statist. 24 (1953) 254–264.

    Google Scholar 

  4. B.V. Gnedenko and I.N. Kovalenko, Introduction to Queueing Theory, 2nd ed. (Birkhäuser, Basel, 1989).

  5. P. Henrici, Applied and Computational Complex Analysis, Vol. I. (Wiley, New York, 1974).

    Google Scholar 

  6. D. Perry and S. Asmussen, Rejection rules for the M/G/1 queue, Queueing Systems 19 (1995) 105–130.

    Google Scholar 

  7. D. Perry, W. Stadje and S. Zacks, Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility, Oper. Res. Lett. 27 (2000) 163–174.

    Google Scholar 

  8. A.D. Polyanin and V.F. Zaitsev, Handbook of Exact Solutions for Ordinary Differential Equations (CRC Press, Boca Raton, FL, 1995).

    Google Scholar 

  9. W. Stadje, Distributions of first exit times for empirical counting and Poisson processes with moving boundaries, Stochastic Models 9 (1993) 91–103.

    Google Scholar 

  10. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).

    Google Scholar 

  11. W. Whitt, Comparing counting processes and queues, Adv. in Appl. Probab. 13 (1981) 207–220.

    Google Scholar 

  12. S. Zacks, Distributions of stopping times for Poisson processes with linear boundaries, Stochastic Models 7 (1991) 233–242.

    Google Scholar 

  13. S. Zacks, Distributions of first exit times for Poisson processes with lower and upper linear boundaries, in: A Volume in Honor of Samuel Kotz, eds. N.L. Johnson and N. Balakrishnan (Wiley, New York, 1997) chapter 20, pp. 339–350.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perry, D., Stadje, W. & Zacks, S. The M/G/1 Queue with Finite Workload Capacity. Queueing Systems 39, 7–22 (2001). https://doi.org/10.1023/A:1017931515538

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017931515538