1 / 8

Variety of TCP2 － Reno

Variety of TCP2 － Reno. Internet Engineering. Window Control of TCP Tahoe (Review). Window Size. Maximum Window Size. Packet loss. Packet loss. Packet loss. ssthresh (slow start threshold). Times. Retransmission. Retransmission. TCP Reno : Fast Recovery.

annettewarren
Télécharger la présentation

Variety of TCP2 － Reno

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. Variety of TCP2－ Reno Internet Engineering

  2. Window Control of TCP Tahoe (Review) Window Size Maximum Window Size Packet loss Packet loss Packet loss ssthresh (slow start threshold) Times Retransmission Retransmission

  3. TCP Reno : Fast Recovery • Problem of Tahoe: Window size fall extremely when packet loss (Window size fall into 1) • Determine packet loss by duplicate ACKs: • Replied ACKs are able to arrive  traffic congestion isn’t serious • Determine packet loss by time out • Replied ACKs are unable to arrive  traffic congestion is serious Decrease Window size by a half  Congestion Avoidance phase fast recovery Window size is decreased to 1Slow start phase (Similar to Tahoe)

  4. Determine packet loss by duplicate ACKs: Tahoe Window Size 1 Reno Window Size divided by 2 Determine packet loss by time out: Tahoe Window Size 1 Reno Window Size 1 Window Size of Tahoe and Reno Reno Reno Tahoe Tahoe

  5. TCP Window Control Summarize (Reno) Window Size Maximum Window Size Packet loss Packet loss Packet loss ssthresh (slow start threshold) Time Retransmission Retransmission

  6. Inefficient case of TCP Reno WS: Window Size WS=8 WS=4 WS=5 Retransmission 1 18 Sender 1 2 3 4 5 6 7 8 1 9 10 11 11 12 13 14 15 16 17 19 Data Packet 1 is dropped ACK Receiver 17 18 19 21 9 10 11 12 13 14 15 16 Next is 1 Retransmission 1 Retransmission 3 10 1 9 3 1 2 3 4 5 6 7 8 Time out Sender Data Packet 1, 3, 4 are dropped ACK Receiver 10 Next is 1 Next is 3 Lack of duplicate ACKs number  Time out  Retransmission

  7. Variety of TCP • Trade-off the reliability and efficiency, which is efficiently retransmission? • Which is the best algorithm to define the window control according to network state • What is the approach to solve problem for each typical network

  8. Experiment 8 0 4 FTP/TCP 25Mbps 5ms 25Mbps 5ms 2 3 Bandwidth: Bw Delay: d 5 1 FTP Download TCP Agent TCPSink Agent Network Router Network

More Related