A Calculus for End-to-end Statistical Service Guarantees
<|reference_start|>A Calculus for End-to-end Statistical Service Guarantees: The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. This paper addresses the problem of extending the network calculus to a probabilistic framework with statistical service guarantees. Here, the key difficulty relates to expressing, in a statistical setting, an end-to-end (network) service curve as a concatenation of per-node service curves. The notion of an effective service curve is developed as a probabilistic bound on the service received by an individual flow. It is shown that per-node effective service curves can be concatenated to yield a network effective service curve.<|reference_end|>
@article{burchard2002a,
    title={A Calculus for End-to-end Statistical Service Guarantees},
    author={A. Burchard, J. Liebeherr, S. D. Patek},
    journal={IEEE Transactions on Information Theory 52:4105-4114 (2006)},
    year={2002},
    number={University of Virginia CS-2001-19 (2nd revised version)},
    archivePrefix={arXiv},
    eprint={cs/0205001},
    primaryClass={cs.NI}
}