Analytically elegant and computationally efficient results in terms of roots for the GI^X/M/c queueing system
From MaRDI portal
Publication:257076
DOI10.1007/S11134-015-9469-3zbMATH Open1334.60193OpenAlexW2293152178MaRDI QIDQ257076FDOQ257076
Authors: M. L. Chaudhry, James J. Kim 
Publication date: 15 March 2016
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-015-9469-3
Recommendations
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots
- Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system
- Some numerical results for the queuing system \(GI^ X/M/1\)
- A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots
- A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B + b) Queues Using Roots
- Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
- Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods
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
- Analysis of the \(GI^ X/M/c\) model
- Analytic computation schemes for the discrete-time bulk service queue
- A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue
- An Introduction to Queueing Theory and Matrix-Analytic Methods
- Fundamentals of queueing theory
- Title not available (Why is that?)
- Some results of the queueing system Ekx/M/c
- Poisson Arrivals See Time Averages
- Robustness of Rootfinding in Single-Server Queueing Models
- Technical Note—Delays in Single-Server Queues with Batch Input
- Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation
- Further Results for the Queueing System M x /M/c
- Title not available (Why is that?)
- COUNTEREXAMPLES TO A CONJECTURE ON BOUNDS FOR THE LOSS PROBABILITY IN FINITE-BUFFER QUEUES
- Title not available (Why is that?)
- Blocking and Delays in M(x)/M/c Bulk Arrival Queueing Systems
- Analysis of finite-buffer multi-server queues with group arrivals: GI\(^{X}\)/M/\(c\)/N
- A note on some relations in the queue \(GI^ X/M/c\)
Cited In (13)
- Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\)
- On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots
- Analysis of the \(GI^ X/M/c\) model
- Analysis of a GI X /M/1 queue with two-stage vacation policy using shift operator method
- Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
- Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots
- 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\)
- Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods
- Difference equations approach for multi-server queueing models with removable servers
- 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
- An approximation of general multi-server queues with bulk arrivals and batch service
Uses Software
This page was built for publication: Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q257076)
