16. Delay based Issues
Sample size
Delayed ACK
Short lived flows
RTT Data quality
Packet trains
Timer resolution
Not aggressive
Works great in “well behaved” network
18. CC Rap Sheet
Reno → Too slow to recover
BIC → Unfair at short RTT or low speed
CUBIC → Slow to converge
HTCP → Slower with small queues
Vegas → Too wimpy and sensitive
Hybrid → Reverts to delay based
19. Ideas
Research
Hybrid congestion control
Refine delay based portion
Detect mega queues
Best CC discovery
Testing
More real world testing
Googlish – random testing
Editor's Notes
Created congestion infrastructure Implemented (broke) several algorithms from papers Trying to stay CC neutral
How the Formula behaves Using the above formula with an MSS of 1460 bytes, we can plot the throughput as a function of loss and RTT as shown in the chart below for the range RTT from 0.25ms (typical LAN RTTs) to 650ms (typical geostationary satellite speed). If one takes the speed of light in fibre as roughly 0.6c or msec = alpha * 100km where empirically alpha ~0.4 accounts for non direct paths, router delays etc. then the distances corresponding to 10, 50, 100, 250, 500, 1000, 2500, 5000, 10000, 25000km are 0.25, 1.25, 2.5, 6.25, 12.5, 25, 62.5, 125, 250, 625 msec.