Лк_2_ТелетрафикNGN 2013-03-12
.pdfГистерезисное управление перегрузками (3/6)
0 12 We propose:
1. L, H
2. 'oc ' 0, q,100 , q 1 p; 3.'oc - validity ' ;
Optimization problem
E 12 L, H min
R1: B |
1 1 |
loss probability in set X1; |
|
R2 : B |
2 2 |
loss probability in set X2 ; |
|
R3: 3 |
control cycle time. |
|
|
Примеры моделей для анализа |
|
|
|
сетей12.03пост.2013-NGN |
Примеры моделей для анализа сетей пост-NGN |
21 |
Гистерезисное управление перегрузками (4/6)
Пачечное поступление
M|G|1| |
|
|
|
|
|
We consider a hysteretic load control |
|||
<L,H>|<H,R> |
|
|
|
||||||
|
|
|
mechanism with three thresholds: |
||||||
|
|
R |
H |
L |
|
||||
|
|
|
H – overload onset threshold |
||||||
|
s |
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
B(x) |
L – overload abatement threshold |
||
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
R – load discard threshold |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The system functions as follows: when the buffer occupancy reaches threshold H, congestion is detected and load is reduced to avoid overloading. To avoid oscillations between functioning modes load is not recovered immediately after buffer occupancy is decreased to H, but only when it falls to threshold L. Similarly, if buffer occupancy in congested mode reaches threshold R the load is discarded and recovers to congested mode value only when it falls below H.
Overload control status may be changed only |
0,control "off", |
|
|
at the moments of service completion: |
s |
|
|
1,2, control "on". |
|
||
|
|
|
|
Примеры моделей для анализа |
|
|
|
сетей12.03пост.2013-NGN |
Примеры моделей для анализа сетей пост-NGN |
22 |
Гистерезисное управление перегрузками (5/6) |
|||||||
Пачечное поступление |
|
|
|
|
|
||
X(t) - random process with set of states |
S S0 |
S1 |
S2 |
||||
|
|
|
S0 n, s : s 0,0 n R |
set of normal load states; |
|||
|
|
|
S1 n, s : s = 1, L n R |
– set of overload states; |
|||
|
|
|
S2 n, s : s = 2, H 1 n R – set of discard states. |
||||
|
|
|
S0 |
|
|
|
|
|
s 0 |
s 0 |
s 0 |
|
|
|
|
|
0 |
|
|
|
|
|
|
intensity |
|
|
S1 |
|
|
|
|
1 |
|
|
|
|
|
|
|
Flow |
s 1 |
s 1 |
|
|
|
||
|
|
|
|
||||
|
|
|
|
|
|
|
|
|
|
|
|
S2 |
|
Buffer |
|
|
|
|
|
s 2 |
|
occupancy |
|
|
L 1 L |
|
H 1 H |
H 1 |
R 1 R |
j |
|
Примеры моделей для анализа |
|
|
|
|
|
||
сетей12.03пост.2013-NGN |
|
Примеры моделей для анализа сетей пост-NGN |
23 |
Гистерезисное управление перегрузками (6/6)
Пачечное поступление
Let tn be the departure time of the n-th customer. To simplify our analysis we assume that overload status s may be changed only at the completion of
a service. Then the embedded Markov chain X (tn + 0) is defined over the state space S1 S2 and its subsets are as follows:
|
|
S0 |
|
S0 X0 n, s : s 0,0 n H 2 |
|||
|
|
|
S1 X1 n, s : s = 1, L n R 2 |
||||
|
s 0 |
|
s 0 |
||||
|
0 |
|
|
S2 X2 n, s : s = 2, H 1 n R 1 |
|||
|
|
|
|
||||
intensity |
|
|
|
S1 |
|
|
|
1 |
|
|
|
|
|
|
|
Flow |
|
s 1 |
s 1 |
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
S2 |
|
|
Buffer |
|
|
|
|
|
|
|
|
|
|
|
|
s 2 |
|
occupancy |
|
|
L 1 |
L |
H 2 H 1 H |
H 1 |
R 2 |
R 1 |
n |
Примеры моделей для анализа |
|
|
|
|
|
||
сетей12.03пост.2013-NGN |
|
Примеры моделей для анализа сетей пост-NGN |
24 |
Equilibrium probability distribution of embedded Markov Chain
.
|
|
|
|
|
|
k |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ks e s x s x |
dB(x) |
|
|
|
|
|
|
|
|
|
|
|
|
|||||||
|
0 |
|
|
k ! |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
min(n1,H 2) |
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
qn,0 |
|
|
0 |
|
|
|
|
|
|
0 |
|
0 |
|
, n 0, H 2; |
||||||
q0,0 n |
|
|
qi,0 n i1 n,L1 0 qL,1 |
|||||||||||||||||
|
|
|
|
|
|
i1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
H 2 |
|
|
|
|
min(n1,R2) |
|
|
|
|
|
|
|
|||
qn,1 |
|
0 |
|
qi,0 |
0 |
|
|
1 |
|
n,H qH 1,2 , |
n H 1, R 2; |
|||||||||
q0,0 n |
n i1 |
qi,1 n i1 |
||||||||||||||||||
|
|
|
|
|
|
i1 |
|
|
|
|
i L |
|
|
|
|
|
|
|
|
|
|
n1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(4) |
|
|||
qn,1 |
qi,1 n i 1 , |
|
n |
L, H 2; |
|
|
|
|
|
|||||||||||
|
|
|
|
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
i L |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
H 2 |
|
|
|
R 2 |
|
|
|
|
|
|
|
||
qR 1,2 q0,0 |
|
n0 |
|
qi,0 |
n0 qi,1 |
n1 ; |
|
|
|
|
||||||||||
|
|
|
n R1 |
|
i1 |
|
n R i |
i L |
n R i |
|
|
|
|
|||||||
q |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||
q |
|
, |
|
n |
H 1, R 2; |
|
|
|
|
|
|
|
|
|||||||
n,2 |
|
R1,2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Примеры моделей для анализа |
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
сетей12.03пост.2013-NGN |
|
|
|
|
|
Примеры моделей для анализа сетей пост-NGN |
25 |
Steady-state probability distribution
p0,0
pn,0
pR,0
pn,1
pR,1
p
n,2
C 1 |
1 |
q |
|
; |
|
|
|
|
|
|
|
|
|||||||
|
|
|
|
|
|
|
|
|
|
|
|||||||||
|
|
|
|
|
|
|
0,0 |
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
0 |
|
|
|
|
|
|
|
|
|
|
||
|
|
C |
1 |
|
|
|
n1 |
|
|
min(n,H 2) |
|||||||||
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
|
|
|
|
|
|
|
|
q0,0 |
1 |
i0 |
|
|
|
||||||
|
|
0 |
|
||||||||||||||||
|
|
|
|
|
|
i0 |
|
|
|
|
i1 |
||||||||
|
|
|
C |
1 |
|
|
|
|
|
|
n |
|
|
H 2 |
|||||
|
|
|
|
|
|
|
|
i0 |
|
||||||||||
|
|
|
|
|
|
|
q0,0 |
|
1 |
|
|||||||||
|
|
0 |
|
|
|||||||||||||||
|
|
|
|
|
n R1 |
|
|
i0 |
|
|
i1 |
||||||||
|
C |
1 |
min(n,R2) |
|
|
|
n i |
|
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||
|
|
|
|
|
|
|
|
|
|
qi,1 1 k1 |
, |
||||||||
|
|
1 |
|
|
|||||||||||||||
|
|
|
|
|
i L |
|
|
|
|
|
k 0 |
|
|
||||||
|
|
C |
|
1 |
|
R2 |
|
|
|
|
|
n |
|
|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||
|
|
|
|
|
|
|
|
qi,1 |
1 |
k1 ; |
|||||||||
|
|
1 |
|
||||||||||||||||
|
|
|
|
i L |
|
n R i |
|
|
k 0 |
|
|||||||||
C 1b(1)qR 1,2 , |
|
|
|
|
|||||||||||||||
|
|
|
n |
H 1, R |
; |
|
|
n i |
|
qi,0 1 k0 , |
|||
|
|
k 0 |
|
|
|
|
n |
qi,0 1 k0 |
|||
n R i |
k 0 |
n L, R 1;
n 1, R 1;
;
(5)
|
1 |
|
|
b(1) 1 q0,0 b(1) |
1 |
|
(6) |
C |
b(1) |
q0,0 |
q0,0 . |
|
|||
0 |
|
|
|||||
|
|
|
|
0 |
|
||
Примеры моделей для анализа |
|
|
|
|
|
|
|
сетей12.03пост.2013-NGN |
Примеры моделей для анализа сетей пост-NGN |
26 |
Performance measures |
(1/2) |
Transition probability matrix for embedded Markov chain over subset S0
|
0 |
1 |
2 |
L3 |
L2 |
|
||
|
|
0 |
0 |
0 |
0 |
0 |
|
|
|
|
0 |
0 |
0 |
0 |
0 |
|
|
|
|
|
|
|||||
|
0 |
1 |
2 |
L3 |
L2 |
|
||
P |
0 |
0 |
0 |
0 |
0 |
|
(7) |
|
0 |
|
|
0 |
1 |
L4 |
L3 |
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
|
|
|
0 |
0 |
0 |
0 |
0 |
|
|
|
|
0 |
1 |
|
|
|
|
|
|
|
|
|
|
|
|
e |
T |
0, |
, 0,1, 0, |
, 0 |
|
– initial distribution for S0 |
|
||
|
L |
|
|
|
|
|
|
||
|
|
|
L 1 |
H L 1 |
|
|
|
|
|
|
|
|
|
|
|
|
H 2 |
|
|
aT |
a0 , |
|
, aH 2 , |
ai |
1 P0 ij |
– probability that the system |
|||
|
|
|
|
|
|
|
|
will exit S0 from |
-state |
|
|
|
|
|
|
|
j 0 |
|
(i,0) |
|
|
|
|
|
|
|
|
|
|
Примеры моделей для анализа |
|
|
|
|
|
||||
сетей12.03пост.2013-NGN |
|
Примеры моделей для анализа сетей пост-NGN |
27 |
Performance measures |
(2/2) |
Probability that the system exits S0 subset in n steps: |
eLT P0na |
Mean number of steps the system exits S0 : |
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||||
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
L 0 |
|
|
|
|
|
L |
|
I |
|
0 |
1 1 |
||||||||||||
E |
|
|
n 1 e |
|
T P na e |
T |
|
P |
|
||||||||||||||||||
|
|
|
n 0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Average time the system stays in S0 : |
|
|
|
|
0 |
|
|
|
|
||||||||||||||||||
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
L |
|
|
|
|
|
|
|
|
|
|
|||
E |
|
|
b(1) |
|
1 |
|
|
q0,0 |
e |
|
T |
|
I |
P |
|
1 1 |
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||
|
|
|
|
|
0 P(S0 ) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
Average time the system stays in |
S1 |
|
|
S2 : |
|
||||||||||||||||||||||
|
|
|
|
|
12 |
|
E |
0 |
P(S1 |
|
|
|
S2 ) |
|
|
||||||||||||
|
|
|
|
E |
|
|
|
|
|
|
|
P(S0 ) |
|
|
|
|
|||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||
|
|
|
Average control cycle time: |
|
12 |
|
|
||||||||||||||||||||
Примеры моделей для анализа |
|
|
|
|
|
|
|
|
|
|
|
|
0 |
|
|
|
|
|
|
||||||||
сетей12.03пост.2013-NGN |
|
|
|
|
E |
|
E |
|
|
E |
|
|
|
|
|
|
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(8)
(9)
(10)
28
|
|
Case study M|M|1| <L,H>|<H,R> |
|
|
(1/3) |
||||||
|
1 |
|
1 |
|
|
1 |
5ms, |
=1.2, |
B 100 |
||
INVITE 10ms, non-INVITE 4ms, |
|
||||||||||
|
1 |
0, 2; |
2 |
104; |
3 |
450ms |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Примеры моделей |
|
|
сетей12.03пост.2013-NGN |
Примеры моделей для анализа сетей пост-NGN |
29 |
Case study M|M|1| <L,H>|<H,R> |
(2/3) |
=1.2, L 74, H 85, B 100
Примеры моделей для анализа
сетей12.03пост.2013-NGN |
Примеры моделей для анализа сетей пост-NGN |
30 |