In this paper the authors define a queueing model that is an M (X ) /G/1 model with an internal retrial system based on two types of search of customers from the orbit. The authors generalize the M /G/1 retrial model which has been defined by other authors in the literature. The authors assume that the process of arrivals to the system is a batch Poisson process. They also define two models: Model 1 and Model 2, based on two different search procedures for customers who are waiting in the orbit within the system. In this context the authors define the corresponding mathematical model and study the stationary distribution of the embedded Markov chain. They study the stationary distribution of system size and orbit size at arbitrary time. They compute some performance characteristics of the model and present some numerical results.
Recensione dell'articolo: (Deepak, T. G.; Dudin, A. N.; Joshua, V. C.; Krishnamoorthy, A. - " On an M(X)/G/1 retrial system with two types of search of customers from the orbit" - Stoch. Anal. Appl. 31 (2013), no. 1, 92–107)
PASINI, Leonardo
2014-01-01
Abstract
In this paper the authors define a queueing model that is an M (X ) /G/1 model with an internal retrial system based on two types of search of customers from the orbit. The authors generalize the M /G/1 retrial model which has been defined by other authors in the literature. The authors assume that the process of arrivals to the system is a batch Poisson process. They also define two models: Model 1 and Model 2, based on two different search procedures for customers who are waiting in the orbit within the system. In this context the authors define the corresponding mathematical model and study the stationary distribution of the embedded Markov chain. They study the stationary distribution of system size and orbit size at arbitrary time. They compute some performance characteristics of the model and present some numerical results.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.