Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment

Abstract A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. The criterion of ergodicity for a multi-dimensional Markov chain describing the behavior of the system and the algorithm for computation of its steady-state distribution are outlined. Some key performance measures are calculated. The Laplace-Stieltjes transforms of the sojourn and waiting time distributions of priority and non-priority customers are derived. A numerical example illustrating the importance of taking into account the correlation in the arrival process is presented

[1]  Yves Dallery,et al.  Queueing models for full-flexible multi-class call centers with real-time anticipated delays , 2009 .

[2]  Andrzej Chydzi.  ANALYSIS OF AQM QUEUES WITH QUEUE SIZE BASED PACKET DROPPING , 2011 .

[3]  Che Soong Kim,et al.  Queueing system MAP|PH|N|N+R with impatient heterogeneous customers as a model of call center , 2013 .

[4]  Alexander N. Dudin,et al.  A BMAPPH1 queue with feedback operating in a random environment , 2005, Math. Comput. Model..

[5]  Srinivas R. Chakravarthy.  The Batch Markovian Arrival Process: A Review and Future Work , 2001 .

[6]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[7]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[8]  Che Soong Kim,et al.  MMAP|M|N queueing system with impatient heterogeneous customers as a model of a contact center , 2013, Comput. Oper. Res..

[9]  Valentina Klimenok,et al.  The BMAP/PH/1 retrial queueing system operating in random environment , 2007 .

[10]  Karim Djouani,et al.  Joint queue-perturbed and weakly coupled power control for wireless backbone networks , 2012, Int. J. Appl. Math. Comput. Sci..

[11]  H. Kesten,et al.  Priority in Waiting Line Problems 1). II , 1957 .

[12]  Zeynep Akşin,et al.  The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research , 2007 .

[13]  Che Soong Kim,et al.  Erlang loss queueing system with batch arrivals operating in a random environment , 2009, Comput. Oper. Res..

[14]  Che Soong Kim,et al.  The BMAP/PH/N retrial queueing system operating in Markovian random environment , 2010, Comput. Oper. Res..

[15]  Che Soong Kim,et al.  Queueing System MAP|PH|N|R with Session Arrivals Operating in Random Environment , 2013, CN.

[16]  Sang-Chan Park,et al.  Outsourcing strategy in two-stage call centers , 2010, Comput. Oper. Res..

[17]  Alexander N. Dudin,et al.  Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory , 2006, Queueing Syst. Theory Appl..

[18]  Alexander N. Dudin,et al.  Socio-behavioral Scheduling of Time-Frequency Resources for Modern Mobile Operators , 2013 .

[19]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[20]  Andrzej Chydzinski,et al.  Analysis of AQM queues with queue size based packet dropping , 2011, Int. J. Appl. Math. Comput. Sci..

[21]  Alexander N. Dudin,et al.  Investigation of the M2/G2/1/∞,N queue with restricted admission of priority customers and its application to HSDPA mobile systems , 2009, Comput. Networks.

[22]  D. van Dantzig.  Chaînes de Markof dans les ensembles abstraits et applications aux processus avec régions absorbantes et au problème des boucles , 1955 .

[23]  Yves Dallery,et al.  Call Centers with Delay Information: Models and Insights , 2011, Manuf. Serv. Oper. Manag..