Delay-based Congestion Control - PowerPoint PPT Presentation

1 / 24
About This Presentation
Title:

Delay-based Congestion Control

Description:

Bunn, Choe, Doyle, Newman, Ravot, Singh, J. Wang. UCLA. Paganini, Z. Wang. CERN. Martin. SLAC. Cottrell. Internet2. Almes, Shalunov. Cisco ... – PowerPoint PPT presentation

Number of Views:31
Avg rating:3.0/5.0
Slides: 25
Provided by: xiaol59
Category:

less

Transcript and Presenter's Notes

Title: Delay-based Congestion Control


1
Delay-based Congestion Control
  • CCW 2003
  • David Wei
  • http//netlab.caltech.edu

2
Acknowledgments
  • Caltech
  • Bunn, Choe, Doyle, Newman, Ravot, Singh, J. Wang
  • UCLA
  • Paganini, Z. Wang
  • CERN
  • Martin
  • SLAC
  • Cottrell
  • Internet2
  • Almes, Shalunov
  • Cisco
  • Aiken, Doraiswami, Yip
  • Level(3)
  • Fernes
  • LANL
  • Wu

3
Topics
  • Summary of congestion control algorithms
  • FAST Algorithm
  • Experimental Results
  • Open problems

4
Decision Function
5
Decision Function
6
Congestion Signal
  • Loss
  • Delay
  • ECN

Queueing delay
Vegas qq
DUAL qgtq_max/2?
TFRC pp
ECN
CARD qgt0?
Loss
Goodput
7
Decision Function using Binary Signal
8
Congestion Signal
  • Loss
  • Delay
  • ECN

Delay-Based Loss-Based
Multi-Valued Signal FAST / Vegas TFRC
Binary Signal CARD / DUAL Reno / HSTCP / ScalableTCP
9
Congestion Signal
  • Loss
  • Delay
  • ECN

?
Delay-Based Loss-Based
Multi-Valued Signal FAST / Vegas TFRC
Binary Signal CARD / DUAL Reno / HSTCP / ScalableTCP
10
Reno in High Speed
Throughput as function of the time Chicago -gt
CERN Linux kernel 2.4.19 Traffic generated by
iperf (I measure the throughput over the last 5
sec) TCP single stream RTT 119ms MTU 1500
Duration of the test 2 hours Bottleneck1Gbps
By Sylvain Ravot (Caltech)
11
Difficulties in Large Window
  • Equilibrium problems
  • Packet level AI too slow, MI too drastic
  • Flow level required loss probability too small
  • Dynamic problems
  • Packet level must oscillate on binary signal
  • Flow level unstable at large window
  • Measurement
  • Very small loss probability
  • Packet out-of order

Improvements HSTCP ScalableTCP
5
12
Throughput as function of the time Dummynet
Testbed Linux kernel 2.4.19 High Speed TCP (UCL
Version) Traffic generated by iperf (average over
5 sec) RTT 100ms, 150ms, 200ms MTU 1500
Duration of the test 9000 seconds Bottleneck8
00Mbps
High Speed TCP
Expected
Huge Loss
13
Throughput as function of the time Dummynet
Testbed Linux kernel 2.4.19 Scalable TCP Traffic
generated by iperf (average over 5 sec) RTT
100ms, 150ms, 200ms MTU 1500 Duration of the
test 9000 seconds Bottleneck800Mbps
Scalable TCP
MIMD
14
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

15
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

16
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

17
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

18
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

19
FAST (sc2002) Algorithm
  • Do the following every other RTT
  • per acknowledgment
  • Calculation
  • Action
  • If w(t)gtw w(t)w(t)-1
  • If w(t)ltw w(t)w(t)1

20
Results on Convergence
  • With static link model
  • Single link identical sources converge
  • Single link heterogeneous sources bounded by
    converging sequences
  • General case (proofs without delay)
  • Contraction mapping

21
Simulation with Matlab
pkt/ms
pkt/ms
pkt
pkt
  • baseRTT 550ms,600ms,650ms,700ms,750ms
  • Alpha500 pkt
  • C5000/12 pkt/ms

22
Simulation with Matlab
ms
pkt
  • baseRTT 550ms,600ms,650ms,700ms,750ms
  • Alpha500
  • C5000/12 pkt/ms

23
Throughput as function of the time Dummynet
Testbed Linux kernel 2.4.20 FAST Traffic
generated by iperf (average over 5 sec) RTT
100ms, 150ms, 200ms MTU 1500 Duration of the
test 9000 seconds Bottleneck800Mbps
FAST Experiment
Noise?
24
Dummynet Testbed_at_ Netlab, Caltech
25
Static throughput
  • Dynamic sharing on Dummynet
  • capacity 800Mbps
  • Delay 50 - 200ms
  • flows 1 - 10
  • iperf throughput
  • Linux 2.4 (HSTCP UCL)

26
Static throughput
27
queue
HSTCP
FAST
Linux
RTT50ms 200ms
10 Flows
loss
throughput
Linux
Scalable
STCP
HSTCP
Bottleneck800Mbps
HSTCP
28
Dynamic Sharing
HSTCP
FAST
Scalable
Linux
29
Difficulties in Delay-based Control
  • Packet Level (Noise)
  • Propagation roundtrip delay
  • Backward queueing delay
  • Noise due to burstiness
  • Flow level
  • How to tune parameter (alpha)?

5
30
Questions?
  • Thanks?
Write a Comment
User Comments (0)
About PowerShow.com