Analytically simple and computationally efficient solution to \mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1 queues involving heavy-tailed distributions
From MaRDI portal
Publication:1755840
Recommendations
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
- 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
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
Cites work
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- Internet-type queues with power-tailed interarrival times and computational methods for their analysis
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
Cited in
(5)- 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
- Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
This page was built for publication: Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755840)
