Transcript TCP
TCP (Part 1) - Reliable Stream Transport Service D.E. Comer “Internetworking with TCP/IP: Principles, Protocols and Architectures”, Ch. 13, Prentice Hall, 2000 Presented by Ming Su [email protected] Content TCP Introduction Issue in TCP --- Flow Control Sliding window protocol TCP acknowledgement scheme TCP segment TCP timeout Summary 2 TCP Introduction Introduction - TCP TCP Transmission Control Protocol TCP is not a software Purpose Providing reliable stream delivery Isolating application programs from the details of networking 4 TCP Conceptual Layering Application Reliable Stream (TCP) User Datagram (UDP) Internet (IP), ICMP Network Interface 5 Properties of the reliable delivery service Stream Orientation Virtual Circuit Connection Buffered Transfer data as a stream of bits, divided into 8-bit octets transfer more efficiently & minimize network traffic Unstructured Stream Full Duplex Connection Two-way connection 6 Issues in TCP Two issues in TCP Flow Control End-to-end flow control problem Congestion control problem Virtual Circuit Connection 8 Flow Control - Sliding window protocol End-to-end flow control Problem Sender can send more traffic that receiver can handle. (Too fast) Solution variable sliding window protocol each acknowledgement, which specifies how many octets have been received, contains a window advertisement that specifies how many additional octets receiver are prepared to accept. 10 Variable Window Size … … Window Advertisement Receiver Transmitter Transmitter Window Size Value of Window Advertisement Free space in buffer to fill increase bigger increase decrease smaller decrease Stop transmissions 0 full 11 Sliding window protocol in TCP TCP allows the window size to vary over time. Window size changes at the time it slides forward. Advantage: it provides flow control as well as reliable transfer. 12 Flow Control - TCP acknowledgement scheme Acknowledgements and Retransmission Cumulative acknowledgement scheme is used in TCP. A TCP ACK specifies “the sequence number of the next octet that the receiver expects to receive”. 14 Acknowledgements and Retransmission Adv. Easy to generate and unambiguous. The lost ACKs don’t force retransmission. Disadv. No information about all successful transmissions for the sender, but only a single position in the stream. 15 Flow Control - TCP segment TCP segment format 0 4 16 24 31 Source Port Destination Port Sequence Number Acknowledge Number HLEN Reserved Code Bits Window Checksum Urgent Pointer Options (if any) Padding Data … 17 Flow Control - TCP timeout Timeout and Retransmission Question How to determine timeout? Is the timeout always a constant? 19 Timeout and Retransmission RTT = (α * Old_RTT) + ((1 – α) * new_RTT_sample ) 0<α<1 α close to 1 => no change in a short time α close to 0 => RTT changes too quickly Timeout = β * RTT β >1 Recommended setting, β= 2 21 Accurate Measurement of Round Trip Samples TCP acknowledgements are ambiguous. It is caused by the cumulative acknowledgement scheme. It happens when retransmission. It causes the question that the first received ACK does correspond the original datagram or the retransmitted datagram. RTT couldn’t be measured accurately if the above question cannot be answered. How to do? 22 Karn’sA lgorithm Use RTT to compute Timeout When retransmission happens, Timeout increases in γtimes continuously, until transfer successfully. [Backoff strategy] Use the timeout in the final turn of the last step to send next segment. [Backoff strategy] When an acknowledgement arrives corresponding to a segment that did not require retransmission, then TCP re-computes the RTT and reset the timeout accordingly 24 New RTT and TimeoutA lgorithm DIFF = sample – old_RTT Smoothed_RTT = old_RTT + d * DIFF DEV = old_DEV + p (|DIFF| Timeout = Smoothed_RTT + g * DEV Summary Purpose of TCP End-end Flow Control issue Variable Sliding window protocol in TCP TCP acknowledgement scheme TCP segment TCP timeout RTT-Timeout Calculation and Karn’s Algorithm New RTT and Timeout Algorithm 27 Thanks