Operators
| Symbol | Definition | Name |
|---|
| f⊗g | inf0≤s≤t{f(t−s)+g(s)} | Min-plus convolution |
| f⊘g | supu≥0{f(t+u)−g(u)} | Min-plus deconvolution |
| f | infn≥0f(n) | Sub-additive closure |
| h(α,β) | sups≥0inf{τ≥0:α(s)≤β(s+τ)} | Horizontal deviation |
| v(α,β) | sups≥0{α(s)−β(s)} | Vertical deviation |
Standard curves
| Symbol | Definition | Use |
|---|
| γr,b(t) | b+rt for t>0, 0 at t=0 | Token-bucket arrival curve |
| λC(t) | Ct | Peak rate / constant-rate link |
| βR,T(t) | R[t−T]+ | Rate-latency service curve |
| δT(t) | 0 for t≤T, +∞ otherwise | Pure delay |
| L⌈(t+J)/P⌉ | Staircase | Periodic stream with jitter J |
Definitions
| Concept | Condition |
|---|
| Arrival curve α | R≤R⊗α |
| Service curve β | R∗≥R⊗β |
| Strict service curve β | Output ≥β(u) over any backlogged period of length u |
| Greedy shaper σ | R∗=R⊗σ |
Fundamental results
| Result | Statement |
|---|
| Backlog bound | R(t)−R∗(t)≤v(α,β) |
| Delay bound | d(t)≤h(α,β) |
| Output arrival curve | α∗=α⊘β |
| Concatenation | β1,2=β1⊗β2 |
| Blind multiplexing | β1=[β−α2]+ (β strict) |
| FIFO multiplexing | β1θ(t)=[β(t)−α2(t−θ)]+1{t>θ}, θ≥0 |
| Quantity | Value |
|---|
| Delay bound | T+b/R |
| Backlog bound | b+rT |
| Output arrival curve | γr,b+rT |
| Tandem of n servers | βminiRi,∑iTi |
| Blind residual | βC−r2,(CT+b2)/(C−r2) |
Non-preemptive static priority (class k, rate C)
dk=C−RHBH+Llo+Bk+tproc,RH+Rk≤C,
b′=b+rdk,D=h∈P∑dk(h).
BH,RH: aggregate burst and rate of higher-priority classes; Llo: largest lower-priority frame; Bk,Rk: aggregate burst and rate of class k; b′: output burst; D: end-to-end bound over path P (Total Flow Analysis).
Time-Aware Shaper window (no guard band)
Gate open w in every cycle c, link rate C:
β(t)=cCw[t−(c−w)]+.