2010
DOI: 10.1017/s0269964810000161
|View full text |Cite
|
Sign up to set email alerts
|

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 distrib… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
13
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 45 publications
(14 citation statements)
references
References 15 publications
1
13
0
Order By: Relevance
“…Two motivating precursors to these papers were the paper of Talreja and Whitt [34], which introduced FCFS skill based routing in an overloaded system with abandonments, and a paper of Caldentey, Kaplan and Weiss [18], which introduced the infinite matching model. Product form results for skill based routing in a loss system were obtained in [3,4].…”
Section: Background and Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…Two motivating precursors to these papers were the paper of Talreja and Whitt [34], which introduced FCFS skill based routing in an overloaded system with abandonments, and a paper of Caldentey, Kaplan and Weiss [18], which introduced the infinite matching model. Product form results for skill based routing in a loss system were obtained in [3,4].…”
Section: Background and Motivationmentioning
confidence: 99%
“…The proof of Theorem 2.2 is given in Appendix A.2, and it is based on the proof of a similar result for a skill based service Erlang loss system [3,5].…”
Section: 3mentioning
confidence: 99%
“…In [2] the same loss system is considered under a different regime. Instead of choosing the longest idle server, an arriving customer of type i which finds a set of idle servers S will choose server j ∈ S with probability P (i, j|S).…”
Section: Comparison With a Random Assignment Modelmentioning
confidence: 99%
“…This is different from our ALIS (assign to longest idle server) regime in two ways: first, the assignment does not depend on the order in which idle servers became available, and second, the assignment is random. Because only the set of idle servers is of interest in the system of [2], it can be described by a CTMC Y (t) with state given by the set of idle servers S. It is shown in [2] that one can choose the assignment probabilities P (i, j|S) so as to make Y (t) reversible, in which case its steady state distribution is for every subset S = {j 1 , . .…”
Section: Comparison With a Random Assignment Modelmentioning
confidence: 99%
See 1 more Smart Citation