Idle period approximations and bounds for the GI/G/1 queue
From MaRDI portal
Publication:4467511
DOI10.1239/aap/1059486828zbMath1046.60090MaRDI QIDQ4467511
Publication date: 10 June 2004
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1059486828
60K25: Queueing theory (aspects of probability theory)
Related Items
SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION, Preservation of generalized ageing classes on the residual life at random time, Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems, Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times, Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue, A semidefinite optimization approach to the steady-state analysis of queueing systems
Cites Work
- A Light Traffic Approximation for a Single-Server Queue
- An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue
- Inequalities for moments of tails of random variables, with a queueing application
- Some Inequalities in Queuing
- Some inequalities for the queue GI/G/1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item