Networks of queues models with several classes of customers and exponential service times
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...
| Main Author: | |
|---|---|
| Format: | article |
| Language: | eng |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10071/8905 |
| Country: | Portugal |
| Oai: | oai:repositorio.iscte-iul.pt:10071/8905 |
| Summary: | 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. |
|---|