L4Transport Layer概要1.pptVIP

* Motivation for Sliding Window Stop-and-wait is inefficient Only one TCP segment is “in flight” at a time Especially bad for high “delay-bandwidth product” delay bandwidth Numerical Example 1.5 Mbps link with 45 msec round-trip time (RTT) Delay-bandwidth product is 67.5 Kbits (or 8 KBytes) Sender can send at most one packet per RTT Assuming a segment size of 1 KB (8 Kbits) 8 Kbits/segment at 45 msec/segment ? 182 Kbps That’s just one-eighth of the 1.5 Mbps link capacity * Sliding Window Allow a larger amount of data “in flight” Allow sender to get ahead of the receiver … though not too far ahead * Sending process Receiving process Last byte ACKed Last byte sent TCP TCP Next byte expected Last byte written Last byte read Last byte received Receiver Buffering Receive window size Amount that can be sent without acknowledgment Receiver must be able to store this amount of data Receiver tells the sender the window Tells the sender the amount of free space left * Window Size Outstanding Un-ack’d data Data OK to send Data not OK to send yet Data ACK’d Optimizing Retransmissions * Reasons for Retransmission * Packet ACK Timeout Packet ACK Timeout Packet Timeout Packet ACK Timeout Packet ACK Timeout Packet ACK Timeout ACK lost DUPLICATE PACKET Packet lost Early timeout DUPLICATEPACKETS * How Long Should Sender Wait? Sender sets a timeout to wait for an ACK Too short: wasted retransmissions Too long: excessive delays when packet lost TCP sets timeout as a function of the RTT Expect ACK to arrive after an “round-trip time” … plus a fudge factor to account for queuing But, how does the sender know the RTT? Running average of delay to receive an ACK Example RTT Estimation * * * * * * * * * * *  Lecture 4 Transport Layer School of Computer Science and Engineering, UESTC IP Protocol Stack: Key Abstractions Transport layer is where we “pay the piper” Provide applications with good abstractions Without support or feedback from the network * Best-effort local packet de