1. U NDERSTANDING TCP I NCAST T HROUGHPUT C OLLAPSE IN D ATACENTER N ETWORKS Presenter: Aditya Agarwal Tyler Maclean

2. M OTIVATION /I MPORTANCE Internet datacenters support a myriad of service and applications. Google, Microsoft, Yahoo, Amazon Vast majority of datacenter use TCP for communication between nodes. The unique workload, scale and environment of internet datacenter violate the WAN assumption on which TCP was originally designed. RTO = 200ms (default value in Linux) 2-3 order of magnitude greater than the RTT in the data center

3. W HAT IS THE P ROBLEM Incast communication pattern: Try to understand TCP incast throughput collapse. Prove this problem is general, An analytical model Modifications to TCP and make sure that it works client server switch server

4. T HE C ONTRIBUTIONS Reproduce the problem in our own experimental testbeds and demonstrate the generality of Incast. Propose a quantitative model that accounts some of the observed Incast behavior. Implement several intuitive modifications to the TCP stack in Linux, and prove that some modifications are more helpful than others.

5. R OADMAP Experiment setting: Workload Experiment results: Initial Finding Deep analysis Quantitative Models Conclusions

6. W ORK L OAD SETTING Map Reduce like application: Receiver requests k blocks of data from S storage servers. Each block of data striped across S storage servers Each server responses with a “ fixed ” amount of data. ( fixed-fragment workload ) Client won’t request block k+1 until all the fragments of block k have been received. Setting: k=100 S = 1-48 fragment size : 256KB

7. D ETER N ETWORK S ECURITY T ESTBED 400 PCs, located at USC ISI and UC Berkeley Supported operating systems include Linux, FreeBSD, Windows

8. I NITIAL R ESULTS

9. Different sender experience long, synchronized TCP retransmission timeout (RTO) events. RTO =200ms (default value in WAN environment)

10. M INOR AND INTUITIVE MODIFICATIONS Decrease the minimum RTO timer from 200ms Randomize the minimum RTO timer Smaller multiplier for the RTO exponential back off Randomize the multiplier for the RTO exponential back off.

11. I NITIAL R ESULTS Smaller multiplier for the RTO exponential back off Useless Randomize the multiplier for the RTO exponential back off Useless There are only a tiny number of exponential back offs for the entire transfer

12. I NITIAL R ESULTS Randomize the RTO timer Useless, but also no penalty Because the servers share the same switch, all subsequent switch buffer overflow events will be synchronized for all sender.???

13. A NALYSIS IN DEPTH Different RTO Timers Observations: Initial goodput min occurs at the same number of servers. Larger min RTO timer value, max goodput occurs at large number of senders. Smaller RTO timer value has faster goodput “recovery” rate The decrease rate after local max is the same between different min RTO settings.

14. D ELAY ACK S AND H IGH R ESOLUTION T IMERS Improving methods proposed by [11] Turn off the delay ACKs function (defaults delayed ACKs threshold is 40ms) Use high resolution Timer.

15. C ONGESTION WINDOWS WITH / WITHOUT DELAY ACK S

16. S MOOTHED RTT WITH / WITHOUT DELAY ACK S

17. D IFFERENT WORKLOAD

18. S UB - OPTIMAL BEHAVIOR WITH REGARDS TO DELAYED ACK S IS WORKLOAD INDEPENDENT.

19. C ANNOT MATCH THE RESULTS IN PREVIOUS WORK [11]

20. S MOOTHED RTT WITH / WITHOUT DELAY ACK S

21. Q UANTITATIVE M ODELS Net good put: D: total amount of data to be sent, 100 blocks of 256KB L: total transfer time of the workload without and RTO events. R: the number of RTO events during the transfer S: number of server: r: the value of the minimum RTO timer value

22. F IT THE CURVE OF THE NUMBER OF RTO EVENTS

23. E QUATION OF L I is the inter-packet waiting time

24. H OW GOOD IS THEIR ANALYSIS MODEL ?

25. F URTHER ANALYSIS ON R AND I Number of RTO event is similar for different RTO values( 200ms and 1ms). Interpkt waiting is vary different for different RTO value( 200ms and 1ms).

26. Q UALITATIVE REFINEMENT FOR THEIR MODEL As the number of sender increase, the number of RTO event per sender increases. Beyond a certain number of sender, the number of RTO event is constant. When a network resource becomes saturated, it is saturated at the same time for all senders. After a congestion event, the senders enter the TCP RTO state. The RTO timer expires at each sender with a uniform distribution in time and a constant delay after the congestion event. T is increase as the number of sender increase, however, T is bounded.

27. M ORE EXPLANATIONS A smaller minimum RTO timer value means larger goodput values for the initial minimum. The initial goodput minimum occurs at the same number of senders, regardless the value of the minimum RTO times. The second order goodput peak occurs at a higher number of senders for a larger RTO timer value The smaller the RTO timer values, the faster the rate of recovery between the goodput minimum and the second order goodput maximum. After the second order goodput maximum, the slope of goodput decrease is the same for different RTO timer values.

28. C ONCLUSIONS Study the dynamic of Incast. Propose a simple mathematical model to explain the observed trends Account for the difference between their observation and that in previous work.