Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
DOI10.1080/15326349.2018.1425886zbMath1391.60224OpenAlexW2793420711MaRDI QIDQ4643638
Publication date: 28 May 2018
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: http://oasis.postech.ac.kr/handle/2014.oak/51055
asymptoticsheavy trafficfluid and diffusion limitsstrong approximationstime-varying ratesinfinite-server queuesuniform accelerationMarkovian arrival processes
Queueing theory (aspects of probability theory) (60K25) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (11)
Cites Work
- Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
- Heavy-traffic limits for many-server queues with service interruptions
- \(M/M/\infty\) queues in semi-Markovian random environment
- Strong approximation theorems for density dependent Markov chains
- Strong approximation for Markovian service networks
- Diffusion limits for the $(MAP_t / Ph_t / \infty)^N$ queueing network
- The truncated normal distribution: applications to queues with impatient customers
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- INFINITE-SERVER QUEUES WITH BATCH ARRIVALS AND DEPENDENT SERVICE TIMES
- Gram Charlier Expansion for Time Varying Multiserver Queues with Abandonment
- Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues
- A TIME-VARYING CALL CENTER DESIGN VIA LAGRANGIAN MECHANICS
- Further Results on Queues with Partial Correlation
- The M/M/∞ queue in a random environment
- Queues with Partial Correlation
- Optimal staffing in nonstationary service centers with constraints
- Network decomposition in the many-sources regime
- Output models of MAP/PH/1(/K) queues for an efficient network decomposition
- Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
- NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS
- APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
- Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
- Many-sources delay asymptotics with applications to priority queues
This page was built for publication: Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes