Optimal probabilistic allocation of customer types to servers
Author:
Open Access
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 23 (1) , 116-125
Abstract
The model under consideration consists of n customer types attended by m parallel non-identical servers. Customers are allocated to the servers in a probabilistic manner; upon arrival customers are sent to one of the servers according to an m × n matrix of routing probabilities. We consider the problem of finding an allocation that minimizes a weighted sum of the mean waiting times. We expose the structure of an optimal allocation and describe for some special cases in detail how the structure may be exploited in actually determining an optimal allocation.Keywords
This publication has 5 references indexed in Scilit:
- Design of manufacturing systems using queueing modelsQueueing Systems, 1992
- A vertex-allocation theorem for resources in queuing networksJournal of the ACM, 1988
- Optimal static load balancing in distributed computer systemsJournal of the ACM, 1985
- Load Sharing in Distributed SystemsIEEE Transactions on Computers, 1985
- On optimal right-of-way policies at a single-server station when insertion of idle times is permittedStochastic Processes and their Applications, 1977