1 / 24

CSEE W4140 Networking Laboratory

CSEE W4140 Networking Laboratory. Lecture 7: TCP flow control and congestion control Jong Yul Kim 03.22.2010. Short review of TCP from last time. Characteristics of the IP network Delivers packets from host to host May lose packets (discarded by routers) Doesn’t care about packet order

nola
Download Presentation

CSEE W4140 Networking Laboratory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSEE W4140Networking Laboratory Lecture 7: TCP flow control and congestion control Jong Yul Kim 03.22.2010

  2. Short review of TCP from last time • Characteristics of the IP network • Delivers packets from host to host • May lose packets (discarded by routers) • Doesn’t care about packet order • TCP is a • reliable, • in-order, • byte-stream service • (delivers data from application to application)

  3. Short review of TCP from last time • TCP is a reliable, in-order, byte-stream service • The beauty of TCP is that it works without explicit support from the network • Each end of the connection cooperate to make sure packets are delivered reliably and in order • Techniques used by TCP • Sequence numbers • Acknowledgements (and numbers) • Retransmissions • Timer

  4. Today’s lecture • TCP Flow Control • Throttling the rate of sender so that the receiver’s buffer does not overflow • TCP Congestion Control • Throttling the rate of sender in the face of network congestion

  5. TCP Flow Control (Receive Window) • When a connection is established, the receiver allocates a receive buffer. • Incoming packets are stored in the buffer so that the application can read data from the buffer.

  6. TCP Flow Control (Receiver behavior) • The receiver lets the sender know: • how much space is left in the buffer= RcvWindow • by placing that value in the window size field • in every segment that it sends to the sender

  7. TCP Flow Control (Sender behavior) • Sender can fill up the spare room in the receiver’s buffer by sending more data • Sender maintains the size of data that has already been sent but unacknowledged = bytes_unACKed • Makes sure that • bytes_unACKed ≤ RcvWindow

  8. Network Congestion • Why does congestion occur? • Too many senders sending at high rate • Routers dropping packets due to overflowing buffers • What are the symptoms? • Packet loss • Packet queuing delay • More retransmission  more packet loss • Link bandwidth wasted on retransmissions

  9. TCP Congestion Control • Remember: TCP has no support from the network about congestions • Need to use end-to-end congestion control • TCP relies on perceived network congestion and throttles the sending rate accordingly

  10. How does TCP know there is congestion in the network? • Answer: packet loss • Timeout • Three duplicate ACKs shown in diagram on right

  11. How does TCP limit sending rate? • Using a variable called congestion window = CongWin • Size of unacknowledged data must be less than CongWin bytes_unACKed ≤ CongWin • Sending rate is roughly CongWin/RTT bytes/sec We can throttle the sending rate by controlling CongWin

  12. TCP Congestion Control Algorithm • Is an algorithm that controls CongWin • Simply stated: • Packet loss (=congestion)  decrease CongWin • All is well  increase CongWin • Three main parts • Additive-Increase, Multiplicative Decrease • Slow Start • Reaction to timeout events

  13. Additive Increase, Multiplicative Decrease (AIMD) • Additive Increase • Increase CongWin by 1 MSS every RTT while there is no packet loss • Multiplicative Decrease • Decrease CongWin by half when packet is lost

  14. Additive Increase, Multiplicative Decrease (AIMD) Congestion Avoidance phase

  15. Slow Start (SS) • When connection is established • CongWin is set to 1 MSS • Increase CongWin by 1 MSS every ACK • Different from Additive Increase (+1 MSS every RTT) • Until a loss occurs • Result is an exponentially fast growth in sending rate

  16. Slow Start (SS)

  17. Example of Slow Start/Congestion Avoidance Assume that ssthresh = 8 ssthresh Cwnd (in segments) Roundtrip times

  18. Reaction to Timeouts • We already discussed that TCP perceives congestion through packet loss • Packet is considered lost when: • Timeout occurs • Three duplicate ACKs are received • But timeouts and three duplicate ACKs are different. • What do they tell about the severity of congestion?

  19. Reaction to Timeouts • Let’s do something different for timeout. • Reset CongWin to 1 MSS • Begin again from Slow Start • Slow start (exponential increase) until when? • New variable called Threshold • Threshold is set to ½ CongWin • After Threshold, do AIMD instead of SS

  20. Lab 5 part 2 in the lab manual

  21. Lab 5 part 2 – our version • Use Table 5.3 and Table 5.4 to configure PC1, PC2, Router1, and Router2. • Do parts 5(B), 6(A), 6(C), and 8. • For part 8, configure PC1 and PC2 so that all packets travel along PC1 – R1 – R2 – PC2 path.

  22. Main Points of Lab 5 Parts 5~8 • More about TCP • Interactive applications over TCP • Data transfer applications over TCP • Congestion Control

  23. Prelab and lab reports • Prelab 6 is due this Friday. • Lab report 5.1 is due this week before your labs. • Lab report 5.2 + BGP lab is due next week before your labs.

More Related