Abstract
We consider a memoryless loss system with servers ${\cal S}$ = {1, …, J}, and with customer types ${\cal C}$ = {1, …, I}. Servers are multi-type: server j works at rate μj, and can serve a subset of customer types C(j). An arriving customer will go to the longest idling server which can serve him, or be lost. We obtain a simple explicit steady-state distribution for this system, and calculate various performance measures of this system in steady state. We provide some illustrative examples. We compare this system with a similar system discussed recently by Adan, Hurkens, and Weiss [1]. We also show that this system is insensitive, the results hold also for general service time distributions.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference7 articles.
1. A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
2. 3. Busic A. , Gupta V. , & Mairesse J. (2010). Stability of the bipartite matching model, Preprint, arxiv:1003.3477v1 [cs.DM].
3. 2. Adan I.J.B.F. & Weiss G. (2011). Exact FCFS matching rates for two infinite multi-type sequences. Operations Research to appear.
4. Fcfs infinite bipartite matching of servers and customers
5. An Ergodic Theorem for Markov Processes and Its Application to Telephone Systems with Refusals
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献