Stochastics and StatisticsAnalysis of the BMAP/G/1 retrial system with search of customers from the orbit
Introduction
A retrial queueing system is characterised by the requirement that customers encountering all servers busy will have to leave the area and join a group of unsatisfied customers, called orbit. These arise frequently in the stochastic modelling of telecommunications, computer systems, stock and flow and so on. Review of retrial queueing literature could be found in [1], [2], [14], [15], [23]. A number of application of retrial queues in science and engineering can be found in [19]. In the retrial setup, each service is preceded and followed by the server(s) idle time because of the ignorance about the status of the server(s) and orbital customers by each other.
We are interested in designing retrial queues that reduces the server(s) idle time and achieve this by the introduction of search of orbital customers immediately after a service completion (with search we associate a probability). Search for orbital customers was introduced in [3]. It may be recalled that in [22] the authors examined classical queue with search for customers immediately on termination of a service. An example for search of orbital customers is the following: consider an inventory where customers requiring the item arrive for purchase. Incase the item is out of stock at a demand epoch, such customers, after recording their name in a register, proceed to the orbit (can be their own residence). On replenishment the management scans through this register and select persons (according to some priority), to provide the item.
Yet another example is the repair-service with search of customers: the job-shop keeps a register of customers who are forced to leave the system since they encountered a busy server at the time of arrival. On completing a service the server decides to have the next service by picking up an unsatisfied (orbital) customer with probability pj, where j is the number of customers on the orbit. Simultaneously, the customers from the orbit try to reach the server themselves and there is a competition between primary and orbital customers and search mechanism. If the search mechanism is not switched (with probability qj=1−pj), there is a competition only between primary and secondary customers for getting into the counter for the next service.
This paper generalizes the result in [3] introducing a search time, two types of services to customers (primary/orbital) and by assuming the arrival process to be batch Markovian process. The batch Markovian arrival process (BMAP) suits well for modelling the correlated bursty traffic in the modern communication networks. Approximation of such flows in terms of the stationary Poisson process can cause huge errors in evaluation of performance characteristics. Chakravarthy in [5] provides a review of queueing models with batch Markovian arrivals. Retrial models with BMAP arrivals have been investigated in [4], [6], [7], [9], [10], [11], [18].
In Section 2, the mathematical model under consideration is described. In Section 3, the stationary distribution of the embedded Markov chain at the service completion epochs is calculated. Section 4 contains formulas for calculating the arbitrary time orbit length stationary distribution and some performance characteristics of the model. In Section 5, the modification of results (previously obtained for negligible search time) to the case of random search time is given. Section 6 gives the numerical illustration of the model presented and way for calculating the stationary distributions. The last section contains some concluding remarks and probable ways of extension of results to the cases of semi-Markovian service process and state dependent service time distributions.
Section snippets
The mathematical model
We consider a single server queueing system in which the arrivals occur according to a BMAP. The BMAP, a special class of tractable Markov renewal process, is a rich class of point processes that includes many well-known processes such as Poisson, PH-renewal processes, and Markov-modulated Poisson process. One of the most significant features of the BMAP is the underlying Markovian structure and fits ideally in the context of matrix-analytic solutions to stochastic models. The matrix-analytic
The stationary distribution of the embedded Markov chain
For the sake of simplicity, assume that the search mechanism is always switched-on at service completion epochs (i.e., pi=1, i>0). Later we will relax this assumption.
Let tn denote the nth service completion epoch, in be the number of customers in the orbit and νn be the state of the BMAP process νt at tn+0. It is clear that the process ξn={in,νn}, n⩾1, is a two-dimensional Markov chain with state space in⩾0, νn=1,…,m.
In the sequel we need the following auxiliary matrices. Define
The stationary distribution of the queue at arbitrary time
Denote by , i⩾0, 0⩽r⩽2, the steady state probability vector that at an arbitrary time there are i customers in the system, and the current service is in rth mode. Note that r=0 corresponds to the case when the server is idle. The following theorem gives an expression for the steady state probabilities. Theorem 2 The stationary probability vectors are calculated as follows:where the matrices
The case of randomized beginning of a search
To reduce the size of formulae above, we temporarily assumed that the search begins at any service completion epoch (when the orbit is not empty). Recall now that we assumed earlier that the search begins with probability pi if i customers stay in the orbit. In the opposite case the system behaves as the usual retrial system and the service begins after the arrival of a primary batch or a retrial. Analyzing the behavior of embedded Markov chain in this case we easily see that the above
Numerical examples
In this section, we present some numerical examples. The numerical realization of proposed algorithms for calculating the embedded and arbitrary time stationary distributions is implemented relatively easily only if we have already the existing infrastructure suitable for calculating, e.g., the matrices like , , l⩾0, r=1,2, , , G, etc. Such a structure is provided by the software “SIRIUS+” (see, e.g., [13]).
We consider the BMAP with representation {Dk} given by the matrices:
Concluding remarks
In this paper we considered a single server retrial queuing model in which customers arrive according to a BMAP. The services are offered in two modes. In mode 1, the customers are served after staying in the orbit while in mode 2 the customer is served in case it has a luck to meet a free server upon arrival. In addition to the usual way of reaching the server due to a customer retrial, we assume that, at the service completion epoch, the server can start a search of a customer in the orbit
Acknowledgements
Research of A. Krishnamoorthy is supported by UGC (India), Research award F.30-97/98/SA-III.
Research of V.C. Joshua is supported by UGC (India) under Faculty Improvement Programme F.FIP99/SWRO/UGC/KLMG002.
References (23)
Accessible bibliography on retrial queues
Mathematical and Computer Modelling
(1999)- et al.
The BMAP/SM/1 retrial queue with controllable operation modes
European Journal of Operational Research
(2001) - et al.
Queueing system BMAP/G/1 with repeated calls
Mathematical and Computer Modelling
(1999) A classified bibliography of research on retrial queues: Progress in 1990–1999
Top
(1999)- et al.
An M/G/1 retrial queue with orbital search by the server
- et al.
A retrial BMAP/PH/N system
Queueing Systems
(2002) The batch Markovian arrival process: A review and future work
- et al.
A multiserver retrial queue with BMAP arrivals and group services
Queueing Systems
(2002) Introduction to Stochastic Processes
(1975)- et al.
A retrial BMAP/SM/1 system with linear repeated requests
Queueing Systems
(2000)
BMAP/SM/1 model with Markov modulated retrials
Top
Cited by (47)
A two-class queueing system with constant retrial policy and general class dependent service times
2018, European Journal of Operational ResearchCitation Excerpt :Both retrial disciplines can be treated in a unified way by defining the linear retrial policy (Artalejo & Gomez-Corral, 1997). Single class retrial systems under constant retrial policy were investigated in Artalejo, Gomez-Corral, and Neuts (2001), Avrachenkov and Yechiali (2010), Choi, Park, and Pearce (1993a), Choi, Rhee, and Park (1993b), Diamond and Alfa (1999), Dudin, Krishnamoorthy, Joshua, and Tsarenkov (2004), Economou and Kanta (2011), Efrosinin and Winkler (2011), Farahmand (1990), Gao and Wang (2014), Kim, Klimenok, and Orlovsky (2008), Sivakumar (2008), Wang, Zhang, and Huang (2017), Yang, Posner, Templeton, and Li (1994) (not exhaustive list). Clearly, there have been very limited results in retrial queueing literature with multiple classes of retrial customers.
Stability analysis of a multiclass retrial system with classical retrial policy
2017, Performance EvaluationPerformance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers
2014, European Journal of Operational ResearchCitation Excerpt :Then a service is followed by another service if a search is made, otherwise a service is followed by an idle period. So far seldom research work on retrial queue with orbital search has been done, readers are referred to Artalejo, Joshua, and Krishnamurthy (2002), Dudin, Krishnamoorthy, Joshua, and Tsarenkov (2004), Krishnamoorthy, Deepak, and Joshua (2005), Chakravarthy, Krishnamoorthy, and Joshua (2006), Wang (2006), Zhang and Wang (2012), Deepak, Dudin, Joshua, and Krishnamoorthy (2013) and references therein. In this paper we will introduce the orbital search policy into the M/G/1 retrial queue with negative customers and impatient customers.
A single server retrial queue with event-dependent arrival rates
2023, Annals of Operations ResearchSteady state analysis of M/G/1 retrial queue with vacation and server timeout using a Petri net formalism
2023, International Journal of Mathematics in Operational ResearchAN EFFICIENT MCOMPUTE THE RATE MATRIX FOR MULTI-SERVER RETRIAL QUEUES WITH CLOUD COMPUTING SYSTEMS
2023, International Journal of Computer Networks and Communications