Ergodic theorems for queuing systems with dependent inter-arrival times
From MaRDI portal
Publication:2060348
DOI10.1016/j.orl.2021.07.006OpenAlexW3185434601WikidataQ113867744 ScholiaQ113867744MaRDI QIDQ2060348
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.01475
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Large deviations for some weakly dependent random processes
- Large deviations asymptotics and the spectral theory of multiplicatively regular Markov proces\-ses
- A theorem about probabilities of large deviations with an application to queuing theory
- A Class of Data Traffic Processes-Covariance Function Characterization and Related Queuing Results
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
- Queueing for ergodic arrivals and services
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
- Improvements of Plachky--Steinebach Theorem
- Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues
- State Constraints in Convex Control Problems of Bolza
This page was built for publication: Ergodic theorems for queuing systems with dependent inter-arrival times