Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy
From MaRDI portal
Publication:2663805
DOI10.1016/j.amc.2020.125846OpenAlexW3111542829MaRDI QIDQ2663805
I. A. Kovalev, Alexander I. Zejfman, Ya. A. Satin, Rostislav Razumchik
Publication date: 20 April 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.15833
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Limiting characteristics of queueing systems with vanishing perturbations ⋮ Bounds on the rate of convergence for Markovian queuing models with catastrophes
Uses Software
Cites Work
- Unnamed Item
- Nonstationary queues: estimation of the rate of convergence
- Turning back time in Markovian process algebra.
- Bounds on the rate of convergence for one class of inhomogeneous Markovian queueing models with possible batch arrivals and services
- On three methods for bounding the rate of convergence for some continuous-time Markov chains
- Some universal limits for nonhomogeneous birth and death processes
- Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
- Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals
- Time-Varying Robust Queueing
- Truncation Bounds for Approximations of Inhomogeneous Continuous-Time Markov Chains
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy