Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
From MaRDI portal
Publication:257076
DOI10.1007/s11134-015-9469-3zbMath1334.60193OpenAlexW2293152178MaRDI QIDQ257076
Mohan 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
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 (6)
Difference equations approach for multi-server queueing models with removable servers ⋮ Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ 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 ⋮ Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\) ⋮ A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation
- A note on some relations in the queue \(GI^ X/M/c\)
- Analysis of the \(GI^ X/M/c\) model
- Analytic computation schemes for the discrete-time bulk service queue
- An Introduction to Queueing Theory and Matrix-Analytic Methods
- 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
- Further Results for the Queueing System M x /M/c
- COUNTEREXAMPLES TO A CONJECTURE ON BOUNDS FOR THE LOSS PROBABILITY IN FINITE-BUFFER QUEUES
- 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
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