Arrival curve
An arrival curve bounds the amount of traffic that can enter a system over every interval of a given duration.
Interval constraint: cumulative input A obeys A(t) - A(s) <= alpha(t-s) for every 0 <= s <= t. A token-bucket envelope is alpha(u) = b + r*u for u > 0, with alpha(0) = 0. A long-run mean alone supplies no finite burst allowance. [1]
Delay scope: an arrival envelope restricts offered work, not delivered service. A finite delay guarantee also requires a lower bound on service across the path. [2]
Relations
Citations
- Le Boudec and Thiran, Network Calculus, online edition 2022, sections 1.2-1.4
- Shenker, Partridge and Guerin, RFC 2212 (1997), Motivation and Network Element Data Handling
Sources & caveats
- Deterministic traffic constraint, not an empirical distribution or a fitted percentile. The same accounting unit must be used for traffic and service.