Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
From MaRDI portal
Publication:4868809
DOI10.1287/opre.43.5.885zbMath0841.60076OpenAlexW2030465957MaRDI QIDQ4868809
Joseph Abate, Ward Whitt, Gagan L. Choudhury
Publication date: 29 April 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.5.885
batch Markovian arrival processexponential approximationsservice-time distributionssteady-state waiting timesmall-tail asymptoticsheavy-traffic asymptotic expansion
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (24)
High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs ⋮ ApproximatingM/G/1 Waiting Time Tail Probabilities ⋮ Waiting-time tail probabilities in queues with long-tail service-time distributions ⋮ A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues ⋮ SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Effective bandwidths for Markov regenerative sources ⋮ Stochastic bounds in Fork-Join queueing systems under full and partial mapping ⋮ A comparison of the sliding window and the leaky bucket ⋮ Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate ⋮ Heavy-traffic extreme-value limits for queues ⋮ Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion ⋮ Unnamed Item ⋮ On the transition from heavy traffic to heavy tails for the \(M/G/1\) queue: the regularly varying case ⋮ Tight bounds for the tail of the packet waiting time distribution in buffered networks ⋮ Compensating for Dynamic Supply Disruptions: Backup Flexibility Design ⋮ Uniform approximations for the \(M/G/1\) queue with subexponential processing times ⋮ Manufacturing lead-time rules: customer retention versus tardiness costs ⋮ Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance ⋮ Uniform renewal theory with applications to expansions of random geometric sums ⋮ On a class of approximations for ruin and waiting time probabilities ⋮ Ergodic theorems for queuing systems with dependent inter-arrival times ⋮ Class-specific quality of service guarantees in multimedia communication networks ⋮ Price, delivery time guarantees and capacity selection ⋮ Sampling at subexponential times, with queueing applications
This page was built for publication: Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
