A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: GI/C-MSP^a,b/1/
batch service queuecontinuous-time Markovian service processgeneral bulk service rulegeneral independent arrivalinfinite buffer
Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)
The paper investigates \(\mathrm{GI}/\mathrm{C-MSP}^{(a,b)}/1/\infty \) queues. In such queues, customers are served by a single server in batches of maximum size \(b\) with a minimum threshold size \(a\). From the introduction: ``We carry out the analytic analysis through the calculation of roots of the denominator of the underlying generating function for the steady state probabilities of the embedded Markov chain after a particular threshold level for infinite state space. The roots can be easily found using one of the several commercially available packages. The purpose of studying this queueing model using roots is that we obtain computationally simple and analytically closed form solution to the infinite buffer \(\mathrm{GI}/\mathrm{C-MSP}^{(a,b)}/1\) queue. Secondly, we obtain several other quantitative measures such as queue-length distributions, evaluation of expected busy and idle period. Further, we provide a comparison between the computational complexities of the roots method and matrix-geometric method. Also, we have established heavy- and light-traffic approximations as well as approximation for the tail probabilities at the pre-arrival epoch based on the root of the characteristic equation.
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- Analytically explicit results for the GI/C-MSP/1/ queueing system using roots
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- A fast Newton's iteration for M/G/1-type and GI/M/1-type Markov chains
- A first course in stochastic models.
- A simple and complete computational analysis of MAP/R/1 queue using roots
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A versatile Markovian point process
- 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 finite MAP/\(G\)/1 queue with group services
- Analysis of the MAP/G\(^{a,b}\)/1/N queue
- Analytically explicit results for the GI/C-MSP/1/ queueing system using roots
- Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues
- Arrival and departure state distributions in the general bulk-service queue
- Characterizations of generalized hyperexponential distribution functions
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
- Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP(a,b)/1/N
- Frontiers in queueing: models and applications in science and engineering
- G/M^<a, b>/1 QUEUES WITH SERVER VACATIONS
- scientific article; zbMATH DE number 3987351 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 35509 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Markov-modulated processes and semigenerative phenomena
- Modelling and analysis of \(M/G^{a,b}/1/N\) queue -- A simple alternative approach
- Moment formulas for the Markov renewal branching process
- New results on the single server queue with a batch markovian arrival process
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
- On lattice reduction for polynomial matrices
- On the discrete‐time queue length distribution under markov‐dependent phases
- On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b]}/1/N\)
- Performance analysis of a batch service queue arising out of manufacturing system modelling
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Robustness of Rootfinding in Single-Server Queueing Models
- Some steady-state distributions for theMAP /SM /1 queue
- Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
- The stationary characteristics of the G/MSP/\(1/r\) queueing system
- Stationary analysis and optimal control under multiple working vacation policy in a \(\mathrm{GI/M}^{(a,b)}/1\) queue
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- 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
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- A discrete-time \(GI^X/Geo/1\) queue with multiple working vacations under late and early arrival system
- On the optimal control of loss probability and profit in a GI /C-BMSP /1/N queueing system
- A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
- Analytically explicit results for the GI/C-MSP/1/ queueing system using roots
- Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system
- A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B + b) Queues Using Roots
This page was built for publication: A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826663)
