Professional Documents
Culture Documents
8 RouterSupport
8 RouterSupport
|
|
Ion Stoica
Computer Science Division
Department of Electrical Engineering and Computer Sciences
University of California, Berkeley
Berkeley, CA 94720-1776
|
ã raditional Internet
- Congestion control
mechanisms at end-systems,
mainly implemented in CP
- Routers play little role
ã Router mechanisms affecting
congestion management
- Scheduling
- Buffer management
ã raditional routers
- FIFO
- ail drop
!
è
|"
¢
#
ã FIFO scheduling
ã Buffer management:
- Probabilistically discard packets
- Probability is computed as a function of average queue
length (why average?)
j
D
# $
%!&
j
# $
%!&
j
þ
# $
%!&
h
# '!(
ð
#
|"
4
"
#
ã o protection: if a flow misbehaves it will hurt the
other flows
ã Example: 1 UDP (10 Mbps) and 31 CP¶s
sharing a 10 Mbps link
10
8 " ED
1
0
1 10 13 1 1 5 8 31
K
44
)
4
!
4è
)
4¢
*
$*&+ %ð
ã Advantages
- Each flow will receive exactly its fair rate
ã ote:
- FQ achieves max-min fairness
4D
,
ã Denote
- | ± link capacity
- ± number of flows
- ± arrival rate
ã Max-min fair rate computation:
1. compute |
2. if there are flows such that i <= | , update |and
| |
È |
ã | = 10; 1 = , 2 = 6, 3 = 2; =3
ã |/3 = 3.33 | = | ± r3 = ; =2
ã |/2 = 4; = 4
2 = 4
m
min( , 4) = 4
min(6, 4) = 4
min(2, 4) = 2
4þ
' -.
|
2 ; |
2 = 4
m
min( , 4) = 4
min(6, 4) = 4
min(2, 4) = 2
4
*
4ð
#,
Flow 1 1 2 3 4 6
(arrival traffic) time
Flow 2
(arrival traffic) 1 2 3 4
time
Service 1 2 3 4 6
in fluid flow
1 2
3 4 time
system
Packet 1 2 1 3 2 3 4 4 6
system time
. /
§$ &
ã Measure service, instead of time
ã V(t) slope ± rate at which every active flow receives service
- | ± link capacity
- (t) ± number of active flows in fluid flow system at time t
V(t)
|
time
Service 1 2 3 4 6
in fluid flow
1 2
3 4 time
system 4
*
ã Define
- ï- finishing time of packet ï of flow (in system virtual
time reference system)
- ï- arrival time of packet ï of flow
Ä ï Ä length of packet ï of flow
- !*
0$-*&
è
#,
ã 1 UDP (10 Mbps) and 31 CPs "4 "$4&
sharing a 10 Mbps link
|" |"$&
ÈÈÈ ÈÈÈ
|"è 4
|"$è&
0
h
!
0
K *
# . # 0
03
03
0
0
01
01
00
h 0
h 1 10 13 1 1 31
K K
¢
|
*
$| *&
D
| *
þ
'
'
ð
'
ã Core node:
- Compute fair rate 2 on the output link
- Enqueue packet with probability
2
è
'
è4
#,| *
ã Assume estimated fair rate 2 = 4
- flow 1, = => !"#È
6 10
expected rate of forwarded traffic "X
2
- flow 2, = 6 => !$#È$%
expected rate of forwarded traffic $X
- flow 3, = 2 => !&#
expected rate of forwarded traffic 2
è
#
ã (
: rate of aggregate forwarded rate (R) is a
"
monotonic and non-decreasing function of estimated
2 Å
rate
'# " 2
$ $ 2 2 " 2 Ú $ 2 Ú & 2
& 2
&
2
16
10 |
0 2
0 1 2 3 4 6 7 9 10 èè
#,
h
8
"$4& "$4& # .
|"$& |"$& 5
ÈÈÈ ÈÈÈ
|"$è& 4 & |"$è&
h
h 5 8
K
|
h5 h5
K* K*
h5 h5
h h
h5 h5
h h
h5 h5
h h
h 5 h 5
h h
hh5 hh5
h h è¢
h 5 8 h 5 8
K K
.
èD
'
ã Project feedback
- uesday, Feb 14, 12:30-2pm
- Wednesday, Feb 1 , 11:30-1pm
è