Skip to main content
Log in

The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The formula for the blocking probability for the finite capacity M/G/1/K in terms of the steady state occupancy probability distribution of M/G/1 and the system utilization is known [Keilson, J. Royal Statistical Soc. Serie B, 28 (1966) 190–201]. The validity of this relationship is demonstrated for a broad class of state dependent M/G/1 vacation systems and priority systems. New methods are employed which may also be of interest in their own right.

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. B.T. Doshi, Queueing systems with vacations, A Survey, Queueing Systems 1 (1987) 29–66.

    Google Scholar 

  2. S.W. Furhmann and R.B. Cooper, Stochastic decomposition in the M/G/l/ queue with generalized vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  3. D.P. Gaver, A waiting line with interrupted service, including priorities, J. Royal Statistical Soc. Series B, 24 (1962) 73–90.

    Google Scholar 

  4. P. Glasserman and W. Gong, Time-changing and truncatingK-capacity queues from oneK to another, J. Appl. Prob. 28 (1991) 647–655.

    Google Scholar 

  5. C. Harris and W.G. Marchai, State dependence in M/G/l server-vacation models, Oper. Res. 36 (1988) 560–565.

    Google Scholar 

  6. N.K. Jaiswal, Preemptive resume priority queue, Oper. Res. 9 (1961) 732–770.

    Google Scholar 

  7. J. Keilson, Queues subject to service interruption, Annals of Math. Statistics 33 (1962) 1314–1322.

    Google Scholar 

  8. J. Keilson, The ergodic queue length distribution for queueing systems with finite capacity, J. Royal Statistical Soc. Series B, 28 (1966) 190–201.

    Google Scholar 

  9. J. Keilson and L.D. Servi, Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules, J. Appl. Prob. 23 (1986) 790–802.

    Google Scholar 

  10. J. Keilson and L.D. Servi, A distributional form of Little's law, Oper. Res. Lett. 7 (1988) 223–227.

    Google Scholar 

  11. J. Keilson and L.D. Servi, Blocking probability for M/G/l vacation systems with occupancy level dependent schedules, Oper. Res. 27 (1989) 134–140.

    Google Scholar 

  12. J. Keilson and L.D. Servi, The distributional form of Little's law and the Fuhrmann-Cooper decomposition, Oper. Res. Lett. 9 (1990) 192–198.

    Google Scholar 

  13. O. Kella and U. Yechiali, Priorities in M/G/l queue with server vacations, Naval. Res. Logistics 35 (1988) 23–34.

    Google Scholar 

  14. J.G. Shantihikumar, Analysis of priority queues with server control, Opsearch 21 (1984) 23–34.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was conducted while J. Keilson was a Senior Staff Scientist at GTE Laboratories Incorporated.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Keilson, J., Servi, L.D. The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems. Queueing Syst 14, 111–123 (1993). https://doi.org/10.1007/BF01153529

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01153529

Keywords