tcp
play

TCP Tahoe, Reno, NewReno, SACK, and Vegas cwnd : congestion window - PowerPoint PPT Presentation

TCP Tahoe, Reno, NewReno, SACK, and Vegas cwnd : congestion window swnd : usable sending window rwnd : advertised receivers window ssthresh : slow-start threshold RFC793 No cwnd On timeout: retransmit swnd = rwnd TCP Tahoe new ack: if


  1. TCP Tahoe, Reno, NewReno, SACK, and Vegas

  2. cwnd : congestion window swnd : usable sending window rwnd : advertised receiver’s window ssthresh : slow-start threshold

  3. RFC793

  4. No cwnd On timeout: retransmit swnd = rwnd

  5. TCP Tahoe

  6. new ack: if (cwnd < sstresh) cwnd += 1 else cwnd += 1/cwnd

  7. timeout/3rd dup ack: retransmit all unacked ssthresh = cwnd/2 cwnd = 1

  8. Improving TCP Tahoe: Packets still getting through in dup ack -- no need to reset the clock!

  9. TCP Reno

  10. new ack: if (cwnd < sstresh) cwnd += 1 else cwnd += 1/cwnd

  11. timeout: retransmit 1st unacked ssthresh = cwnd/2 cwnd = 1

  12. 3rd dup ack: retransmit 1st unacked ssthresh = cwnd/2 cwnd = cwnd/2 + 3

  13. Fast Recovery: the pipe is still almost full -- no need to restart

  14. subsequent dup ack: cwnd++ new ack: cwnd = ssthresh

  15. Suppose U is lost (oldest unacked) and all other packets are not. At time t, cwnd is W, and packets [U, U+W-1] are in the pipe. U U+W-1 …

  16. Between time t and t+RTT, we would have retransmitted U and received W-1 duplicate ACK. U U+W-1 …

  17. Between time t and t+RTT, the cwnd becomes W/2 + W-1. So we get to send W/2 new packets during the time. (Soon cwnd is going to become W/2 anyway..) U U+W-1 U+W/2+W-1 …

  18. At time t+RTT, we receive ACK for packets [U,U+W-1], set cwnd to W/2. U U+W-1 U+W/2+W-1 …

  19. Simulation of TCP Tahoe/Reno

  20. S1 R1 S2

  21. Entering Exiting queue queue ACKed

  22. Improving TCP Reno: Timeout if multiple losses in a window

  23. TCP NewReno

  24. Idea: stays in fast recovery until all have been ACKed. Partial ACK Fast recovery starts. are the outstanding packets at this time.

  25. Perhaps the next packet is lost?

  26. 3rd dup ack: retransmit 1st unacked ssthresh = cwnd/2 cwnd = cwnd/2 + 3 remember highest

  27. subsequent dup ack: cwnd++ “complete” ack: (all are acked) cwnd = ssthresh

  28. “partial” ack: retransmit cwnd = ssthresh (?)

  29. Note : RFC2581/RFC2582 give the accurate/gory details. Simplified version is presented here (eg. cwnd vs FlightSize, update of cwnd upon partial ACK).

  30. TCP SACK

  31. Coarse Feedback

  32. Go-Back-N vs Selective Repeat

  33. Use TCP header options to report received segments.

  34. SACK Blocks : 1st block - report most recently received segments subsequent blocks - repeat most recent previous blocks

  35. pipe : num of outstanding packets in the path. send only if pipe < cwnd

  36. scoreboard : which packets have been received?

  37. 3rd dup ack: pipe = cwnd - 3 retransmit 1st unacked ssthresh = cwnd/2 cwnd = cwnd/2 + 3

  38. subsequent dup ack: cwnd++ pipe-- (if send new packet, pipe++)

  39. “partial” ack: retransmit cwnd = ssthresh pipe -= 2

  40. Power of SACK: Which packet has left the network? Where is the gap? Decouple when to send and what to send.

  41. TCP Vegas

  42. So far, packet loss as signal of congestion.

  43. But, already over congested when packets are dropped

  44. What other signals are there?

  45. RTT Load

  46. Expected Sending Rate E = cwnd/BaseRTT

  47. BaseRTT : RTT when no congestion (take min measured RTT in practice)

  48. Actual Sending Rate A = cwnd/RTT RTT :

  49. If (E-A) < alpha cwnd++ else if (E-A) > beta cwnd--

  50. Intuition : (E-A) x BaseRTT represents extra buffers occupied in the network

  51. Picking alpha/beta alpha: small but non-zero to take advantage of available bandwidth immediately. ( = 1/BaseRTT)

  52. Picking alpha/beta beta: beta-alpha should not be too small to prevent oscillation. ( = 3/BaseRTT)

  53. Deployment

  54. Feb 2004

  55. 70% SACK capable

  56. Where is TCP Vegas?

  57. Problem 1. Can’t compete with TCP Reno.

  58. Problem 2. Sensitive to RTT estimation.

  59. TCP BIC/CUBIC Linux 2.6.x

  60. Compound TCP MS Windows Vista

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend