A reversible Erlang loss system with multitype customers and multitype servers
| Authors |
|
|---|---|
| Publication date | 2010 |
| Journal | Probability in the Engineering and Informational Sciences |
| Volume | Issue number | 24 | 4 |
| Pages (from-to) | 536-548 |
| Organisations |
|
| Abstract | We consider a memoryless Erlang loss system with servers S = {1, …, J}, and with customer types C = {1, …, I}. Servers are multitype, so that server j can serve a subset of customer types C(j). We show that the probabilities of assigning arriving customers to idle servers can be chosen in such a way that the Markov process describing the system is reversible, with a simple product form stationary distribution. Furthermore, the system is insensitive; these properties are preserved for general service time distributions. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1017/S0269964810000161 |
| Downloads |
342843.pdf
(Final published version)
|
| Permalink to this page | |