Abstract
In this work we look at a discrete-time multiserver queueing system where the number of available servers is distributed according to one of two geometrics. The arrival process is assumed to be general independent, the service times deterministically equal to one slot and the buffer capacity infinite. The queueing system resides in one of two states and the number of available servers follows a geometric distribution with parameter determined by the system state. At the end of a slot there is a fixed probability that the system evolves from one state to the other, with this probability depending on the current system state only, resulting in geometrically distributed sojourn times.
We obtain the probability generating function (pgf) of the system content of an arbitrary slot in steady-state, as well as the pgf of the system content at the beginning of an arbitrary slot with a given state. Furthermore we obtain an approximation of the distribution of the delay a customer experiences in the proposed queueing system. This approximation is validated by simulation and the results are illustrated with a numerical example.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bruneel, H.: A general model for the behavior of infinite buffers with periodic service opportunities. Eur. J. Oper. Res. 16(1), 98–106 (1984)
Bruneel, H., Kim, B.G.: Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers Group (1993)
Bruneel, H., Steyaert, B., Desmet, E., Petit, G.: Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues. Eur. J. Oper. Res. 76(3), 563–572 (1994)
Bruneel, H., Wittevrongel, S.: Analysis of a discrete-time single-server queue with an occasional extra server. Perform. Eval. 116, 119–142 (2017)
Chaudhry, M.L., Gupta, U., Goswami, V.: Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(\text{ GI}^\text{ X }\)/Geom/m. INFORMS J. Comput 13(3), 172–180 (2001)
Chaudhry, M.L., Kim, N.: A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. Oper. Res. Lett. 31(2), 101–107 (2003)
Gao, P., Wittevrongel, S., Bruneel, H.: Discrete-time multiserver queues with geometric service times. Comput. Oper. Res. 31(1), 81–99 (2004)
Gao, P., Wittevrongel, S., Walraevens, J., Moeneclaey, M., Bruneel, H.: Calculation of delay characteristics for multiserver queues with constant service times. Eur. J. Oper. Res. 199(1), 170–175 (2009)
Georganas, N.D.: Buffer behavior with Poisson arrivals and bulk geometric service. IEEE Trans. Commun. 24, 938–940 (1976)
Gonzalez, M.: Classical Complex Analysis. CRC Press (1991)
Kerbache, L., Smith, J.: Queueing networks and the topological design of supply chain systems. Int. J. Prod. Econ. 91, 251–272 (2004)
Laevens, K., Bruneel, H.: Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers. Eur. J. Oper. Res. 85, 161–177 (1995)
Laevens, K., Bruneel, H.: Discrete-time multiserver queues with priorities. Perform. Eval. 33, 249–275 (1998)
Stolletz, R.: Analysis of passenger queues at airport terminals. Res. Transp. Bus. Manag. 1(1), 144–149 (2011)
Woodside, C., Ho, E.: Engineering calculation of overflow probabilities in buffers with Markov-interrupted service. IEEE Trans. Commun. 35(12), 1272–1277 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Verdonck, F., Bruneel, H., Wittevrongel, S. (2020). An All Geometric Discrete-Time Multiserver Queueing System. In: Gribaudo, M., Sopin, E., Kochetkova, I. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2019. Lecture Notes in Computer Science(), vol 12023. Springer, Cham. https://doi.org/10.1007/978-3-030-62885-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-62885-7_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62884-0
Online ISBN: 978-3-030-62885-7
eBook Packages: Computer ScienceComputer Science (R0)