On a 2-class polling model with reneging and \(k_i\)-limited service
- 59 Downloads
This paper analyzes a 2-class, single-server polling model operating under a \(k_i\)-limited service discipline with class-dependent switchover times. Arrivals to each class are assumed to follow a Poisson process with phase-type distributed service times. Within each queue, customers are impatient and renege (i.e., abandon the queue) if the time before entry into service exceeds an exponentially distributed patience time. We model the queueing system as a level-dependent quasi-birth-and-death process, and the steady-state joint queue length distribution as well as the per-class waiting time distributions are computed via the use of matrix analytic techniques. The impacts of reneging and choice of service time distribution are investigated through a series of numerical experiments, with a particular focus on the determination of \((k_1,k_2)\) which minimizes a cost function involving the expected time a customer spends waiting in the queue and an additional penalty cost should reneging take place.
KeywordsPolling model \(k_i\)-limited service discipline Reneging Quasi-birth-and-death process Switchover times Phase-type distribution
Steve Drekic and Kevin Granville thank the anonymous referee and the editor-in-chief for their supportive comments and helpful suggestions. Steve Drekic and Kevin Granville also acknowledge the financial support from the Natural Sciences and Engineering Research Council of Canada through its Discovery Grants program (#RGPIN-2016-03685) and Postgraduate Scholarship-Doctoral program, respectively.
Compliance with ethical standards
Conflict of interest
The authors declare no conflict of interest.
- Boon, M. A. A. (2011). Polling models: From theory to traffic intersections. Doctoral dissertation, Eindhoven: Technische Universiteit Eindhoven.Google Scholar
- Gromoll, H. C., Robert, P., Zwart, B., & Bakker, R. (2006). The impact of reneging in processor sharing queues. In Proceedings of the joint international conference on measurement and modeling of computer systems (pp. 87–96), Saint Malo, France.Google Scholar
- Mishkoy, G., Krieger, U. R., & Bejenari, D. (2012). Matrix algorithm for polling models with PH distribution. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 68(1), 70–80.Google Scholar
- Vishnevskii, V. M., & Semenova, O. V. (2008). The power-series algorithm for two-queue polling system with impatient customers. In Proceedings of ICT 2008—15th International conference on telecommunications (pp. 1–3), Saint-Petersburg, Russia.Google Scholar
- Vishnevskii, V. M., & Semenova, O. V. (2009). The power-series algorithm for \(M/M/1\)-type polling system with impatient customers. In Proceedings of EUROCON 2009—International conference on computer as a tool (pp. 1915–1918), Saint-Petersburg, Russia.Google Scholar