Resource allocation and admission control in static priority schedulers with statistical guarantees

In this paper, we propose an analytical method for the resource allocation and admission control of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Static Priority service discipline. We assume that at the network ingress each traffic flow is controlled by a Token Bucket, and the statistical QoS targets for each service class are expressed in terms of delay bound and delay violation probability. Under these assumptions, we solve analytically the resource allocation problem by deriving the closed-form expression of the minimum capacity to be allocated in the network in order to guarantee concurrently the QoS of all traffic flows. Moreover, we provide the solution of the admission control problem, by deriving the expression of the maximum number of flows that is possible to accept, in all priority levels, known the link capacity, with statistical QoS constraints on the delay.