Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times
From MaRDI portal
Publication:1945562
DOI10.1007/s10479-011-0946-8zbMath1260.90066OpenAlexW2005880443MaRDI QIDQ1945562
Dieter Fiems, Koen De Turck, Balakrishna J. Prabhu
Publication date: 8 April 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0946-8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Power series approximations for two-class generalized processor sharing systems
- The discrete-time queue with autoregressive inputs revisited
- The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
- On the exact analysis of a discrete-time queueing system with autoregressive inputs
- Performance analysis of the \(DAR(1)/D/c\) priority queue under partial buffer sharing policy
- Regularly varying tails in a queue with discrete autoregressive arrivals of order \(p\)
- Fluid and diffusion limits for queues in slowly changing environments
- Tail behavior of the queue size and waiting time in a queue with discrete autoregressive arrivals
- Markov Chains and Stochastic Stability
- Power Series for Stationary Distributions of Coupled Processor Models
- The MacLaurin series for the GI/G/1 queue
- The Power-Series Algorithm for Polling Systems with Time Limits
- Taylor series expansions for stationary Markov chains
- Perturbation analysis for denumerable Markov chains with application to queueing models
- PERFORMANCE ANALYSIS OF THE RANDOM EARLY DETECTION ALGORITHM
- The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1
- Discrete-Time Markov Chains
- Perturbation theory and finite Markov chains
- Aggregation of Variables in Dynamic Systems
- The Power-Series Algorithm Applied to the Shortest-Queue Model
