Heavy-traffic limits for a single-server queue leading up to a critical point
DOI10.1016/J.ORL.2016.10.005zbMATH Open1408.90101OpenAlexW2537727965WikidataQ57404045 ScholiaQ57404045MaRDI QIDQ1709969FDOQ1709969
Authors: Ward Whitt
Publication date: 15 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.10.005
Recommendations
- Heavy-traffic limits for queues with periodic arrival processes
- On many-server queues in heavy traffic
- Heavy traffic approximations of a queue with varying service rates and general arrivals
- Light traffic approximations in general stationary single-server queues
- The fluid limit of a heavily loaded processor sharing queue
nonstationary queuesheavy-traffic limitsqueues with time-varying arrival ratesonset of critical loadingrush hourtransition through saturation
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Stochastic-Process Limits
- Multiple channel queues in heavy traffic. I
- Title not available (Why is that?)
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Time-Dependent Queues
- A queueing model with independent arrivals, and its fluid and diffusion limits
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Many-server heavy-traffic limit for queues with time-varying parameters
- Mt/G/∞ Queues with Sinusoidal Arrival Rates
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- Strong Approximations for Time-Dependent Queues
- Asymptotic Analysis of the Time Dependent M/M/1 Queue
- Heavy-traffic limits for queues with periodic arrival processes
- Queues with time-dependent arrival rates I—the transition through saturation
- Unstable Asymptotics for Nonstationary Queues
- Planning Queueing Simulations
- Transforming renewal processes for simulation of nonstationary arrival processes
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
- Queues with time-dependent arrival rates. II — The maximum queue and the return to equilibrium
- Queues with time-dependent arrival rates. III — A mild rush hour
Cited In (16)
- Heavy-traffic limits for nearly deterministic queues
- Heavy traffic limits for queues with non-stationary path-dependent arrival processes
- Heavy traffic limit for a tandem queue with identical service times
- Beyond Heavy-Traffic Regimes: Universal Bounds and Controls for the Single-Server Queue
- Extreme and high-level sojourns of the single server queue in heavy traffic
- Heavy-traffic limits for loss proportions in single-server queues
- Strong embeddings for transitory queueing models
- Finite-pool queueing with heavy-tailed services
- Time-varying robust queueing
- Subdiffusive load balancing in time-varying queueing systems
- Heavy traffic limit for the workload plateau process in a tandem queue with identical service times
- Single-server queues under overdispersion in the heavy-traffic regime
- Heavy-traffic limits for parallel single-server queues with randomly split Hawkes arrival processes
- Heavy-traffic limits for server idle times with customary server-assignment rules
- Title not available (Why is that?)
- Many-server heavy-traffic limit for queues with time-varying parameters
This page was built for publication: Heavy-traffic limits for a single-server queue leading up to a critical point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709969)