An adaptive rate processor sharing technique

An alternative approach for the common problem of computing the weights of a General Processor Sharing (GPS) server is presented. The Rate Processor Sharing (RPS) algorithm of Kumaran and Whiting, which is based on GPS, is modified in order to remove some of its drawbacks: difficulty in setting its parameters, instability, and a lack of rate adaptivity as the queue state changes. The technique proposed in this paper calculates the basic RPS parameters in an efficient manner so that this scheme take into consideration the time-varying nature of the channel and also be rate adaptive. The main idea combines elements from the Latency-Rate server theory of Stiliadis and Varma and the Powered Earliest Deadline First algorithm of Varsou et al., and can be considered as a GPS extension of the latter.