Allocation and Admission Policies for Service Streams

TL;DR

This paper investigates dynamic server allocation and admission control policies in a service system to maximize revenue while meeting quality of service guarantees, supported by simulation results.

Contribution

It introduces and evaluates novel dynamic policies for server allocation and stream admission to optimize revenue under QoS constraints.

Findings

Dynamic policies improve revenue compared to static ones.

Simulation results demonstrate effectiveness of proposed policies.

QoS guarantees are maintained with optimized server allocation.

Abstract

A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the rate of their submission is specified. On the other hand, the provider promises a certain quality of service (QoS), measured by the average waiting time of the jobs in the stream. A penalty is paid if the agreed QoS requirement is not met. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and stream admission decisions are introduced and evaluated. The results of several simulations are described.