Concurrent Flows
Compete for resources
N “slow starts” = aggressive
No shared learning = inefficient
f(n)
f2
f1
Server
Client
Abstract all congestion-related
information into one location
Previous slide
Next slide
Back to first slide
View graphic version