Transport Layer课件.ppt

Pipelined (Sliding Window) Protocols Pipelining: sender allows multiple, “in-flight”, yet-to-be-acknowledged data segments range of sequence numbers must be increased buffering at sender and/or receiver Two generic forms of pipelined protocols: Go-Back-N and Selective Repeat 精品文档 Pipelining: Increased Utilization first packet bit transmitted, t = 0 sender receiver RTT last bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R last bit of 2nd packet arrives, send ACK last bit of 3rd packet arrives, send ACK Increase utilization by a factor of 3! 精品文档 Sliding Window Reliable, ordered delivery Receiver has to hold onto a packet until all prior packets have arrived Why might this be difficult for just parallel stop wait? Sender must prevent buffer overflow at receiver Circular buffer at sender and receiver Packets in transit ? buffer size Advance when sender and receiver agree packets at beginning have been received 精品文档 Receiver Sender Sender/Receiver State … … Sent Acked Sent Not Acked OK to Send Not Usable … … Max acceptable Receiver window Max ACK received Next seqnum Received Acked Acceptable Packet Not Usable Sender window Next expected 精品文档 Window Sliding – Common Case On reception of new ACK (i.e. ACK for something that was not acked earlier) Increase sequence of max ACK received Send next packet On reception of new in-order data packet (next expected) Hand packet to application Send cumulative ACK – acknowledges reception of all packets up to sequence number Increase sequence of max acceptable packet 精品文档 Loss Recovery On reception of out-of-order packet Send nothing (wait for source to timeout) Cumulative ACK (helps source identify loss) Timeout (Go-Back-N recovery) Set timer upon transmission of packet Retransmit all unacknowledged packets Performance during loss recovery No longer have an entire window in transit Can have much more clever loss recovery 精