Transport Control Protocol: Outline

Transport Control Protocol
Outline
TCP objectives revisited TCP basics New algorithms for RTO calculation
CS 640
TCP Overview
TCP is the most widely used Internet protocol
Web, Peer-to-peer, FTP, telnet,
A two way, reliable, byte stream oriented end-to-end protocol

Includes flow and congestion control
Closely tied to the Internet Protocol (IP) A focus of intense study for many years
Our goal is to understand the RENO version of TCP
RENO is most widely used TCP today RFC 2001 (now expired) RENO mainly specifies mechanisms for dealing with congestion
CS 640 2
TCP Features
Connection-oriented Byte-stream
app writes bytes TCP sends segments app reads bytes
Reliable data transfer

Application process Write bytes
Full duplex Flow control: keep sender from overrunning receiver Congestion control: keep sender from overrunning network
Application process Read bytes
TCP Send buffer
TCP Receive buffer
Segment
Segment
Segment
Transmit segments
CS 640
Segment Format
0 4 10 SrcPort SequenceNum Acknowledgment HdrLen 0 Checksum Options (v ariable) Data Flags Adv ertisedWindow UrgPtr 16 DstPort 31
CS 640
Segment Format (cont)

Each connection identified with 4-tuple:
(SrcPort, SrcIPAddr, DsrPort, DstIPAddr)
Sliding window + flow control

acknowledgment, SequenceNum, AdvertisedWinow
Data(SequenceNum) Sender Acknowledgment + AdvertisedWindow Receiver
Flags
SYN, FIN, RESET, PUSH, URG, ACK
Checksum is the same as UDP

pseudo header + TCP header + data
CS 640 5
Sequence Numbers
32 bit sequence numbers
Wrap around supported
TCP breaks byte stream from application into packets (limited by Max. Segment Size) Each byte in the data stream is considered Each packet has a sequence number
Initial number selected at connection time Subsequent numbers indicate first data byte number in packet
ACKs indicate next byte expected

CS 640 6
Sequence Number Wrap Around

Bandwidth T1 (1.5 Mbps) Ethernet (10 Mbps) T3 (45 Mbps) FDDI (100 Mbps) STS-3 (155 Mbps) STS-12 (622 Mbps) STS-24 (1.2 Gbps) Time Until Wrap Around 6.4 hours 57 minutes 13 minutes 6 minutes 4 minutes 55 seconds 28 seconds
Protect against this by adding a 32-bit timestamp to TCP header

CS 640 7
Connection Establishment
Active participant (client) Passive participant (server)
CS 640
Connection Termination
Active participant (server) Passive participant (client)
CS 640
State Transition Diagram

CLOSED Active open/SYN Passive open Close Close LISTEN
SYN_RCVD
SYN/SYN + ACK Send/SYN SYN/SYN + ACK ACK SYN + ACK/ACK
SYN_SENT
Close/FIN
ESTABLISHED
Close/FIN FIN_WAIT_1 FIN/ACK ACK FIN_WAIT_2 CLOSING
FIN/ACK CLOSE_WAIT Close/FIN LAST_ACK ACK CLOSED
FIN/ACK
ACK Timeout after two segment lifetimes TIME_WAIT
CS 640
10
Reliability in TCP
Checksum used to detect bit level errors Sequence numbers used to detect sequencing errors
Duplicates are ignored Reordered packets are reordered (or dropped) Lost packets are retransmitted
Timeouts used to detect lost packets

Requires RTO calculation Requires sender to maintain data until it is ACKed
CS 640 11
Sliding Window Revisited

Sending application Receiving application
TCP LastByteWritten LastByteRead
TCP
LastByteAcked
LastByteSent
NextByteExpected
LastByteRcvd
Sending side
LastByteAcked < = LastByteSent LastByteSent < = LastByteWritten buffer bytes between LastByteAcked and LastByteWritten
Receiving side
LastByteRead < NextByteExpected NextByteExpected < = LastByteRcvd +1 buffer bytes between NextByteRead and LastByteRcvd
CS 640 12
Flow Control in TCP

