Numerically efficient probabilistic guarantees for resource reservations

This paper presents an efficient algorithm for providing probabilistic guarantees in soft real-time systems using resource reservations. We use a conservative model for the temporal evolution of a resource reservation, which has a particular structure - a quasi birth death process - enabling an efficient computation of the stationary probability of respecting deadlines. We show the accuracy and the efficiency of the method in a large set of experiments.