Analysis of Markov Multiserver Retrial Queues with Negative Arrivals

Negative arrivals are used as a control mechanism in many telecommunication and computer networks. In the paper we analyze multiserver retrial queues; i.e., any customer finding all servers busy upon arrival must leave the service area and re-apply for service after some random time. The control mechanism is such that, whenever the service facility is full occupied, an exponential timer is activated. If the timer expires and the service facility remains full, then a random batch of customers, which are stored at the retrial pool, are automatically removed. This model extends the existing literature, which only deals with a single server case and individual removals. Two different approaches are considered. For the stable case, the matrix–analytic formalism is used to study the joint distribution of the service facility and the retrial pool. The approximation by more simple infinite retrial model is also proved. In the overloading case we study the transient behaviour of the trajectory of the suitably normalized retrial queue and the long-run behaviour of the number of busy servers. The method of investigation in this case is based on the averaging principle for switching processes.

[1]  Marcel F. Neuts,et al.  Numerical investigation of a multiserver retrial model , 1990, Queueing Syst. Theory Appl..

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

[3]  Alexander N. Dudin,et al.  A retrial BMAP/SM/1 system with linear repeated requests , 1999, Queueing Syst. Theory Appl..

[4]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[5]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

[6]  Vladimir V. Anisimov,et al.  Switching processes: Averaging principle, diffusion approximation and applications , 1995 .

[7]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .

[8]  Vladimir V. Anisimov.  Switching stochastic models and applications in retrial queues , 1999 .

[9]  Jesús R. Artalejo,et al.  Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue , 1996 .

[10]  Vidyadhar G. Kulkarni.  Introduction to matrix analytic methods in stochastic modeling, by G. Latouche and V. Ramaswamy , 1999 .

[11]  J. R. Artalejo,et al.  On a single server queue with negative arrivals and request repeated , 1999 .

[12]  Ward Whitt,et al.  The time‐dependent Erlang loss model with retrials , 1997, Telecommun. Syst..

[13]  Vladimir V. Anisimov.  Diffusion Approximation for Processes with Semi-Markov Switches and Applications in Queueing Models , 1999 .

[14]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[15]  A. Shiryaev,et al.  Limit Theorems for Stochastic Processes , 1987 .

[16]  Xiuli Chao,et al.  Queueing networks , 1999 .

[17]  Attahiru Sule Alfa,et al.  Matrix analytic methods for a multi-server retrial queue with buffer , 1999 .

[18]  A. Gómez-Corral,et al.  Generalized birth and death processes with applications to queues with repeated attempts and negative arrivals , 1998 .

[19]  J.R. Artalejo,et al.  G-networks: A versatile approach for work removal in queueing networks , 2000, Eur. J. Oper. Res..

[20]  Bara Kim,et al.  MAP1, MAP2/M/c retrial queue with guard channels and its application to cellular networks , 1999 .

[21]  Vladimir V. Anisimov.  Averaging methods for transient regimes in overloading retrial queueing systems , 1999 .

[22]  Jesús R. Artalejo,et al.  A classified bibliography of research on retrial queues: Progress in 1990–1999 , 1999 .

[23]  Jesús R. Artalejo,et al.  Steady state solution of a single-server queue with linear repeated requests , 1997, Journal of Applied Probability.