Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
DOI10.3934/jimo.2019123zbMath1474.60217OpenAlexW2981906006MaRDI QIDQ2031356
Rakesh Nandi, Sujit Kumar Samanta
Publication date: 9 June 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019123
queueingcensored Markov chaindiscrete-time Markovian service processgeneral independent batch arrivalToeplitz-type block-structured Markov chainUL-type \(RG \)-factorization
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
- 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
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
- A short note on the \(GI/Geo/1\) queueing system
- Performance analysis of MAP/G/1 queue with working vacations and vacation interruption
- Loss pattern of \(\mathrm{DBMAP}/\mathrm{DMSP}/1/K\) queue and its application in wireless local communications
- Performance analysis of a block-structured discrete-time retrial queue with state-dependent arrivals
- Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
- On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
- Analysis of a batch service multi-server polling system with dynamic service control
- The stationary characteristics of the G/MSP/\(1/r\) queueing system
- A \(MAP/G/1\) queue with negative customers
- On symbolic RG factorization of quasi-birth-and-death processes
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
- Sojourn-time distribution of the \(G I/M S P/1\) queueing system
- A discrete-time \(Geo^{[x}/g/1\) retrial queue with control of admission]
- A \(BMAP/G/1\) retrial queue with a server subject to breakdowns and repairs
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
- Analysis of Queues with Markovian Service Processes
- Equilibrium distribution of block-structured Markov chains with repeating rows
- Applied Discrete-Time Queues
- Constructive Computation in Stochastic Models with Applications
- Analyzing discrete-time bulk-serviceGeo/Geob/mqueue
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Infinite block-structured transition matrices and their properties
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Some steady-state distributions for theMAP /SM /1 queue
- The censored Markov chain and the best augmentation
- Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type
- Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process
This page was built for publication: Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
