Leftover service curve
A leftover service curve lower-bounds the service available to a selected flow after accounting for competing traffic.
Blind multiplexing: strict aggregate beta and cross-traffic envelope alpha2 yield the ordinary residual curve max(0,beta-alpha2) when that curve is nondecreasing. This accounts for bursts, not just average utilization. [1]
For strict beta(u)=R*max(0,u-T), alpha2(u)=b2+r2*u for u>0 and r2<R, the residual rate is R-r2 and latency is (R*T+b2)/(R-r2). A target envelope with rate at most R-r2 then admits finite backlog and virtual-delay bounds. [1]
The general arbitrary-multiplexing construction uses the nondecreasing upper closure of beta-alpha2. [3] A residual ordinary curve is not automatically strict; serial composition and subtraction must retain their respective hypotheses. [2]
Relations
Citations
- Le Boudec and Thiran. Network Calculus, 2022 online edition, Definition 1.3.2 and Theorem 6.2.1.
- Hamscher, Constantin and Schmitt. Extending Network Calculus To Deal With Partially Negative And Decreasing Service Curves (2024), sections I-II.
- Pesotsky, Hermsen and Bondorf. Automated and Precise Deterministic NetCal Calculations from Models to Bounds. ECRTS 2026, Theorem 10.
Further reading
Sources & caveats
- Published theory and a linked exact hypothetical calculation, not a storage-device benchmark. Individual delay needs a within-flow ordering guarantee.