Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering...
-
date post
20-Dec-2015 -
Category
Documents
-
view
214 -
download
0
Transcript of Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering...
![Page 1: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/1.jpg)
Diffusion Mechanisms for Active Queue Management
Department of Electrical and Computer EngineeringUniversity of Delaware
May 19th / 2004
Rafael Nunez
Gonzalo Arce
![Page 2: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/2.jpg)
2
Diffusion Mechanisms for Active Queue Management
Introduction Diffusion Early Marking Performance Conclusions and Future Work
![Page 3: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/3.jpg)
3
The Internet Today
![Page 4: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/4.jpg)
4
Congestion
Desirable control: distributed, simple, stable and fair.
![Page 5: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/5.jpg)
5
Problems with Tail Dropping
Penalizes bursty traffic
Discriminates against large propagation delay connections.
Global synchronization.0 2 4 6 8 10 12 14 16 18 20
0
10
20
30
40
50
60
70
80
90
100Instantaneous Queue Size - Drop Tail
Time (seconds)
Que
ue (
Pac
kets
)
![Page 6: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/6.jpg)
6
Active Queue Management (AQM)
Random Early Detection (Floyd and Jacobson, 1993)
Router becomes active in congestion control.
RED has been deployed in some Cisco routers.
![Page 7: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/7.jpg)
7
Random Early Detection (RED)
Random packet drops in queue. Drop probability based on average queue:
q n6@
= 1- wq
_ i$q n - 1
6 @+wq$q n
6@
Four parameters: qmin qmax Pmax wq
(overparameterized)
![Page 8: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/8.jpg)
8
Queue Behavior in RED
0 2 4 6 8 10 12 14 16 18 200
10
20
30
40
50
60
70
80
90
100Queue Behavior in RED
Time (seconds)Q
ueue
(P
acke
ts)
Instantaneous QueueAverage Queue
0 2 4 6 8 10 12 14 16 18 200
10
20
30
40
50
60
70
80
90
100Queue Behavior in Drop Tail
Time (seconds)
Que
ue (
Pac
kets
)
![Page 9: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/9.jpg)
9
Queue Behavior in RED (2)
20 new flows every 20 seconds
Wq = 0.01 Wq = 0.001
0 10 20 30 40 50 60 70 80 90 1000
10
20
30
40
50
60
70
80Queue Behavior in RED
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
0 10 20 30 40 50 60 70 80 90 1000
10
20
30
40
50
60
70
80
90
100Queue Behavior in RED
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
![Page 10: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/10.jpg)
10
Other AQM’s Schemes
Adaptive RED, REM, GREEN, BLUE,… Problems:
Over-parameterization Not easy to implement in routers Not much better performance than drop
tail
![Page 11: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/11.jpg)
11
Diffusion Mechanisms for Active Queue Management
Introduction Diffusion Early Marking Performance Conclusions and Future Work
√
![Page 12: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/12.jpg)
12
Diffusion Mechanisms for AQM
Instantaneous queue size. Better packet marking strategy. Simplified parameters.
![Page 13: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/13.jpg)
13
Probability of Marking a Packet
Gentle RED function closely follows:
P [n] / P (qn) = Sqncma
(A)
![Page 14: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/14.jpg)
14
Evolution of the Congestion Window
TCP in steady state:
PacketsBetweenDrops= 83W2
p1 = 8
3W2
(B)
![Page 15: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/15.jpg)
15
Traffic in the Network
Congestion Window = Packets In The Pipe + Packets In The Queue
Or:
43W $N= MSS
B $RTT +qd(C)
From (A), (B), (C), and knowing that: RTT=D+q$ BMSS
P (q) = Sqcma
$N2
a=Log S
qd; ELog 2
3: D- 2 $Log MSS
B $D +2 $qd; D
where
![Page 16: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/16.jpg)
16
Probability Function
P (q) = Sqcma
$N2, if q>S$N2̂h1/a
1 , otherwise
*
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1P(Q/S, N)
Q/S
P(Q
/S,
N)
N = 1N = 5N = 10
![Page 17: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/17.jpg)
17
Error Diffusion
Packet marking is analogous to halftoning: Convert a continuous gray-scale image into black
or white dots Packet marking reduces to quantization
Error diffusion: The error between input (continuous) and output (discrete) is incorporated in subsequent outputs.
![Page 18: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/18.jpg)
18
Diffusion Mechanism
![Page 19: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/19.jpg)
19
Diffusion Mechanism
![Page 20: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/20.jpg)
20
Diffusion Mechanism
![Page 21: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/21.jpg)
21
Diffusion Mechanism
![Page 22: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/22.jpg)
22
Diffusion Mechanism
![Page 23: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/23.jpg)
23
Diffusion Mechanism
![Page 24: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/24.jpg)
24
Diffusion Mechanism
![Page 25: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/25.jpg)
25
Diffusion Mechanism
![Page 26: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/26.jpg)
26
Diffusion Mechanism
![Page 27: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/27.jpg)
27
Diffusion Mechanism
![Page 28: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/28.jpg)
28
Diffusion Mechanism
![Page 29: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/29.jpg)
29
Diffusion Mechanism
![Page 30: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/30.jpg)
30
Algorithm Summary
D[n] =1, if (P [n] - P
e[n]) H 2P [n]0, otherwise
)
P (q) = Sqcma
$(N $Ef)2, if q>S$(N $Ef)2_ i1/a
1 , otherwise
*
a=Ln S
qd; ELn 2
3: D- 2 $Ln MSS
B $D +2 $qd; D
• Diffusion Early Marking decides whether to mark a packet or not as:
Where:
Pe[n]= bi$De[n - i]
i= 1
M
!
De[n] =(P [n] +Pe[n]) - D[n]
M=2, b1=2/3, b2=1/3
Remember:
![Page 31: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/31.jpg)
31
Diffusion Mechanisms for Active Queue Management
Introduction Diffusion Early Marking Performance Conclusions and Future Work
√
√
![Page 32: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/32.jpg)
32
Dropping Packets
0 10 20 30 40 50 60 70 80 90 1000
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2Diffusion Early Marking: Drops vs. Time (1 Flow)
Time (seconds)
Dro
ps (
pack
ets)
0 10 20 30 40 50 60 70 80 90 1000
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2RED: Drops vs. Time (1 Flow)
Time (seconds)
Dro
ps (
pack
ets)
![Page 33: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/33.jpg)
33
Window Size
0 5 10 15 20 25 30 35 40 45 500
10
20
30
40
50
60
70
80
90
100RED: Congestion Window Size vs. Time (2 Flows)
Time (seconds)
Con
gest
ion
win
dow
siz
e (p
acke
ts)
Congestion Window 1Congestion Window 2Average Congestion Window 1Average Congestion Window 2
2 Flows:
10 Flows
0 1 2 3 4 5 6 7 8 9 10 110
2
4
6
8
10
12
14
16
18
20Diffusion Early Marking: Average Congestion Window Size vs. Time (10 Flows)
Flow ID
Ave
rage
Con
gest
ion
win
dow
siz
e (p
acke
ts)
0 1 2 3 4 5 6 7 8 9 10 110
2
4
6
8
10
12
14
16
18
20RED: Average Congestion Window Size vs. Time (10 Flows)
Flow ID
Ave
rage
Con
gest
ion
win
dow
siz
e (p
acke
ts)
0 5 10 15 20 25 30 35 40 45 500
10
20
30
40
50
60
70
80
90
100Diffusion Early Marking: Congestion Window Size vs. Time (2 Flows)
Time (seconds)
Con
gest
ion
win
dow
siz
e (p
acke
ts)
Congestion Window 1Congestion Window 2Average Congestion Window 1Average Congestion Window 2
![Page 34: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/34.jpg)
34
Stability of the Queue
100 long lived connections (TCP/Reno, FTP) Desired queue size = 30 packets
0 2 4 6 8 10 12 14 16 18 200
10
20
30
40
50
60
70
80
90
100Queue Behavior in RED
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
0 2 4 6 8 10 12 14 16 18 200
10
20
30
40
50
60
70
80
90
100Diffusion Early Marking Queue
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
![Page 35: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/35.jpg)
35
Changing the number of flows
20 new flows every 20 seconds
0 10 20 30 40 50 60 70 80 90 1000
10
20
30
40
50
60
70
80
90
100Queue Behavior in RED
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
0 10 20 30 40 50 60 70 80 90 1000
10
20
30
40
50
60
70
80
90
100Diffusion Early Marking Queue
Time (seconds)
Que
ue (
Pac
kets
)
Instantaneous QueueAverage Queue
![Page 36: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/36.jpg)
36
Diffusion Mechanisms for Active Queue Management
Introduction Diffusion Early Marking Performance Conclusions and Future Work
√
√
√
![Page 37: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/37.jpg)
37
Conclusions and Future Work
Queue length stabilized and controlled without adjusting parameters.
Diffusion mechanism improves the behavior of the proposed AQM scheme.
Future Work: Estimation of parameters Analyze more traffic scenarios Compare with other AQMs Use diffusion mechanism in other AQMs
![Page 38: Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.](https://reader030.fdocuments.us/reader030/viewer/2022032704/56649d445503460f94a219d0/html5/thumbnails/38.jpg)
38
Diffusion Mechanisms for Active Queue Management
Introduction Diffusion Early Marking Parameter Estimation Conclusions and Future Work
√
√
√
√