Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
From MaRDI portal
Publication:1755840
DOI10.1016/J.ORL.2016.07.012zbMath1408.90060OpenAlexW2496921615MaRDI QIDQ1755840
James J. Kim, Mohan L. Chaudhry
Publication date: 11 January 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.07.012
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
Cites Work
- Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
- Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis
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
