Computational analysis of GI^[X]/D-MSP^(a,b)/1 queueing system via \textit{RG}-factorization
DOI10.1007/S00186-023-00816-1MaRDI QIDQ6046970FDOQ6046970
Authors: Kousik Das, S. K. Samanta
Publication date: 6 September 2023
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
queueingwaiting time distributiongeneral bulk service rulediscrete-time Markovian service processbatch renewalRG-factorization method
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system
- Analysis of the queue-length distribution for the discrete-time batch-service \(Geo/G^{a,Y}/1/k\) queue
- The censored Markov chain and the best augmentation
- Constructive computation in stochastic models with applications. The RG-factorization.
- 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
- Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism
- On the Stationary Distribution of theGIX/MY/1 Queueing System
- Equilibrium distribution of block-structured Markov chains with repeating rows
- Infinite block-structured transition matrices and their properties
- Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type
- A \(BMAP/G/1\) retrial queue with a server subject to breakdowns and repairs
- Some steady-state distributions for theMAP /SM /1 queue
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- On a BMAP/G/1 G-queue with setup times and multiple vacations
- Elucidating the short term loss behavior of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process
- A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance
- Modelling and analysis of \(GI/BMSP/1\) queueing system
Cited In (3)
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)