Skip to main content

On the Blocking Probability and Loss Rates in Nonpreemptive Oscillating Queueing Systems

  • Conference paper
  • First Online:
Analytical and Stochastic Modelling Techniques and Applications (ASMTA 2016)

Abstract

We analyze busy period related characteristics for oscillating systems, proposing a method to compute the mean length of busy periods for nonpreemptive oscillating \(M^ X/G/1/(n,a,b)\) systems. We further evaluate customer loss rates in busy cycles and the long-run blocking probability for such systems using the proposed method and earlier results from the authors for the mean number of customer losses in busy periods.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chydzinski, A.: The \(M/G-G/1\) oscillating queueing system. Queueing Syst. 42(3), 255–268 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chydzinski, A.: The oscillating queue with finite buffer. Perform. Eval. 57(3), 341–355 (2004)

    Article  Google Scholar 

  3. Ferreira, F., Pacheco, A., Ribeiro, H.: Moments of losses during busy-periods of regular and nonpreemptive oscillating \(M^X/G/1/n\) systems. Annals of Operations Research (2016, in press)

    Google Scholar 

  4. Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman and Hall, London (1995)

    MATH  Google Scholar 

  5. Pacheco, A., Ribeiro, H.: Consecutive customer losses in regular and oscillating \(M^X/G/1/n\) systems. Queueing Syst. 58(2), 121–136 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Pacheco, A., Ribeiro, H.: Moments of the duration of busy-periods of \(M^X/G/1/n\) systems. Probab. Eng. Inf. Sci. 22, 1–8 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research was financed by Portuguese funds through FCT (Fundação para a Ciência e a Tecnologia), within the Projects UID/MAT/00013/2013 and UID/Multi/04621/2013.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to António Pacheco .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ferreira, F., Pacheco, A., Ribeiro, H. (2016). On the Blocking Probability and Loss Rates in Nonpreemptive Oscillating Queueing Systems. In: Wittevrongel, S., Phung-Duc, T. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2016. Lecture Notes in Computer Science(), vol 9845. Springer, Cham. https://doi.org/10.1007/978-3-319-43904-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43904-4_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43903-7

  • Online ISBN: 978-3-319-43904-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics