Chapter 12 TCP Traffic Control 1 Chapter 12 TCP Traffic Control.

Chapter 12 TCP Traffic Control1

Chapter 12Chapter 12TCP Traffic Control


Introduction Introduction

TCP Flow ControlTCP Congestion Control


TCP Flow Control TCP Flow Control

Uses a form of sliding windowDiffers from mechanism used in LLC,

HDLC, X.25, and others:Decouples acknowledgement of received data

units from granting permission to send more

TCP’s flow control is known as a credit allocation scheme:

Each transmitted octet is considered to have a sequence number


TCP Header Fields for Flow ControlTCP Header Fields for Flow Control

Sequence number (SN) of first octet in data segment

Acknowledgement number (AN)Window (W)Acknowledgement contains AN = i, W = j:

Octets through SN = i - 1 acknowledgedPermission is granted to send W = j more octets,

i.e., octets i through i + j - 1


Figure 12.1 TCP Credit Figure 12.1 TCP Credit Allocation MechanismAllocation Mechanism


Credit Allocation is FlexibleCredit Allocation is Flexible

Suppose last message B issued was AN = i, W = j

To increase credit to k (k > j) when no new data, B issues AN = i, W = k

To acknowledge segment containing m octets (m < j), B issues AN = i + m, W = j - m


Figure 12.2 Flow Control Figure 12.2 Flow Control PerspectivesPerspectives


Credit PolicyCredit Policy

Receiver needs a policy for how much credit to give sender

Conservative approach: grant credit up to limit of available buffer space

May limit throughput in long-delay situations

Optimistic approach: grant credit based on expectation of freeing space before data arrives


Effect of Window SizeEffect of Window Size

W = TCP window size (octets)R = Data rate (bps) at TCP sourceD = Propagation delay (seconds)After TCP source begins transmitting, it

takes D seconds for first octet to arrive, and D seconds for acknowledgement to return

TCP source could transmit at most 2RD bits, or RD/4 octets


Normalized Throughput SNormalized Throughput S

1 W > RD / 4S = 4W W < RD / 4 RD


Figure 12.3 Window Scale Figure 12.3 Window Scale ParameterParameter


Complicating FactorsComplicating Factors

Multiple TCP connections are multiplexed over same network interface, reducing R and efficiency

For multi-hop connections, D is the sum of delays across each network plus delays at each router

If source data rate R exceeds data rate on one of the hops, that hop will be a bottleneck

Lost segments are retransmitted, reducing throughput. Impact depends on retransmission policy


Retransmission StrategyRetransmission Strategy

TCP relies exclusively on positive acknowledgements and retransmission on acknowledgement timeout

There is no explicit negative acknowledgement

Retransmission required when:1. Segment arrives damaged, as indicated by

checksum error, causing receiver to discard segment

2. Segment fails to arrive


TimersTimers

A timer is associated with each segment as it is sent

If timer expires before segment acknowledged, sender must retransmit

Key Design Issue: value of retransmission timer

Too small: many unnecessary retransmissions, wasting network bandwidth

Too large: delay in handling lost segment


Two StrategiesTwo Strategies

Timer should be longer than round-trip delay (send segment, receive ack)

Delay is variable

Strategies:1. Fixed timer2. Adaptive


Problems with Adaptive SchemeProblems with Adaptive Scheme

Peer TCP entity may accumulate acknowledgements and not acknowledge immediately

For retransmitted segments, can’t tell whether acknowledgement is response to original transmission or retransmission

Network conditions may change suddenly


Adaptive Retransmission TimerAdaptive Retransmission Timer

Average Round-Trip Time (ARTT) K + 1

ARTT(K + 1) = 1 ∑ RTT(i) K + 1 i = 1

= K ARTT(K) + 1 RTT(K + 1)

K + 1 K + 1


RFC 793 Exponential AveragingRFC 793 Exponential Averaging

Smoothed Round-Trip Time (SRTT)

SRTT(K + 1) = α × SRTT(K) + (1 – α) × SRTT(K + 1)

The older the observation, the less it is counted in the average.


Figure 12.4 Figure 12.4 Exponential Exponential Smoothing Smoothing CoefficientsCoefficients

=0.5=0.875


Figure 12.5 Figure 12.5 Exponential Exponential AveragingAveraging


RFC 793 Retransmission TimeoutRFC 793 Retransmission Timeout

RTO(K + 1) = Min(UB, Max(LB, β × SRTT(K + 1)))

UB, LB: prechosen fixed upper and lower bounds

Example values for α, β:

0.8 < α < 0.9 1.3 < β < 2.0


Implementation Policy OptionsImplementation Policy Options Send Deliver Accept

In-order In-window

Retransmit First-only Batch individual

Acknowledge immediate cumulative


TCP Congestion ControlTCP Congestion Control

Dynamic routing can alleviate congestion by spreading load more evenly

But only effective for unbalanced loads and brief surges in traffic

Congestion can only be controlled by limiting total amount of data entering network

ICMP source Quench message is crude and not effective

RSVP may help but not widely implemented


TCP Congestion Control is DifficultTCP Congestion Control is Difficult

IP is connectionless and stateless, with no provision for detecting or controlling congestion

TCP only provides end-to-end flow control

No cooperative, distributed algorithm to bind together various TCP entities


TCP Flow and Congestion ControlTCP Flow and Congestion Control

The rate at which a TCP entity can transmit is determined by rate of incoming ACKs to previous segments with new credit

