A reversible erlang loss system with multitype customers and multitype servers

Ivo Adan; Cor Hurkens; Gideon Weiss

doi:10.1017/S0269964810000161

A reversible erlang loss system with multitype customers and multitype servers

Ivo Adan, Cor Hurkens, Gideon Weiss

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider a memoryless Erlang loss system with servers = {1, J}, and with customer types = {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.

Original language	English
Pages (from-to)	535-548
Number of pages	14
Journal	Probability in the Engineering and Informational Sciences
Volume	24
Issue number	4
DOIs	https://doi.org/10.1017/S0269964810000161
State	Published - Oct 2010

Bibliographical note

Funding Information:
The authors would like to thank Scott Provan for many stimulating discussions on this problem. The authors would like to thank Frank Kelly and Peter Whittle for discussions of insensitivity. Research by I. Adan was supported in part by the Netherlands Organization for Scientific Research (NWO). Research by G. Weiss was supported in part by Israel Science Foundation Grants 454/05 and 711/09; hospitality of the Newton Institute of Mathematical Sciences is gratefully acknowledged.

ASJC Scopus subject areas

Statistics and Probability
Statistics, Probability and Uncertainty
Management Science and Operations Research
Industrial and Manufacturing Engineering

Access to Document

10.1017/S0269964810000161

Cite this

@article{6c69c1a1367440a89ff311cf1d96d857,

title = "A reversible erlang loss system with multitype customers and multitype servers",

abstract = "We consider a memoryless Erlang loss system with servers = {1, J}, and with customer types = {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.",

author = "Ivo Adan and Cor Hurkens and Gideon Weiss",

note = "Funding Information: The authors would like to thank Scott Provan for many stimulating discussions on this problem. The authors would like to thank Frank Kelly and Peter Whittle for discussions of insensitivity. Research by I. Adan was supported in part by the Netherlands Organization for Scientific Research (NWO). Research by G. Weiss was supported in part by Israel Science Foundation Grants 454/05 and 711/09; hospitality of the Newton Institute of Mathematical Sciences is gratefully acknowledged.",

year = "2010",

month = oct,

doi = "10.1017/S0269964810000161",

language = "English",

volume = "24",

pages = "535--548",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - A reversible erlang loss system with multitype customers and multitype servers

AU - Adan, Ivo

AU - Hurkens, Cor

AU - Weiss, Gideon

N1 - Funding Information: The authors would like to thank Scott Provan for many stimulating discussions on this problem. The authors would like to thank Frank Kelly and Peter Whittle for discussions of insensitivity. Research by I. Adan was supported in part by the Netherlands Organization for Scientific Research (NWO). Research by G. Weiss was supported in part by Israel Science Foundation Grants 454/05 and 711/09; hospitality of the Newton Institute of Mathematical Sciences is gratefully acknowledged.

PY - 2010/10

Y1 - 2010/10

N2 - We consider a memoryless Erlang loss system with servers = {1, J}, and with customer types = {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.

AB - We consider a memoryless Erlang loss system with servers = {1, J}, and with customer types = {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.

UR - http://www.scopus.com/inward/record.url?scp=78650293630&partnerID=8YFLogxK

U2 - 10.1017/S0269964810000161

DO - 10.1017/S0269964810000161

M3 - Article

AN - SCOPUS:78650293630

SN - 0269-9648

VL - 24

SP - 535

EP - 548

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 4

ER -

A reversible erlang loss system with multitype customers and multitype servers

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this