Analytically simple and computationally efficient results for the GI^X/ Geo /c queues
From MaRDI portal
Publication:2175386
DOI10.1155/2019/6480139zbMATH Open1437.90046OpenAlexW2971459170MaRDI QIDQ2175386FDOQ2175386
Authors: M. L. Chaudhry, James J. Kim, A. D. Banik 
Publication date: 29 April 2020
Published in: Journal of Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/6480139
Recommendations
- A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
- Computational analysis of single-server bulk-arrival queues: GI X/M/1
- 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\)
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- 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
- Robustness of Rootfinding in Single-Server Queueing Models
- Title not available (Why is that?)
- A note on some relations in the queue \(GI^ X/M/c\)
- Title not available (Why is that?)
- Performance analysis of the discrete-time GI/Geom/1/N queue
- Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(GI^{X}/geom/m\)
- Discrete-time multiserver queues with geometric service times.
- Delay and partial system contents for a discrete-time G-D-c queue
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
- Title not available (Why is that?)
- Internet-type queues with power-tailed interarrival times and computational methods for their analysis
- Computing loss probabilities in discrete-time queues
- The GI/Geom/N Queue In Discrete Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- Title not available (Why is that?)
- Applying formal methods: testing, performance, and M/E-commerce. FORTE 2004 workshops the FormEMC, EPEW, ITM, Toledo, Spain, October 1--2, 2004. Proceedings
- Discrete-time heavy-tailed chains, and their properties in modeling network traffic
Cited In (4)
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Analytic computation schemes for the discrete-time bulk service queue
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- A review of birth-death and other Markovian discrete-time queues
Uses Software
This page was built for publication: Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175386)
