A Calculus for End-to-end Statistical Service Guarantees

Jorg Liebeherr, Stephen Patek & Almut Burchard
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. A drawback of the deterministic network calculus is that it only provides worst-case bounds. Here we present a network calculus for statistical service guarantees, which can exploit the statistical multiplexing gain of sources. We introduce the notion of an effective service curve as a probabilistic bound on the service received by...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.