Author(s): Palmer J, Mitrani I, Mazzucco M, McKee P, Fisher M
Abstract: We consider the problem of how best to structure and control a distributed computer system containing many processors, subject to Quality of Service contracts. Services of different types are offered, with different charges for running jobs and penalties for failing to meet the QoS requirements. The aim is to choose the number of servers allocated to each service type, and the admission criteria for jobs of that type, so as to maximize the total average revenue per unit time. For a given set of parameters, it is shown how to compute the optimal server allocation and the associated admission policy. The performance of a fast allocation heuristic is also evaluated.
Keywords: Quality of service, Revenue maximization, Server allocation, Admission policies, M/M/N/K queue.