Some decomposition results for a class of vacation queues
Introduction
Polling systems which occur frequently in the medium access control aspects in communication systems are usually approximated by vacation queueing models. A performance measure (delay) associated with several Medium Access Control (MAC) protocols is strongly dependent on the medium sharing algorithm. Exhaustive polling system, the simplest, is often used as a good approximation to studying performance measures. Hence whatever we can do to reduce the workload involved in computing the key matrices associated with this system and computation of the system performance is always a welcome. In this paper we present new decomposition results that make the analysis of the MAP/PH/1 vacation much easier to implement when it is studied in arbitrary times using the matrix-analytic method. For both the discrete time and continuous time MAP/PH/1 systems with PH vacations the model can be set up as quasi-birth-and-death (QBD) process. Sometimes the length and type of vacation models considered lead to huge sizes of the associated matrices and of order , where and are dimensions related to the matrices that represent the arrival, service and vacation processes. Computing these matrices is usually the heaviest computation load associated with the model. With computational focus in mind we present decomposition results associated with these matrices. We show that most of the work in computing these matrices is simply that of computing the equivalent matrices for the MAP/PH/1 system (without vacation), and that the remaining work only involves solving linear equations. In so doing we reduce the size of the main matrix that requires major computation to order . By being able to decompose the matrices and then capitalizing on the features of this decomposition we can reduce the associated computational efforts. We show that the results for the matrix can be extended to the BMAP/PH/1 vacation system. Finally, we also show that these matrices can be obtained explicitly for the Geo/PH/1 with discrete PH type vacations and also the M/PH/1 with PH vacations. This is an extension of the well known results by Ramaswami and Latouche [7] for a QBD with rank one matrix at the sub-diagonal.
Section snippets
The model
First we consider the discrete time MAP/PH/1 system with phase type vacation. Let the sub-stochastic matrices , of order represent the discrete-time arrival process where , represents transition probability from phase to phase with arrivals. The matrix is stochastic and irreducible. The service is discrete phase type with representation of order and the vacation duration is also discrete phase type with representation of order . Let
Matrix
It is known from [6] that the matrix which is the minimal non-negative matrix that satisfies the following equation It is the matrix that captures the probability of going down one level. Several queueing performance measures such as busy period are based on . We show that has a special structure that can be explored. Based on the structure of we see that the matrix is of the form where is an matrix and is an matrix.
Hence we have Proposition 3.1
Continuous-time MAP/PH/1 queue with vacations
Now we consider the continuous time MAP/PH/1 system with phase type vacation. Let the matrix sequence , of order represent the arrival process where , represents transition rate from phase to phase with arrivals. The matrix is a generator and irreducible. The service is continuous phase type with representation of order and the vacation duration is also continuous phase type with representation of order . Let and , where is a
Conclusions
The results presented in this paper are going to help us reduce the bulk of the computations regarding the and matrices from dealing with an matrix to mainly dealing with an matrix. Our focus in this paper is the exhaustive vacation type system. We plan to extend the idea to non-exhaustive type of vacation systems but would require some modifications first. Finally, the results developed can be easily extended to the case of discrete time GI/G/1 system in which both the
Acknowledgments
This research is partially supported by grants from the Natural Sciences and Engineering Research Council (NSERC) of Canada. The author acknowledges the anonymous referee and the Area Editor who provided some useful suggestions that helped to improve the presentation of the paper. The author also thanks Chamara Devanarayanan and Kamal Darchini for going through the final draft of this paper to check for typos and statements that need further clarifications.
References (7)
- et al.
A solution of the equation
Comm. ACM
(1972) Kronecker Products and Matrix Calculus: With Applications
(1981)A note on two matrices occurring in the solution of quasi-birth-and-death processes
Comm. Statis. Stochastic Models
(1987)
Cited by (7)
A queueing model with server breakdowns, repairs, vacations, and backup server
2020, Operations Research PerspectivesCitation Excerpt :Accordingly, we rearrange the entries of A0, A1, A2, and R. Note that the entries of A0 and A2 remain the same, while R and A1 are to be rearranged. Note: (a) It is worth pointing out that such a decomposition result for R has been reported in the past (see e.g., [1,3]). (b) In view of the decomposition result, the computation of R may be reduced to dealing with matrices of smaller dimension.
Impact of the degradation in service rate in MAP/PH/1 queueing system with phase type vacations, breakdowns, and repairs
2023, Annals of Operations ResearchAlgorithmic computation of MAP/PH/1 queue with finite system capacity and two-stage vacations
2020, Journal of Industrial and Management OptimizationThe analysis of a discrete time finite-buffer queue with working vacations under Markovian arrival process and PH-service time
2020, RAIRO - Operations ResearchQueueing systems with vacation: An overview
2016, International Journal of Mathematics in Operational ResearchApplied discrete-time queues, second edition
2015, Applied Discrete-Time Queues, Second Edition