Abstract
We consider a discrete-time queueing system with two queues and one server. The server is allocated in each slot to the first queue with probability \(\alpha \) and to the second queue with probability \(1-\alpha \). The service times are equal to one time slot. The queues have exponentially bounded, but general, arrival distributions. The mathematical description of this system leads to a single functional equation for the joint probability generating function of the stationary system contents. As the joint stochastic process of the system contents is not amenable for exact analysis, we focus on an efficient approximation of the joint probability generating function. In particular, first we prove that the partial probability generating functions, present in the functional equation, have a unique dominant pole. Secondly, we use this information to approximate these partial probability generating functions by truncating an infinite sum. The remaining finite number of unknowns are estimated from a noise perturbed linear system. We illustrate our approach by various numerical examples and verify the accuracy by means of simulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blanc, J. P. C. (1993). Performance analysis and optimization with the power-series algorithm. Performance Evaluation of Computer and Communication Systems, 53–80,
Bruneel, H. (1983). On the behavior of buffers with random server interruptions. Performance Evaluation, 3(3), 165–175.
Bruneel, H., & Kim, B. G. (1993). Discrete-time models for communication systems including ATM. Boston: Kluwer Academic.
Cohen, J. W. (1988). Boundary value problems in queueing theory. Queueing Systems, 3(2), 97–128.
Cohen, J. W., & Boxma, O. J. (1983). Boundary value problems in queueing system analysis. North-Holland: Amsterdam.
de Haan, R., Boucherie, R. J., & van Ommeren, J. K. (2009). A polling model with an autonomous server. Queueing Systems, 62(3), 279–308.
Devos, A., Fiems, D., Walraevens, J. & Bruneel, H., An approximate analysis of a Bernoulli alternating service model, In Proceedings of the 14th International Conference on Queueing Theory and Network Applications, QTNA 2019, Ghent. Lecture Notes in Computer Science (Vol 11688, pp. 314-329) (2019)
Dimitriou, I. (2016). A, queueing model with two classes of retrial customers and paired services. Annals of Operations Research, 238(1–2), 123–143.
Fayolle, G., Malyshev, V. A., & Iasnogorodski, R. (1999). Random walks in the quarter-plane (Vol. 40). New York: Springer-Verlag.
Flajolet, P., & Sedgewick, R. (2009). Analytic combinatorics. Cambridge: Cambridge University Press.
Guillemin, F., Knessl, C., & van Leeuwaarden, J. S. H. (2013). Wireless three-hop networks with stealing II: exact solutions through boundary value problems. Queueing Systems, 74(2–3), 235–272.
Hanbali, A., de Haan, R., Boucherie, R. J., & van Ommeren, J. K. (2012). Time-limited polling systems with batch arrivals and phase-type service times. Annals of Operations Research, 198(1), 57–82.
Hooghiemstra, G., Keane, M., & Van de Ree, S. (1988). Power series for stationary distributions of coupled processor models. SIAM Journal on Applied Mathematics, 48(5), 1159–1166.
Li, H., & Zhao, Y. Q. (2011). Tail asymptotics for a generalized two-demand queueing model - a kernel method. Queueing Systems, 69, 77–100.
Maertens, T., Walraevens, J., & Bruneel, H. (2007). Priority queueing systems: from probability generating functions to tail probabilities. Queueing Systems, 55(1), 27–39.
Malyshev, V. A. (1972). An analytical method in the theory of two-dimensional positive random walks. Siberian Mathematical Journal, 13(6), 917–929.
Parekh, A. K., & Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking, 1, 344–357.
Resing, J., & Örmeci, L. (2003). A tandem queueing model with coupled processors. Operations Research Letters, 31(5), 383–389.
Saxena, M., Boxma, O. J., Kapodistria, S., & Queija, R. (2017). Two queues with random time-limited polling. Probability and Mathematical Statistics, 37(2), 257–289.
Tijms, H. C., & Van Vuuren, D. J. (2002). Markov Processes on a semi-infinite strip and the geometric tail algorithm. Annals of Operations Research, 113(1–4), 133–140.
Van Mieghem, P. (1996). The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation. Queueing Systems, 23(1–4), 27–55.
Vanlerberghe, J., Maertens, T., Walraevens, J., De Vuyst, S., & Bruneel, H. (2016). On the optimization of two-class work-conserving parameterized scheduling policies. 4OR-Q J Oper Res, 14, 281–308.
Walraevens, J., Steyaert, B., & Bruneel, H. (2003). Performance analysis of a single-server ATM queue with a priority scheduling. Computers & Operations Research, 30(12), 1807–1829.
Walraevens, J., van Leeuwaarden, J. S. H., & Boxma, O. (2010). J, Power series approximations for two-class generalized processor sharing systems. Queueing Systems, 66(2), 107–130.
Acknowledgements
The authors would like to thank the anonymous referees for their helpful comments and suggestions, which improved the content and the structure of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Devos, A., Walraevens, J., Fiems, D. et al. Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline. Ann Oper Res 310, 477–503 (2022). https://doi.org/10.1007/s10479-020-03776-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-020-03776-5
Keywords
- Queueing theory
- Two-class queueing model
- Joint probability generating function
- Dominant singularities
- Approximation