Heavy-traffic limits for nearly deterministic queues

DOI10.1239/JAP/1316796905MaRDI QIDQ3094683zbMATH OpenOpenAlexFDO

Authors Karl Sigman, Ward Whitt

Publication date 25 October 2011

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/jap/1316796905

zbMATH Keywords

cyclic thinningdeterministic service timeErlang queuefunctional central limit theoremGaussian random walkheavy trafficinvariance principlemany-server queuenearly deterministic queueunusual scaling

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Heavy-traffic limits for nearly deterministic queues: Stationary distributions
• Heavy traffic limits for queues with many deterministic servers
• Heavy-traffic limits for queues with periodic arrival processes
• Large fork-join queues with nearly deterministic arrival and service times
• Heavy-traffic limits for a single-server queue leading up to a critical point

Cites work

• A new view of the heavy-traffic limit theorem for infinite-server queues
• Applied Probability and Queues
• Heavy traffic limits for queues with many deterministic servers
• Heavy-traffic limits for nearly deterministic queues: Stationary distributions
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• scientific article; zbMATH DE number 3866333 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 805121 (Why is no real title available?)
• scientific article; zbMATH DE number 6318798 (Why is no real title available?)
• scientific article; zbMATH DE number 3185400 (Why is no real title available?)
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• Stochastic-Process Limits
• The Joint Effect of Leadtime Variance and Lot Size in a Parallel Processing Environment

Cited in

(19)

• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Dominant poles and tail asymptotics in the critical Gaussian many-sources regime
• Heavy-traffic limits for queues with periodic arrival processes
• Heavy traffic limits for queues with many deterministic servers
• An alternative approach to heavy-traffic limits for finite-pool queues
• Robust heavy-traffic approximations for service systems facing overdispersed demand
• Many-server heavy-traffic limit for queues with time-varying parameters
• scientific article; zbMATH DE number 4042954 (Why is no real title available?)
• Heavy traffic limit theorems for a queueing system in which customers join the shortest line
• Heavy Traffic Limit Theorems for Queues: A Survey
• scientific article; zbMATH DE number 1069527 (Why is no real title available?)
• scientific article; zbMATH DE number 2038749 (Why is no real title available?)
• Beyond Heavy-Traffic Regimes: Universal Bounds and Controls for the Single-Server Queue
• Large fork-join queues with nearly deterministic arrival and service times
• scientific article; zbMATH DE number 6318798 (Why is no real title available?)
• Novel heavy-traffic regimes for large-scale service systems
• Heavy-traffic single-server queues and the transform method
• Heavy-traffic limits for nearly deterministic queues: Stationary distributions
• Heavy traffic limit for a tandem queue with identical service times

This page was built for publication: Heavy-traffic limits for nearly deterministic queues

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