Generalisation of GPS and P-GPS in network calculus

Abstract

GPS is an ideal well known policy designed to share the capacity of a server between the input flows: each flow receives a fractional part, defined by the administrator, of the total server capacity1. It has several practical implementations, like P-GPS. These policies have been defined in the context of a constant-rate server. In this paper, a generalisation of GPS and P-GPS is proposed, in network calculus, to any kind of service. This generalisation offers a suitable framework to combine scheduling policies: for example, having a first level of static priority scheduling, and sharing the residual service with a P-GPS policy.