TY - JOUR
T1 - A reversible Erlang loss system with multi-type customers and multi-type servers
AU - Adan, I.J.B.F.
AU - Hurkens, C.A.J.
AU - Weiss, G.
PY - 2010
Y1 - 2010
N2 - We consider a memoryless loss system with servers S = {1,...,J}, and with customer
types C = {1,...I}. Servers are multi-type, 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.
AB - We consider a memoryless loss system with servers S = {1,...,J}, and with customer
types C = {1,...I}. Servers are multi-type, 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.
U2 - 10.1017/S0269964810000161
DO - 10.1017/S0269964810000161
M3 - Article
SN - 0269-9648
VL - 24
SP - 536
EP - 548
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 4
ER -