1. Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008

2. 2 Internet Pipes? How should you control the faucet? –Too fast – sink overflows –Too slow – what happens? Goals –Fill the bucket as quickly as possible –Avoid overflowing the sink Solution – watch the sink

3. 3 Congestion Different sources compete for resources inside network Why is it a problem? –Sources are unaware of current state of resource –Sources are unaware of each other Manifestations: –Lost packets (buffer overflow at routers) –Long delays (queuing in router buffers) –Can result in throughput less than bottleneck link (1.5Mbps for the above topology) a.k.a. congestion collapse 10 Mbps 100 Mbps 1.5 Mbps

4. 4 Causes & Costs of Congestion Four senders – multihop paths Timeout/retransmit Q: What happens as rate increases?

5. 5 Causes & Costs of Congestion When packet dropped, any upstream transmission capacity used for that packet was wasted!

6. 6 Congestion Collapse Definition: Increase in network load results in decrease of useful work done Many possible causes –Spurious retransmissions of packets still in flight Classical congestion collapse How can this happen with packet conservation? RTT increases! Solution: better timers and TCP congestion control –Undelivered packets Packets consume resources and are dropped elsewhere in network Solution: congestion control for ALL traffic

7. 7 Congestion Control and Avoidance A mechanism that: –Uses network resources efficiently –Preserves fair network resource allocation –Prevents or avoids collapse Congestion collapse is not just a theory –Has been frequently observed in many networks

8. 8 Congestion Control Approaches End-end congestion control: –No explicit feedback from network –Congestion inferred from end-system observed loss, delay –Approach taken by TCP Network-assisted congestion control: Routers provide feedback to end systems Single bit indicating congestion (SNA, DECbit, TCP/IP ECN, ATM) Explicit rate sender should send at Problem: makes routers complicated Two broad approaches

9. 9 Example: TCP Congestion Control Very simple mechanisms in network –FIFO scheduling with shared buffer pool –Feedback through packet drops TCP interprets packet drops as signs of congestion and slows down –This is an assumption: packet drops are not a sign of congestion in all networks E.g. wireless networks Periodically probes the network to check whether more bandwidth has become available.

10. 10 Simple router behavior Distributed operation Efficiency: X = x i (t) –Solution leads to high network utilization Fairness: ( x i ) 2 /n( x i 2 ) –What are the important properties of this function? Convergence: control system must be stable Objectives

11. End-to-End Congestion Control Increase algorithm –Sender must test the network to determine whether or not the network can sustain a higher rate Decrease algorithm –Senders react to congestion to achieve optimal loss rates, delays, sending rates

12. Two Approaches Window-based –Sender uses ACKs from receiver to clock transmission of new data Rate-based –Sender monitors loss rate and uses timer to modulate the transmission rate –Actually need a burst rate and a burst size

13. 13 What are desirable properties? What if flows are not equal? Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 Optimal point Overload Underutilization Phase Plots

14. 14 Reduce speed when congestion is perceived –How is congestion signaled? Either mark or drop packets –How much to reduce? Increase speed otherwise –Probe for available bandwidth – how? Basic Control Model

15. 15 Many different possibilities for reaction to congestion and probing –Examine simple linear controls Window(t + 1) = a + b Window(t) Different a i /b i for increase and a d /b d for decrease Supports various reaction to signals –Increase/decrease additively –Increased/decrease multiplicatively –Which of the four combinations is optimal? Linear Control

16. 16 Simple way to visualize behavior of competing connections over time User 1s Allocation x 1 User 2s Allocation x 2 Phase Plots

17. 17 T0T0 T1T1 Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 Both X 1 and X 2 increase/ decrease by the same amount over time –Additive increase improves fairness and additive decrease reduces fairness Additive Increase/Decrease

18. 18 Both X 1 and X 2 increase by the same factor over time –Extension from origin – constant fairness T0T0 T1T1 Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 Multiplicative Increase/Decrease

19. 19 xHxH Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 Convergence to Efficiency

20. 20 xHxH Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 a=0 b=1 a>0 & b<1 a 1 a<0 & b<1 a>0 & b>1 Distributed Convergence to Efficiency

21. 21 xHxH Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 xHxH Convergence to Fairness

22. 22 Intersection of valid regions For decrease: a=0 & b < 1 xHxH Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 xHxH Convergence to Efficiency and Fairness

23. 23 Constraints limit us to AIMD –Can have multiplicative term in increase (MAIMD) –AIMD moves towards optimal point x0x0 x1x1 x2x2 Efficiency Line Fairness Line User 1s Allocation x 1 User 2s Allocation x 2 Approach

24. Results Assuming syncrhonized feedback (i.e., congestion is signalled to all connections sharing a bottleneck) –Additive increase improves fairness and efficiency –Multiplicative decrease moves the system towards efficiency without altering fairness In contrast –Additive decrease reduces fairness –MIMD does not ever improve fairness

25. Distributed, fair and efficient Packet loss is seen as sign of congestion and results in a multiplicative rate decrease –Factor of 2 TCP periodically probes for available bandwidth by increasing its rate Time Rate AIMD

26. 32 Operating system timers are very coarse – how to pace packets out smoothly? Implemented using a congestion window that limits how much data can be in the network. –TCP also keeps track of how much data is in transit Data can only be sent when the amount of outstanding data is less than the congestion window. –The amount of outstanding data is increased on a send and decreased on ack –(last sent – last acked) < congestion window Window limited by both congestion and buffering –Senders maximum window = Min (advertised window, cwnd) Implementation

27. If loss occurs when cwnd = W –Network can handle 0.5W ~ W segments –Set cwnd to 0.5W (multiplicative decrease) Upon receiving ACK –Increase cwnd by (1 packet)/cwnd What is 1 packet? 1 MSS worth of bytes After cwnd packets have passed by approximately increase of 1 MSS Implements AIMD Congestion Avoidance

28. Sequence No Packets Acks Example: Sequence Number Plot

29. Throughput vs. Loss Rate To the first order, throughput is proportional to 1/sqrt(loss rate) –TCP friendliness Consider following diagram to derive throughput: How many packets between periods of packet loss? (arithmetic series) Compute loss rate from this… Throughput: avg rate / RTT