Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy
Authors:
- A.I. ZeifmanAZA.I. Zeifman
- R.V. RazumchikRRR.V. Razumchik
- Y.A. SatinYSY.A. Satin
- I.A. KovalevIKI.A. Kovalev
- 1 April 2021
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 395
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Russian Science Foundation (19-11-00020)
This publication has 15 references indexed in Scilit:
- LB-networks: A model for dynamic load balancing in queueing networksPerformance Evaluation, 2017
- Truncation Bounds for Approximations of Inhomogeneous Continuous-Time Markov ChainsTheory of Probability & Its Applications, 2017
- Product-Forms in Multi-Way SynchronizationsThe Computer Journal, 2013
- A unifying approach to product-forms in networks with finite capacity constraintsACM SIGMETRICS Performance Evaluation Review, 2010
- Some universal limits for nonhomogeneous birth and death processesQueueing Systems, 2006
- Nonstationary Queues: Estimation of the Rate of ConvergenceQueueing Systems, 2004
- Turning back time in Markovian process algebraTheoretical Computer Science, 2003
- Multichannel queueing systems with ordered entry and finite sourceComputers & Operations Research, 1983
- Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic AnalysisMathematics of Operations Research, 1979
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968