Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy.
Alexander I. ZeifmanRostislav V. RazumchikYacov SatinI. A. KovalevPublished in: Appl. Math. Comput. (2021)
Keyphrases
- queue length
- arrival processes
- state dependent
- service times
- single server
- steady state
- stationary distribution
- arrival rate
- asymptotically optimal
- markov chain
- service rates
- queueing theory
- queueing networks
- poisson arrivals
- optimal policy
- service requirements
- upper bound
- priority scheduling
- queueing model
- hazard rate
- fluid model
- lower bound
- queueing systems
- single server queue
- arrival process
- loss probability
- finite buffer
- waiting times
- queue size
- special case
- optimal solution
- lower and upper bounds
- dynamic programming
- markovian arrival process