Comparison of the Discriminatory Processor Sharing Policies

TL;DR

This paper compares two Discriminatory Processor Sharing policies by analyzing how the expected sojourn time varies with different weight vectors, providing insights into optimizing system performance based on class means.

Contribution

It presents a comparison of DPS policies with different weight vectors and establishes monotonicity of expected sojourn time under certain conditions.

Findings

Expected sojourn time is monotonic with respect to weight vectors under specific conditions.

Classes with similar means can be combined to satisfy the conditions.

Results aid in optimizing DPS policies for diverse system classes.

Abstract

Discriminatory Processor Sharing policy introduced by Kleinrock is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the job priority is controlled by the vector of weights. Verifying the vector of weights it is possible to modify the service rates of the jobs and optimize system characteristics. In the present paper we present the results concerning the comparison of two DPS policies with different weight vectors. We show the monotonicity of the expected sojourn time of the system depending on the weight vector under certain condition on the system. Namely, the system has to consist of classes with means which are quite different from each other. The classes with similar means can be organized together and considered as one class, so the given restriction can be overcame.