Computing waiting-time probabilities in the discrete-time queue: GIX/G/1
From MaRDI portal
Recommendations
- An analytic solution of the waiting time distribution for the discrete-time GI/G/1 queue
- Exact computational analysis of waiting-time distributions of single- server bulk-arrival queues: \(M^ X/G/1\)
- Analysis of the discrete-time \(GI/\text{Geom}(n)/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
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
Cited in
(6)- Strong stability of the batch arrival queueing systems
- Some results for the actual waiting time in batch arrival queueing systems
- A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
- scientific article; zbMATH DE number 866108 (Why is no real title available?)
- Computation of the tail probability for the waiting time in a discrete GI/G/1 queueing system
- A discrete-time queueing model of EMD policy in high-speed networks
This page was built for publication: Computing waiting-time probabilities in the discrete-time queue: GIX/G/1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779297)