Rate of Ack arrival determined by round-trip path between source and destination

Bottleneck may be destination or internet Sender cannot tell which Only the internet bottleneck can be due to

congestion


Figure 12.6 TCP Figure 12.6 TCP Segment PacingSegment Pacing


Figure 12.7 TCP Flow and Figure 12.7 TCP Flow and Congestion ControlCongestion Control


Retransmission Timer Retransmission Timer ManagementManagementThree Techniques to calculate retransmission

timer (RTO):1. RTT Variance Estimation2. Exponential RTO Backoff3. Karn’s Algorithm


RTT Variance EstimationRTT Variance Estimation(Jacobson’s Algorithm)(Jacobson’s Algorithm)3 sources of high variance in RTTIf data rate relative low, then transmission

delay will be relatively large, with larger variance due to variance in packet size

Load may change abruptly due to other sources

Peer may not acknowledge segments immediately


Jacobson’s AlgorithmJacobson’s AlgorithmSRTT(K + 1) = (1 – g) × SRTT(K) + g × RTT(K + 1)

SERR(K + 1) = RTT(K + 1) – SRTT(K)

SDEV(K + 1) = (1 – h) × SDEV(K) + h ×|SERR(K + 1)|

RTO(K + 1) = SRTT(K + 1) + f × SDEV(K + 1)

g = 0.125 h = 0.25 f = 2 or f = 4 (most current implementations use f = 4)


Figure 12.8 Figure 12.8 Jacobson’s RTO Jacobson’s RTO CalculationsCalculations


Two Other FactorsTwo Other Factors

Jacobson’s algorithm can significantly improve TCP performance, but:

What RTO to use for retransmitted segments? ANSWER: exponential RTO backoff algorithm

Which round-trip samples to use as input to Jacobson’s algorithm?ANSWER: Karn’s algorithm


Exponential RTO BackoffExponential RTO Backoff

Increase RTO each time the same segment retransmitted – backoff process

Multiply RTO by constant:

RTO = q × RTOq = 2 is called binary exponential backoff


Which Round-trip Samples?Which Round-trip Samples?

If an ack is received for retransmitted segment, there are 2 possibilities:

1. Ack is for first transmission

2. Ack is for second transmission TCP source cannot distinguish 2 cases No valid way to calculate RTT:

– From first transmission to ack, or– From second transmission to ack?


Karn’s AlgorithmKarn’s Algorithm

Do not use measured RTT for a retransmitted segment to update SRTT and SDEV

Calculate backoff RTO when a retransmission occurs

Use backoff RTO for segments until an ack arrives for a segment that has not been retransmitted

Then use Jacobson’s algorithm to calculate RTO


Window ManagementWindow Management

Slow startDynamic window sizing on congestionFast retransmitFast recoveryLimited transmit


Slow StartSlow Start

awnd = MIN[ credit, cwnd]whereawnd = allowed window in segmentscwnd = congestion window in segmentscredit = amount of unused credit granted in most

recent ackcwnd = 1 for a new connection and increased

by 1 for each ack received, up to a maximum


Figure 23.9 Effect of Figure 23.9 Effect of Slow StartSlow Start


Dynamic Window Sizing on CongestionDynamic Window Sizing on Congestion

A lost segment indicates congestionPrudent to reset cwsd = 1 and begin slow

start processMay not be conservative enough: “ easy to

drive a network into saturation but hard for the net to recover” (Jacobson)

Instead, use slow start with linear growth in cwnd


Figure 12.10 Slow Figure 12.10 Slow Start and Congestion Start and Congestion AvoidanceAvoidance


Figure 12.11 Illustration of Slow Figure 12.11 Illustration of Slow Start and Congestion AvoidanceStart and Congestion Avoidance


Fast RetransmitFast Retransmit

RTO is generally noticeably longer than actual RTT

If a segment is lost, TCP may be slow to retransmit

TCP rule: if a segment is received out of order, an ack must be issued immediately for the last in-order segment

Fast Retransmit rule: if 4 acks received for same segment, highly likely it was lost, so retransmit immediately, rather than waiting for timeout


Figure 12.12 Fast Figure 12.12 Fast RetransmitRetransmit


Fast RecoveryFast Recovery

When TCP retransmits a segment using Fast Retransmit, a segment was assumed lost

Congestion avoidance measures are appropriate at this point

E.g., slow-start/congestion avoidance procedure This may be unnecessarily conservative since

multiple acks indicate segments are getting through

Fast Recovery: retransmit lost segment, cut cwnd in half, proceed with linear increase of cwnd

This avoids initial exponential slow-start


Figure 12.13 Fast Figure 12.13 Fast Recovery ExampleRecovery Example


Limited TransmitLimited Transmit

If congestion window at sender is small, fast retransmit may not get triggered, e.g., cwnd = 3

1. Under what circumstances does sender have small congestion window?

2. Is the problem common?3. If the problem is common, why not reduce

number of duplicate acks needed to trigger retransmit?


Limited Transmit AlgorithmLimited Transmit Algorithm

Sender can transmit new segment when 3 conditions are met:

1. Two consecutive duplicate acks are received

2. Destination advertised window allows transmission of segment

3. Amount of outstanding data after sending is less than or equal to cwnd + 2

Chapter 12 TCP Traffic Control 1 Chapter 12 TCP Traffic Control.

Documents

Transcript of Chapter 12 TCP Traffic Control 1 Chapter 12 TCP Traffic Control.