Abstract
We consider a single-server queueing system with server vacations as the important component of the polling queueing model of a real-world system. Period of continuous operation of the server (the maximum server attendance time) is restricted, but the service of a customer cannot be interrupted when this period expires. Such features are inherent for many real-world systems with resource sharing. We assume that the customers arrival is described by the Markovian Arrival Process and service, vacation and maximum server attendance times have a phase-type distribution. We derive the stationary distributions of the system states and waiting time. Taking in mind the necessity of further application of the results to modeling the polling queueing systems, the distribution of the server visiting time is derived. Extensive numerical results are presented. They highlight that an account of the coefficient of variation of vacation and maximum attendance time is very important for exact evaluation of the key performance measures of the system, while only the results for the coefficient of variation equal to zero or one are known in the literature. Impact of the possible customers impatience, which is intuitively important because the time-limited service is considered, is confirmed by the results of the numerical experiments. Optimization problem of matching the durations of vacation and maximum attendance time is considered.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Asmussen S (2003) Applied probability and queues. Springer, New York
Boon MAA, Van der Mei RD, Winands EMM (2011) Applications of polling systems. Surv Oper Res Manag Sci 16:67–82
Boxma O, Claeys D, Gulikers L, Kella O (2015) A queueing system with vacations after N services. Nav Res Logist 62:646–658
Buchholz P, Kriege J (2017) Fitting correlated arrival and service times and related queueing performance. Queu Syst 85(3-4):337–359
Chakravarthy SR (2001) The batch Markovian arrival process: a review and future work. In: Krishnamoorthy A, Raju N, Ramaswami V (eds) Advances in probability theory and stochastic processes. Notable Publications Inc., New Jersey, pp 21–29
de Haan R, Boucherie RJ, van Ommeren RJ (2009) A polling model with an autonomous server. Queu Syst 62:279–308
de Se Silva E, Gail HR, Muntz RR (1995) Polling systems with server timeouts and their application to token passing networks. IEEE/ACM Trans Network 3:560–575
Dudin AN, Piscopo R, Manzo R (2015) Queue with group admission of customers. Comput Oper Res 61:89–99
Dudina O, Kim CS, Dudin S (2013) Retrial queueing system with Markovian arrival flow and phase type service time distribution. Comput Ind Eng 66:360–373
Frigui I, Alfa A-S (1998) Analysis of a time-limited polling system. Comput Commun 21:558–571
Gantmakher FR (1967) The matrix theory. Science, Moscow
Graham A (1981) Kronecker products and matrix calculus with applications. Ellis Horwood, Cichester
Hanbali AA, de Haan R, Boucherie RJ, van Ommeren J-KS (2012) Time-limited polling systems with batch arrivals and phase-type service times. Ann Oper Res 198:57–82
Heyman DP, Lucantoni D (2003) Modelling multiple IP traffic streams with rate limits. IEEE/ACM Trans Network 11:948–958
Katayama T (2001) Waiting time analysis for a queueing system with time-limited service and exponential timer. Nav Res Logist 48:638–651
Katayama T (2007) Analysis of a time-limited service priority queueing system with exponential timer and server vacations. Queu Syst 57:169–178
Katayama T, Kobayashi K (2007) Analysis of a nonpreemptive priority queue with exponential timer and server vacations. Perform Eval 64:495–506
Kesten H, Runnenburg JTh (1956) Priority in waiting line problems. CWI, Amsterdam
Kim CS, Klimenok V, Dudin A (2014) Optimization of guard channel policy in cellular mobile networks with account of Retrials. Comput Oper Res 43:181–190
Klemm A, Lindermann C, Lohmann M (2003) Modelling IP traffic using the batch Markovian arrival process. Perform Eval 54:149–173
Klimenok VI, Dudin AN (2006) Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queu Syst 54:245–259
Leung KK (1994) Cyclic-service systems with nonpreemptive, time-limited service. IEEE Trans Commun 42:2521–2524
Leung KK, Eisengerg M (1990) Queue with vacations and gated time-limited service. IEEE Trans Commun 38:1454–1462
Leung KK, Lucantoni D (1994) Two vacation models for token-ring networks where service is controlled by timers. Perform Eval 20:165–184
Lucantoni D (1991) New results on the single server queue with a batch Markovian arrival process. Commun Statist-Stoch Models 7:1–46
Neuts M (1981) Matrix-geometric solutions in stochastic models. The Johns Hopkins University Press, Baltimore
Takagi H (1990) Queueing analysis of polling models: and update. In: Takagi H (ed) Stochastic analysis of computer and communication systems, North-Holland, pp 267–318
Takagi H (1991) Queueing analysis: a foundation of performance evaluation. North-Holland
Takagi H (1997) Queueing analysis of polling models: progress in 1990-1994. In: Dshalalow JH (ed) Frontiers in queueing. CRC, Boca Raton, pp 119–146
Takagi H (2000) Analysis and applications of polling models. Performance evaluation: origins and directions. In: Harvig G, Lindeman C, Reiser M (eds) Lecture notes in computer science, pp 423–442
Tian N, Zhang ZG (2006) Vacation queueing models: theory and applications. Springer, New York
van Dantzig D (1955) Chaines de Markof dans les ensembles abstraits et applications aux processus avec regions absorbantes et au probleme des boucles. Ann de l’Inst H Pioncare 14:145–199
Vishnevski VM, Dudin AN (2017) Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Autom Remote Control 78:1361–1403
Vishnevsky V, Semenova O (2006) Mathematical methods to study the polling systems. Autom Remote Control 67:173–220
Vishnevsky V, Dudin A, Klimenok V, Semenova O, Shpilev S (2012) Approximate method to study M/G/1-type polling system with adaptive polling mechanism. Quality Technol Quant Manag 9:211–228
Acknowledgments
This research has been prepared with the support by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2017R1D1A3A03000523) and the support by RUDN University Program 5-100.
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
Kim, C., Dudin, A., Dudina, O. et al. Analysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customers. Methodol Comput Appl Probab 22, 401–432 (2020). https://doi.org/10.1007/s11009-019-09707-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-019-09707-7
Keywords
- Queueing model
- Time limited service
- Vacation
- Polling system
- Phase-type distribution
- Markovian arrival process