1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.
-
Upload
augustus-doyle -
Category
Documents
-
view
228 -
download
4
Transcript of 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.
![Page 1: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/1.jpg)
1
Network CalculusJean-Yves Le Boudec, lecturer
Patrick ThiranPisa 2003
ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE
![Page 2: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/2.jpg)
2
Lecture Plan Introduction
Arrival curves, Service curves, Pay Bursts only Once, IntServ and ATM
Shapers, shapers keep arrival constraints
Packetizers. Fixed Point Theorem and Residuation. GR nodes and schedulers.
Aggregate Multiplexing and Instability. Explicit bounds. Diff-Serv
Optimal Smoothing. Video Playback
![Page 3: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/3.jpg)
3
A simple example
assume R(t) = sum of arrived traffic in [0, t] is known
(Reich:) required buffer for a bit rate c is sup s t {R(t) - R(s) - c (t-s)}
CBR trunk
bit rate c
XR(t)
![Page 4: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/4.jpg)
4
What is Network Calculus ?
Deterministic analysis of queuing / flow systems arising in communication networks
Abstraction of schedulerssystems that are not a single queue, Reich’s formula does not apply
Uses min, max for binary operators and integrals (min-plus / max-plus algebra)
![Page 5: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/5.jpg)
5
Examples
Pay Bursts only Once Re-Shaping is For Free Minimum Playout Buffer Diff-Serv delay dimensioning
![Page 6: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/6.jpg)
6
Day 1
![Page 7: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/7.jpg)
7
Arrival and Service Curves
Internet integrated services use the concepts of arrival curve and service curves
![Page 8: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/8.jpg)
8
![Page 9: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/9.jpg)
9
![Page 10: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/10.jpg)
10
![Page 11: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/11.jpg)
11
![Page 12: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/12.jpg)
12
![Page 13: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/13.jpg)
13
Min-plus convolution Definition
(f g) (t) = infu { f(t-u) + g(u) }
t
f(t)
g(t)
(f g)(t)
![Page 14: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/14.jpg)
14
Convolution Example 1(f g) (t) = ?
tT
f(t)
R
K
s
f(s)
t
g(t)
rt
g(t-s)
(fg)(t)
tT
(fg)(t)
r
K
![Page 15: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/15.jpg)
15
Convolution Example 2
(f f) (t) = ?tT
f(t)
R
K’
s
f(s)
t
f(t-s)(ff)(t)
t2T
R
2K’
(ff)(t)
![Page 16: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/16.jpg)
16
Star-shaped, concave, convex functions
f is concave 0 u 1, f (ux + (1-u)y) uf(x) + (1-u)f(y)
f is convex -f is concave
f is star-shaped f(t)/t f(s)/s s t
f is concave f is star-shaped
![Page 17: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/17.jpg)
17
Examples
r,b is concave
time
bits
bslope r
r,b(t)
time
bits
k
uT,(t)
2k
3k
4k
is uT, star-shaped ?
concave ?
T- 2T- 3T-4T-
![Page 18: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/18.jpg)
18
Examples
T is convex
time
bits
delay T
T(t)
bits
R,T is convex
time
bits
latency T
R,T(t)
Slope (rate) R
![Page 19: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/19.jpg)
19
Examples
time
bits
T
R,T(t)+K’
R
K’
time
bits
T
R,T(t)+K’’
R
K’’
isR,T + K’ star-shaped ? concave ?
isR,T + K’’ star-shaped ?
concave ?
![Page 20: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/20.jpg)
20
Some properties of min-plus convolution
is associative is commutative K + (f g) = (K + f) g when K is a constantf T (t) = f (t-T)
T (t) = 0 for t T and 0 (t) = for t > T Star-shaped (concave) functions passing
through the origin: f g = f g
![Page 21: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/21.jpg)
21
Example 1 (using rules)
tT
f(t)
R
K f = K + R,T = K + T R
fg = (K + T R) r
= K + ((T R)
r)= K + (T (R
r ))
= K + (T (R r ))= K + (T r )= K + r,T
t
g(t)
r
g = r concavewith g(0) = 0
tT
(fg)(t)
rK
![Page 22: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/22.jpg)
22
r1
r2
s1
s2
u1
=
t1
Min-Plus convolution rule for convex functions
convex piecewise linear wide-sense increasing, passing by origin: put segments end to end with increasing slope
s1
u1
r1
u1 + t1
r2
![Page 23: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/23.jpg)
23
Example: rate latency function
T is convex(delay function)
R,T is convex
(rate-latency function)
latency T
R,T(t)
Slope (rate) R
delay T
T(t)
R(t)=Rt
Rate R
R is convex(delay
function)
we could also use: f T (t) = f (t-T)
![Page 24: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/24.jpg)
24
We can express arrival curves with min-plus convolution
Arrival Curve property means for all 0 s t,
x(t) -x(s) (t-s)<-> x(t) x(s) + (t-s) for all 0 s t<-> x(t) infu { x(u) + (t-u) }
<-> x x
![Page 25: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/25.jpg)
25
Sub-additive functions
is r,b sub-additive ?
time
bits
bslope r
r,b(t)
time
bits
k
uT,(t)
2k
3k
4k
is uT, sub-additive ?
T- 2T- 3T-4T-
![Page 26: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/26.jpg)
26
Sub-additive closures ?
time
bits
T
R,T(t)+K’
R
K’
time
bits
T
R,T(t)+K’’
R
K’’
R,T + K’ is star-shaped ? Sub-additive ?
R,T + K’’ is star-shaped ?
Sub-additive ?
![Page 27: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/27.jpg)
27
Examples
time
bits
T
R,T(t)+K’R
K’
time
bits
T
R,T(t)+K’’R
K’’
2T
2K’
R,T(t)+K’)(2)
R,T(t)+K’)(2)
2T
R,T(t)+K’’
R,T(t)+K’
![Page 28: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/28.jpg)
28
Minimum Arrival Curves
R R
![Page 29: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/29.jpg)
29
Day 2
![Page 30: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/30.jpg)
30
![Page 31: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/31.jpg)
31
![Page 32: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/32.jpg)
32
![Page 33: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/33.jpg)
33
![Page 34: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/34.jpg)
34
![Page 35: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/35.jpg)
35
Pay Bursts Only Once
D1 D2
D
D b /R + T1 + T2
end to end delay bound is less
D b /R + T1 + T2
end to end delay bound is less
D1 +D2 (2b + rT1)/ R + T1 + T2D1 +D2 (2b + rT1)/ R + T1 + T2
![Page 36: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/36.jpg)
36
Application: Intserv (RSVP/IP)
Intserv arrival curve (t) = min (pt+M, rt+b) Rate-latency service curve i(t) = max(0,Ri(t-Ti)) for node i, with Ti =
Ci/Ri +Di where Ci, Di are router-specific values
End-to-end service curve is thus (t) = max(0,R(t-T)) withR = mini Ri and T = i Ti = i (Ci /Ri +Di )
Flow set-up: advertizement with PATH message from source (TSPEC (p,M,r,b), computes AD-SPEC (i Ci, i Di ) along the path)
(p,M,r,b)
(p,M,r,b)
(p,M,r,b)
( )
(C1, D1 )
(C1+C2, D1+D2)
![Page 37: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/37.jpg)
37
Application: Intserv (RSVP/IP)
End-to-end delay bound is, if Ri = R for all i,
((b-M)/R) max(0,(p-R)/(p-r)) + (M + i Ci)/R + i Di
Flow set-up: reservation with RESV message where R is computed so that end-to-end delay bound <= delay objective.
(p,M,r,b)
(p,M,r,b)
(p,M,r,b)
( )
(C1, D1 )
(C1+C2, D1+D2)
R
R
R
![Page 38: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/38.jpg)
38
IntServ: Re-Shaper Buffer Dimensioning
![Page 39: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/39.jpg)
39
![Page 40: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/40.jpg)
40
![Page 41: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/41.jpg)
41
Day 3
![Page 42: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/42.jpg)
42
![Page 43: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/43.jpg)
43
![Page 44: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/44.jpg)
44
![Page 45: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/45.jpg)
45
![Page 46: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/46.jpg)
46
A max-plus model x satisfies:
(1) x x Ø (2) x (R Ø )(t-D)
a max-plus system, , with minimum solution x* = inf {x0, x1, ..., xi, ...}
x0 (t) = (R Ø (t-D) xi = xi-1 Ø
thus x = (R Ø )Ø (t-D) = R Ø ( ) (t-D)
![Page 47: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/47.jpg)
47
Example
R(t)R(t)
(t)(t)
-50 0 50 100 150 200 250 300 350 400 450
Frame #
5
4
3
2
1
* 106
R()R()
minimum value of Dminimum value of D
![Page 48: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/48.jpg)
48
Back to our exampleD=h(R,)D=h(R,)
(t)(t)R(t)R(t)
-50 0 50 100 150 200 250 300 350 400 450
Frame #
5
4
3
2
1
* 106
![Page 49: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/49.jpg)
49
100 200 300 400
2000
4000
6000
8000
10000 R(t)
100 200 300 40010203040506070
tD = 435 ms
100 200 300 400
2000
4000
6000
8000
10000
100 200 300 40010203040506070
t
D = 102 ms
![Page 50: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/50.jpg)
50
Deconvolution is the time inverse of convolution
(1) R (t) in real time(1) R (t) in real time
bits
R(t)
R( )T
bits
R(t)
R(
)
T
(2) S(t) in inverted time(2) S(t) in inverted time
(3) Shape with
(4) Invert time again(4) Invert time againbits
R()
TR(t)
bits
R()
T
S(t)
S R ()
![Page 51: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/51.jpg)
51
Compute g f
1. rotate g
![Page 52: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/52.jpg)
52
Compute g f
2. shape by f
![Page 53: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/53.jpg)
53
Compute g f
3. rotate again
![Page 54: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/54.jpg)
54
Shaping Versus Smoothing
R(t)
(t)
OptimalSmoothing
D=0R(t)
OptimalShapingD > 0
D > 0
x*(t) x(t)
R(t-D)
![Page 55: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/55.jpg)
55
![Page 56: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/56.jpg)
56
Day 4
![Page 57: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/57.jpg)
57
![Page 58: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/58.jpg)
58
![Page 59: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/59.jpg)
59
« Instability of FIFO in Session-Oriented
Networks »Matthew Andrews
Bell LabsSODA 2000
![Page 60: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/60.jpg)
60
GR and Service Curve do not Give Backlog from Delay
Bound
Dmax
time
bits input R(t)
minimum outputoutput
backlogdelay
![Page 61: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/61.jpg)
61
f(n-1) d(n-1)a(n)
f(n) d(n)
L(n)/r
f(n-1) d(n-1) a(n)
f(n) d(n)
L(n)/r
f(n-1)d(n-1)a(n) f(n) d(n)
L(n)/r
f(n) = max{a(n), min[d(n-1), f(n-1)]}+ L(n)/rf(n) = max{a(n), min[d(n-1), f(n-1)]}+ L(n)/r
![Page 62: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/62.jpg)
62
f(n) = max{a(n), f(n-1)]}+ L(n)/rf(n) = max{a(n), f(n-1)]}+ L(n)/r
f(n-1)d(n-1)a(n) f(n) d(n)
L(n)/r
f(n) = max{a(n), min[d(n-1), f(n-1)]}+ L(n)/rf(n) = max{a(n), min[d(n-1), f(n-1)]}+ L(n)/r
f(n-1)d(n-1)a(n) f(n) d(n)
L(n)/r
Guaranteed Rate
Packet Scale Rate Guarantee
![Page 63: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/63.jpg)
63
Delay Bounds with PSRGversus with GR node model
0.05 0.1 0.15 0.2 0.25
0.2
0.4
0.6
0.8
1
delay
1 MB
0.4 MB0.1 MB
h=10e = 2 MTU/r r=150 Mb/s
C=5R
![Page 64: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/64.jpg)
64
Day 5
![Page 65: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/65.jpg)
65
Loss System
node with service curve (t) and buffer X when buffer is full incoming data is discarded modelled by a virtual controller (not buffered) fluid model or fixed sized packets Pb: find loss ratio
fresh trafficR(t)
buffer X
Loss L(t)
R’(t) R*(t)
![Page 66: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/66.jpg)
66
Bound on Loss Ratio Theorem [Chuang and Cheng]: if R is -smooth, then
L(t)/R(t) 1 - rwith r = min(1, inf t 0 [(t) +X] /(t))
best bound with these assumptions proof:
R’ (X + (R’)) h R(R’) 0 where is the transformation R’ -> R, assumed isotone and usc (« physical assumptions ») R’ is the maximum solution
define x(t) = r R(t)x satisfies the system equation:x (X + x ) h R(x) (X + (x)) h R(x)
R’ is the maximum solution=> x(t) R’(t) for all t
![Page 67: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/67.jpg)
67
Stochastic Bounds
network calculus gives deterministic bounds on delay and loss
combine with Hoeffding bounds [1963]: Assume
Xi are independent and 0 Xi 1
E(X1+…+ XI) = s is known
then for s < x < I
sIxI
xIsx
xxXXP I lnlnexp)...( 1
![Page 68: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/68.jpg)
68
Example: Bound on loss probability
I independent, stationary sources with identical constraints i
served in a network element with super-additive service curve [Chang, Vojnovic and L, Infocom 2002
where 0 = s0 < s1 <… < sK=, = inf {t: (t) (t) }
and for (v) - (u) > b
else g(u,v) = 0
),(inf)( 1k
kks ssgbQP
vv
buvv
buvv
buv
buIvug
)()()(
ln)(
)()()(ln
)()(
exp),(
![Page 69: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/69.jpg)
69
Step 1: reduction to horizon
Step 2:
Step 3 : Hoeffding to each term
)}()0,({sup)0( ssAQ s
)}()0,({supmax)0(1
ssAQkk sssk
)}()0,({max 1 kkk ssA
i
kikikk ssAssA )()0,()()0,( 11
)()()()0,( 11 kikikiki ssssA
)()}()0,({ 11 kkkk ssssAE
![Page 70: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/70.jpg)
70
![Page 71: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/71.jpg)
71
![Page 72: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/72.jpg)
72
![Page 73: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/73.jpg)
73
![Page 74: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/74.jpg)
74
![Page 75: 1 Network Calculus Jean-Yves Le Boudec, lecturer Patrick Thiran Pisa 2003.](https://reader035.fdocuments.us/reader035/viewer/2022062221/56649e455503460f94b393bc/html5/thumbnails/75.jpg)
75