Send buffer size: MaxSendBuffer Receive buffer size: MaxRcvBuffer Receiving side
LastByteRcvd - LastByteRead < = MaxRcvBuffer AdvertisedWindow = MaxRcvBuffer - (LastByteRcvd LastByteRead)
Sending side
LastByteSent - LastByteAcked < = AdvertisedWindow EffectiveWindow = AdvertisedWindow - (LastByteSent LastByteAcked) LastByteWritten - LastByteAcked < = MaxSendBuffer block sender if (LastByteWritten - LastByteAcked) + y > MaxSenderBuffer
Always send ACK in response to arriving data segment Persist sending one byte seg. when AdvertisedWindow = 0
CS 640 13
Keeping the Pipe Full

16-bit AdvertisedWindow controls amount of pipelining Assume RTT of 100ms Add scaling factor extension to header to enable larger windows
Bandwidth T1 (1.5 Mbps) Ethernet (10 Mbps) T3 (45 Mbps) FDDI (100 Mbps) OC-3 (155 Mbps) OC-12 (622 Mbps) OC-24 (1.2 Gbps) Delay x Bandwidth Product 18KB 122KB 549KB 1.2MB 1.8MB 7.4MB 14.8MB
CS 640 14
Making TCP More Efficient

Delayed acknowledgements
Delay for about 200ms Try to piggyback ACKs with data
Acknowledge every other packet

Many instances in transmission sequence which require an ACK
Dont forget Nagles algorithm

Can be switched off
CS 640 15
Karn/Partridge Algorithm for RTO

Sender Receiver Sender Receiver SampleR TT SampleR TT CS 640
Two degenerate cases with timeouts and RTT measurements

Solution: Do not sample RTT when retransmitting
After each retransmission, set next RTO to be double the value of the last
Exponential backoff is well known control theory method Loss is most likely caused by congestion so be careful
16
Jacobson/ Karels Algorithm

In late 80s, Internet was suffering from congestion collapse New Calculations for average RTT Jacobson 88 Variance is not considered when setting timeout value
If variance is small, we could set RTO = EstRTT If variance is large, we may need to set RTO > 2 x EstRTT
New algorithm calculates both variance and mean for RTT Diff = sampleRTT - EstRTT EstRTT = EstRTT + ( d x Diff) Dev = Dev + d ( |Diff| - Dev) Initially settings for EstRTT and Dev will be given to you
where d is a factor between 0 and 1 typical value is 0.125
CS 640 17
Jacobson/ Karels contd.

TimeOut = m x EstRTT + f x Dev
where m = 1 and f = 4
When variance is small, TimeOut is close to EstRTT When variance is large Dev dominates the calculation Another benefit of this mechanism is that it is very efficient to implement in code (does not require floating point) Notes
algorithm only as good as granularity of clock (500ms on Unix) accurate timeout mechanism important to congestion control (later)
These issues have been studied and dealt with in new RFCs for RTO calculation. TCP RENO uses Jacobson/Karels
CS 640 18

Transport Control Protocol: Outline

Uploaded by

Copyright:

Available Formats

Transport Control Protocol: Outline

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Transport Control Protocol: Outline

Uploaded by

Copyright:

Available Formats

Transport Control Protocol

A two way, reliable, byte stream oriented end-to-end protocol

Reliable data transfer

TCP Send buffer

TCP Receive buffer

Segment Format (cont)

Sliding window + flow control

SYN, FIN, RESET, PUSH, URG, ACK

Checksum is the same as UDP

ACKs indicate next byte expected

Sequence Number Wrap Around

Protect against this by adding a 32-bit timestamp to TCP header

State Transition Diagram

SYN/SYN + ACK Send/SYN SYN/SYN + ACK ACK SYN + ACK/ACK

Close/FIN FIN_WAIT_1 FIN/ACK ACK FIN_WAIT_2 CLOSING

FIN/ACK CLOSE_WAIT Close/FIN LAST_ACK ACK CLOSED

ACK Timeout after two segment lifetimes TIME_WAIT

Timeouts used to detect lost packets

Sliding Window Revisited

TCP LastByteWritten LastByteRead

Flow Control in TCP

Keeping the Pipe Full

Making TCP More Efficient

Acknowledge every other packet

Dont forget Nagles algorithm

Karn/Partridge Algorithm for RTO

Two degenerate cases with timeouts and RTT measurements

Jacobson/ Karels Algorithm

Jacobson/ Karels contd.

You might also like