Computer Science – Networking and Internet Architecture
Scientific paper
2002-05-02
IEEE Transactions on Information Theory 52:4105-4114 (2006)
Computer Science
Networking and Internet Architecture
21 pages, 2 figures. Revisions in Theorem 5 and Section 4
Scientific paper
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.
Burchard Almut
Liebeherr Jörg
Patek S. D.
No associations
LandOfFree
A Calculus for End-to-end Statistical Service Guarantees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Calculus for End-to-end Statistical Service Guarantees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Calculus for End-to-end Statistical Service Guarantees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-232455