We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We consider a memoryless loss system with servers S = {1,…, J}, and with customer types 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 [2]. We also show that this system is insensitive, the results hold also for general processing time distributions.
Keywords: Service system; loss system; multi type customers; multi type servers; product form solution; go to longest waiting server policy; insensitivity
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.