Computational analysis of GI^[X]/D-MSP^(a,b)/1 queueing system via \textit{RG}-factorization
The paper under review studies a single server queueing system with batch arrivals and batch services. The number of waiting places is infinite. The times between arrivals are generally distributed. Customers are served due to the discrete time Markovian process in accordance with general bulk service rule. The paper derives vector valued state probabilities immediately before arrival of a batch of customers. For this purpose, the paper uses UL-type RG-factorization method based on censoring technique. The random epoch probability vectors are then obtained by using the Markov renewal theory on the basis of the earlier obtained vector of the state probabilities before arrival of a batch of customers. The paper also derives simple expressions for the outside observer's, intermediate, and post-departure epochs probability vectors by evolving the relationships among them. Numerical results of the paper have been discussed.
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Detailed analytical and computational studies of D-BMAP/D-BMSP1 queueing system
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Modelling and analysis of GI/BMSP/1 queueing system
- A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X]}/ \text{C-MSP} / 1\) queueing system
- A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
- A \(BMAP/G/1\) retrial queue with a server subject to breakdowns and repairs
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
- Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance
- Analysis of the queue-length distribution for the discrete-time batch-service \(Geo/G^{a,Y}/1/k\) queue
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Constructive computation in stochastic models with applications. The RG-factorization.
- Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process
- Equilibrium distribution of block-structured Markov chains with repeating rows
- Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- Infinite block-structured transition matrices and their properties
- Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type
- Modelling and analysis of GI/BMSP/1 queueing system
- On a BMAP/G/1 G-queue with setup times and multiple vacations
- On the Stationary Distribution of theGIX/MY/1 Queueing System
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Some steady-state distributions for theMAP /SM /1 queue
- Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism
- The censored Markov chain and the best augmentation
This page was built for publication: Computational analysis of \(GI^{[X]}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046970)
