A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals

DOI10.1007/978-3-319-43904-4_18zbMath1390.68148OpenAlexW2493832258MaRDI QIDQ4571094

Tuan Phung-Duc, Jamol Pender

Publication date: 6 July 2018

Published in: Analytical and Stochastic Modelling Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-43904-4_18

zbMATH Keywords

setup timeabandonmentpower-saving

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Customer-Server Population Dynamics in Heavy Traffic, Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT, Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System, On the modelling and performance measurement of service networks with heterogeneous customers, Dynamic rate Erlang-A queues, New perspectives on the Erlang-A queue, On the distributions of infinite server queues with batch arrivals

Cites Work

• Unnamed Item
• Unnamed Item
• Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
• Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
• Strong approximation theorems for density dependent Markov chains
• Strong approximation for Markovian service networks
• A Poisson-Charlier approximation for nonstationary queues
• Analysis of a multiserver queue with setup times
• Gram Charlier Expansion for Time Varying Multiserver Queues with Abandonment
• Foundations of Modern Probability
• Optimal staffing in nonstationary service centers with constraints
• Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
• NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS