A queueing system with batch arrival of customers in sessions

This paper describes and analyzes a single-server queueing model with a finite buffer and session arrivals. Generation of the sessions is described by the Markov Arrival Process (MAP). Arrival of the groups of the requests within any admitted session is described by the Terminating Batch Markov Arrival Process (TBMAP). Service time of the request has Phase (PH) type distribution. The number of the sessions that can be simultaneously admitted to the system is under control. Analysis of the joint distribution of the number of sessions and requests in the system is implemented by means of the matrix technique. Analysis of the sojourn time of an arbitrary and admitted session is performed by means of the extension of the method of catastrophes. Effect of control on the main performance measures of the system is numerically demonstrated.

[1]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[2]  Che Soong Kim,et al.  Lack of Invariant Property of the Erlang Loss Model in Case of MAP Input , 2005, Queueing Syst. Theory Appl..

[3]  Wolfgang Fischer,et al.  The Markov-Modulated Poisson Process (MMPP) Cookbook , 1993, Perform. Evaluation.

[4]  P. Iseger.  NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE , 2005, Probability in the Engineering and Informational Sciences.

[5]  Moon Ho Lee,et al.  Queueing Model with Time-Phased Batch Arrivals , 2007, International Teletraffic Congress.

[6]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

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

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

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

[10]  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 .

[11]  Vaidyanathan Ramaswami.  Independent markov processes in parallel , 1985 .

[12]  Che Soong Kim,et al.  The MAP/PH/1/N queue with flows of customers as a model for traffic control in telecommunication networks , 2009, Perform. Evaluation.

[13]  Daniel P. Heyman,et al.  Modeling multiple IP traffic streams with rate limits , 2003, TNET.

[14]  David M. Lucantoni,et al.  Algorithms for the multi-server queue with phase type service , 1985 .

[15]  Richard J. Harris,et al.  A simple IP flow blocking model , 2005 .

[16]  Alma Riska,et al.  Efficient fitting of long-tailed data sets into hyperexponential distributions , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.