Abstract
We analyze busy period related characteristics for oscillating systems, proposing a method to compute the mean length of busy periods for nonpreemptive oscillating MX/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.
Author supplied keywords
Cite
CITATION STYLE
Ferreira, F., Pacheco, A., & Ribeiro, H. (2016). On the blocking probability and loss rates in nonpreemptive oscillating queueing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9845 LNCS, pp. 155–166). Springer Verlag. https://doi.org/10.1007/978-3-319-43904-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
