Analytically simple and computationally efficient results for the GI^X/ Geo /c queues
Summary: A simple solution to determine the distributions of queue-lengths at different observation epochs for the model \(GI^X/ Geo /c\) is presented. In the past, various discrete-time queueing models, particularly the multiserver bulk-arrival queues, have been solved using complicated methods that lead to incomplete results. The purpose of this paper is to use the roots method to solve the model \(GI^X/ Geo /c\) that leads to a result that is analytically elegant and computationally efficient. This method works well even for the case when the inter-batch-arrival times follow heavy-tailed distributions. The roots of the underlying characteristic equation form the basis for all distributions of queue-lengths at different time epochs.
- 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\)
- 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
- A note on some relations in the queue GI^ X/M/c
- Analytic computation schemes for the discrete-time bulk service queue
- 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
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- Applying formal methods: testing, performance, and M/E-commerce. FORTE 2004 workshops the FormEMC, EPEW, ITM, Toledo, Spain, October 1--2, 2004. Proceedings
- Computing loss probabilities in discrete-time queues
- Delay and partial system contents for a discrete-time G-D-c queue
- Discrete-time heavy-tailed chains, and their properties in modeling network traffic
- Discrete-time multiserver queues with geometric service times.
- scientific article; zbMATH DE number 2088577 (Why is no real title available?)
- scientific article; zbMATH DE number 3858110 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 19235 (Why is no real title available?)
- scientific article; zbMATH DE number 1233828 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- scientific article; zbMATH DE number 3217462 (Why is no real title available?)
- Internet-type queues with power-tailed interarrival times and computational methods for their analysis
- Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(GI^{X}/geom/m\)
- Performance analysis of the discrete-time GI/Geom/1/N queue
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
- Robustness of Rootfinding in Single-Server Queueing Models
- The GI/Geom/N Queue In Discrete Time
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
- A new and pragmatic approach to the \(GI^X /Geo/c/N\) queues using roots
- An exact root-free method for the expected queue length for a class of discrete-time queueing systems
- 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 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
- 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\)
- A review of birth-death and other Markovian discrete-time queues
- On \textit{BASTA} for discrete-time queues
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)
