Networks of Queues Models with Several Classes of Customers and Exponential Service Times
arXiv:2110.08603 · doi:10.12988/ams.2015.53287
Abstract
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open networks of queues with several classes of customers and exponential service times, allowing to overcome ingeniously this problem. The situation for closed networks, in the same conditions, much easier is also presented.
7 pages
References in corpus (3)
- Studying Pensions Funds Through an Infinite Servers Nodes Network: A Theoretical Problem
- Modelling and Differential Costs Evaluation of a Two Echelons Repair System through Infinite Servers Nodes Queuing Networks
- Stochastic Processes in Networks of Queues with Exponential Service Times and only one Class of Customers