Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times

DOI10.1287/OPRE.43.5.885zbMATH Open0841.60076OpenAlexW2030465957MaRDI QIDQ4868809FDOQ4868809

Authors: Joseph Abate, Gagan L. Choudhury, Ward Whitt 

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

Recommendations

• Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
• Waiting-time tail probabilities in queues with long-tail service-time distributions
• Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals

zbMATH Keywords

batch Markovian arrival processexponential approximationsservice-time distributionssteady-state waiting timeheavy-traffic asymptotic expansionsmall-tail asymptotics

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (31)

• Bounds on queues with delayed generalized exponential arrivals
• Title not available (Why is that?)
• Uniform renewal theory with applications to expansions of random geometric sums
• On Approximations for Queues, I: Extremal Distributions
• On the transition from heavy traffic to heavy tails for the \(M/G/1\) queue: the regularly varying case
• Waiting-time tail probabilities in queues with long-tail service-time distributions
• Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
• Sampling at subexponential times, with queueing applications
• Tight bounds for the tail of the packet waiting time distribution in buffered networks
• Logarithmic asymptotics for the \(GI /G/1\)-type Markov chains and their applications to the \(BMAP /G/1\) queue with vacations
• Stationary tail probabilities in exponential server tandems with renewal arrivals
• Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
• Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
• High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
• A comparison of the sliding window and the leaky bucket
• On a class of approximations for ruin and waiting time probabilities
• Heavy-traffic extreme-value limits for queues
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
• Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals
• Compensating for dynamic supply disruptions: backup flexibility design
• Price, delivery time guarantees and capacity selection
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Ergodic theorems for queuing systems with dependent inter-arrival times
• Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
• ApproximatingM/G/1 Waiting Time Tail Probabilities
• Effective bandwidths for Markov regenerative sources
• Uniform approximations for the \(M/G/1\) queue with subexponential processing times
• Waiting-Time Percentiles in the Multi-server M^x/G/c Queue with Batch Arrivals
• Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion
• Class-specific quality of service guarantees in multimedia communication networks

This page was built for publication: Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868809)