Dynamic rate Erlang-A queues
From MaRDI portal
Publication:1992147
DOI10.1007/s11134-018-9581-2zbMath1408.60085OpenAlexW2802633867MaRDI QIDQ1992147
Jamol Pender, William A. Massey
Publication date: 2 November 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-018-9581-2
asymptoticsdynamical systemsmulti-server queuesHermite polynomialsskewnessfluid and diffusion limitstime-inhomogeneous Markov processesabandonmentcumulant momentstime-varying rates
Related Items (6)
Queues with Delayed Information: A Dynamical Systems Perspective ⋮ Modeling congestion considering sequential coupling applications: a network-cell-based method ⋮ Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments ⋮ Service staffing with delay probabilities ⋮ A broad view of queueing theory through one issue ⋮ New perspectives on the Erlang-A queue
Cites Work
- Unnamed Item
- Risk measures and their application to staffing nonstationary service systems
- Gaussian skewness approximation for dynamic rate multi-server queues with abandonment
- Correlation inequalities on some partially ordered sets
- Strong approximation for Markovian service networks
- Uniform acceleration expansions for Markov chains with time-varying rates
- An analysis of queues with delayed information and time-varying arrival rates
- Diffusion limits for the $(MAP_t / Ph_t / \infty)^N$ queueing network
- Stabilizing performance in a service system with time-varying arrivals and customer feedback
- A Poisson-Charlier approximation for nonstationary queues
- The truncated normal distribution: applications to queues with impatient customers
- Networks of infinite-server queues with nonstationary Poisson input
- A nonstationary offered-load model for packet networks
- On the \(M_t/M_t/K_t + M_t\) queue in heavy traffic
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- Sur une propriété de la loi de Gauss
- A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary M(t)/M/s(t) Queueing Systems with Exhaustive Discipline
- Gram Charlier Expansion for Time Varying Multiserver Queues with Abandonment
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- Asymptotic Analysis of the Time Dependent M/M/1 Queue
- Approximating nonstationary two-priority non-preemptive queueing systems
- A Closure Approximation for the Nonstationary M/M/s Queue
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- The Physics of the Mt/G/∞ Queue
- Heavy-traffic asymptotic expansions for the asymptotic decay rates in theBMAP/G/1 queue
- Server Staffing to Meet Time-Varying Demand
- A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals
- Optimal staffing in nonstationary service centers with constraints
- Many‐server loss models with non‐poisson time‐varying arrivals
- Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
- Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
- Queues Driven by Hawkes Processes
- Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
- Queues with Choice via Delay Differential Equations
- Mt/G/∞ Queues with Sinusoidal Arrival Rates
- STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES
- NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS
- STAFFING TO STABILIZE BLOCKING IN LOSS MODELS WITH TIME-VARYING ARRIVAL RATES
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
- APPROXIMATING AND STABILIZING DYNAMIC RATE JACKSON NETWORKS WITH ABANDONMENT
- Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks
This page was built for publication: Dynamic rate Erlang-A queues
