Professional Documents
Culture Documents
Abstract
The most useful formulas for the course of Reti Internet Multimediali
are listed.
1 General formulas
1.1 The Maximum Variance Asymptotic upper bound (MVA)
First, write the (t) function:
B(t) is the envelope of the relevant traffic flow X(t). If an envelope is not
available, use X(t) directly. S(t) is the service envelope of X(t). d is the delay
threshold.
Second, find the absolute minimum of (t), referred to as min .
Third:
2min
P (D > d) = e 2 . (2)
E(S(t)) = Ct
.
var(S(t)) = 0
1
1.2.2 Strict Priority (SP) scheduler
i1
X
Si (t) = max 0, Ct Bj (t) . (4)
j=1
C(Cnr)
P (D > d) = e2 nrb d
. (7)
2
2.1.2 Average delay
nrb
E(D) = . (8)
2C(C nr)
2C 2 d
n . (9)
2Cdr b ln p
r
nr nr 2 nb ln p
C + . (10)
2 2 2d
1
2ar 1
C 22H (Cr)2H d22H
P (D > d) = e H 2H (1H)22H . (11)
Define: Pi
Ai = j=1 nj rj withi 1
;
A0 = 0 i=0
Pi
Bi = j=1 nj rj bj withi 1
.
B0 = 0 i=0
CAi
2 [(CAi1 )Bi (CAi )Bi1 ]di
B2
P (Di > di ) = e i . (12)
3
2.3.2 Admission control
Define:
(Cdi bik ln pi di Ai1k )
nik = +
rik di
q
ln pi 2di Bi1k + 2di bik (C Ai1k ) b2ik ln pi
rik di
and define
2dik C 2
nik,max = .
2dik rik C rik bik ln pik
If
k < i : 0 nik min nik , nik,max ,
then 2 2
Bi1
bi 2C 2Ai1 + Bib1 i
4Bi1 lndpi i
ni h i +
4ri 2 C Ai1 + Bbi1 i
bi ln pi
di
q
4 C Ai1 + Bbi1
i
(C Ai1 )2 + 2Bi1 lndpi i
h i , (13)
4ri 2 C Ai1 + Bbi1i
bi ln pi
d i
otherwise
ni = 0. (14)
Particular case for two priorities
p
(Cd2 b1 ln p2 ) ln p2 (2d2 b1 C b21 ln p2 )
n1 =
r1 d2
and define
2d1 C 2
n1,max = .
2d1 r1 C r1 b1 ln p1
If
n1 min (n1 , n1,max ) ,
then 2 2
2C 2A1 + Bb21 4B1 lndp2 2
B1
b2
n2 h i +
4r2 2 C A1 + Bb21 b2 dln2 p2
q
4 C A1 + Bb21 (C A1 )2 + 2B1 lndp2 2
h i , (15)
4r2 2 C A1 + Bb21 b2 dln2 p2
otherwise
n2 = 0. (16)
4
2.3.3 Resource provisioning
X
Bi = nn rn bn
n6=i
X
Ei = nn rn max(0, n i )
n6=i
X
Fi = nn rn bn max(0, n i )
n6=i
p
Ai di Ei + (Ei + ni ri di )2 2 ln pi (Fi + ni ri bi di )
Ci (Bi + ni ri bi )+
2(Fi + ni ri bi di )
Ai + ni ri
+ (20)
2
Finally:
C = max Ci . (21)
i
5
2.4.3 Admission control
1
ni .
ri (2(bi (Cdi Ai di + Ei ) + Bi di Fi ) b2i ln pi )
(Ai bi + Bi Cbi )(Ai di Ei Cdi )+
2(Bi di Fi )(Ai C) + bi Bi ln pi + (22)
p
2 2
+ (Ai bi + Bi + Cbi ) ((Ai di Ei Cdi ) + 2(Bi di Fi ) ln pi )
!2
X wi
Bi = P nj rj bj
k6=j wk
j6=i
di (wi C + Ai )(wi bi C + bi Ai + Bi ) + bi Bi ln pi
ni,max = +
ri (2di (wi bi C + bi Ai + Bi ) b2i ln pi )
p
di (wi bi C + bi Ai + Bi )2 (di (wi C + Ai )2 + 2Bi ln pi )
+
ri (2di (wi bi C + bi Ai + Bi ) b2i ln pi )
6
4 Analytical calculation of end-to-end delay
The end to end delay of a traffic stream traversing a sequence of H schedulers,
is given by
de2e = d1 + d2 + + dH , (25)
where di is the delay at scheduler i. Therefore, the probability density of end
to end delay is
thus,
(H )
Y ki
fde2e (t) = L1 , (30)
k
i=1 i
+s
which can be calculated with the partial fraction expansion method.
where
YH
k
j
Gi = (s + ki ) . (32)
k +s
j=1 j
s=ki
7
4.1.1 Case of H=2
In this case, we have
k1 k2
G1 = (33)
k1 + k2
and
k1 k2
G2 = , (34)
k1 k2
thus:
k1 k2 k1 t
fde2e (t) = e ek2 t . (35)
k1 + k2
H tH1 t
fde2e (t) = e . (36)
(H 1)!
References
[1] P. Giacomazzi, Appunti del corso di Reti Internet Multimediali,
http://home/dei/polimi.it/giacomaz.