Chapter 3

Transport
Layer
A note on the use of these PowerPoint slides:
We’re making these slides freely available to all (faculty, students,
readers). They’re in PowerPoint form so you see the animations; and
can add, modify, and delete slides (including this one) and slide content
to suit your needs. They obviously represent a lot of work on our part.
In return for use, we only ask the following:
 If you use these slides (e.g., in a class) that you mention their source (after all,
we’d like people to use our book!)
 If you post any slides on a www site, that you note that they are adapted from
(or perhaps identical to) our slides, and note our copyright of this material.

For a revision history, see the slide note for this page. Computer Networking: A
Thanks and enjoy! JFK/KWR Top-Down Approach
8th edition
All material copyright 1996-2020
J.F Kurose and K.W. Ross, All Rights Reserved Jim Kurose, Keith Ross
Pearson, 2020
*With some modifications by Dr. Abdullah bin Ali, Taibah University, Saudi Arabia
Transport Layer: 3-1
Ch3: Transport layer: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-2

*Transport Layer services and protocols
application
transport

 transport Layer Protocols provide mobile

network
network
data link
physical
logical communication between national or global ISP

application processes running on

log
ica
different hosts

le
 transport protocols actions in end

nd
-e
systems:

nd
local or

tra
• sender: breaks application messages regional ISP

n sp
into segments, passes to network layer

ort
home network content
• receiver: reassembles segments into provider
network
messages, passes to application layer application
transport
datacenter
network
network
 two transport protocols available to data link
physical

Internet applications enterprise

• TCP: Transport Control Protocol network

• UDP: User Datagram Protocol

Transport Layer: 3-3
 *Transport vs. network layer services and protocols
 network layer: Provides logical
communication between hosts
 transport layer: Provides logical
communication between
processes
• relies on, enhances, network layer
services
household analogy:
12 kids in Ann’s house sending letters to
12 kids in Bill’s house:
 hosts = houses
 processes = kids
 Sockets = Doors
 app messages = letters in envelopes
 transport protocol :
 = Ann who MUX (Collects) letters from kids
 = Bill who DEMUX (distributes) letters to kids
 network-layer protocol = postal service
Transport Layer: 3-4
*Transport Layer Actions
Receiver:
Sender:

Sender:
application  is passed an application- app. msg
application
layer message
transport
 determines segment TTh htransport
app. msg
header fields values
network (IP)
 creates segment network (IP)

link
 passes segment to IP link

physical physical

Transport Layer: 3-5

*Transport Layer Actions
= the Previous Slide without animation
Receiver: Sender:
Sender:
application  is passed an application- app. msg
application
layer message
transport
 determines segment TTh htransport
app. msg
header fields values
network (IP)
 creates segment network (IP)

link
 passes segment to IP link

physical physical

Transport Layer: 3-6

*Transport Layer Actions
Receiver:
Sender:

Receiver:
application  receives segment from IP application
 checks header values
app. msg
transport  extracts application-layer transport
message
network (IP)  demultiplexes message up network (IP)

link to application via socket link

physical physical
Th app. msg

Transport Layer: 3-7

Transport Layer Actions
= the Previous Slide without animation
Receiver:
Sender:

Receiver:
application  receives segment from IP application
 checks header values
app. msg
transport  extracts application-layer transport
message
network (IP)  demultiplexes message up network (IP)

link to application via socket link

physical physical
Th app. msg

Transport Layer: 3-8

*Two principal Internet transport protocols
application
transport
 TCP: Transmission Control Protocol mobile
network
network
data link
• Connection Oriented (= connection setup) physical
national or global ISP
• reliable

log
• congestion control

ica
• flow control

nd le
• in-order delivery

-end
 UDP: User Datagram Protocol local or

tra
regional ISP
• Connectionless oriented (= no connection setup)

n sp
• unreliable,

ort
home network content
• unordered delivery: provider
network
• no congestion control application
transport
datacenter
network

• no flow control network

data link

 services NOT available in TCP nor UDP: physical

• Min delay guarantee enterprise

network
• Min Thruput guarantee
• Security Transport Layer: 3-9
Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-10

Multiplexing/demultiplexing
multiplexing at sender:
handle data from multiple
sockets, add transport header
(later used for demultiplexing)
demultiplexing at receiver:
use header info to deliver
received segments to correct
socket

application

application P1 P2 application socket

P3 transport P4
process
transport network transport
network link network
link physical link
physical physical

Transport Layer: 3-11

How demultiplexing works
 host receives IP datagrams 32 bits
• each datagram has source IP source port # dest port #
address, destination IP address
• each datagram carries one other header fields
transport-layer segment
• each segment has source,
application
destination port number data
 host uses IP addresses & port (payload)
numbers to direct segment to
appropriate socket TCP/UDP segment format

Transport Layer: 3-12

Connectionless demultiplexing
Recall:
 when creating socket, must
specify host-local port #:
DatagramSocket mySocket1 = new
DatagramSocket(12534);
 when creating datagram to
send into UDP socket, must
IP/UDP datagrams with same dest.
specify
• destination IP address
• destination port #
when receiving host receives
UDP segment:
• checks destination port # in
segment
• directs UDP segment to socket
with that port #
port #, but different source IP
addresses and/or source port
numbers will be directed to same
socket at receiving host
Transport Layer: 3-13
 Connectionless (UDP) demultiplexing: an example
DatagramSocket
serverSocket = new
DatagramSocket
DatagramSocket mySocket2 = DatagramSocket mySocket1 =
new DatagramSocket (6428); new DatagramSocket (5775);
(9157); application
application P1 application
P3 P4
transport
transport transport
network
network link network
link physical link
physical physical

source port: 6428 source port: ?

dest port: 9157 dest port: ?

source port: 9157 source port: ?

dest port: 6428 dest port: ?
Transport Layer: 3-14
*Connection-oriented (TCP) demultiplexing
 TCP socket identified by  server may support many
4- values (tuple): simultaneous TCP sockets:
• source IP address • each socket identified by its
• source port number own 4-tuple
• dest IP address
• dest port number
 demux: receiver uses all
4 values (tuple) to direct
segment to appropriate
socket
Transport Layer: 3-15
*Connection-oriented (TCP) demultiplexing: example
Port# 9157 Port# 5775 Port# 9157
application
application P4 P5 P6 application
P1 P2 P3
transport
transport transport
network
network link network
link physical link
physical server: IP physical
Web server address B

host: IP source IP,port: B,80 host: IP

address A dest IP,port: A,9157 source IP,port: C,5775 address C
dest IP,port: B,80
source IP,port: A,9157
dest IP, port: B,80
source IP,port: C,9157
dest IP,port: B,80
Three segments, all destined to IP address: B,
dest port: 80 are demultiplexed to different sockets (of P4, P5 and P6)
Transport Layer: 3-16
Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-17

*UDP: User Datagram Protocol
Why is there a UDP?
 “best effort” Internet
transport protocol,  no connection
establishment (which can
• = UDP segments may be: add RTT delay)
• lost  simple: no connection state
• delivered out-of-order to at sender, receiver
app  small header size
 connectionless:  no congestion control
• no connection setup (no handshaking)  UDP can blast away as fast as
between UDP sender, receiver desired!
• each UDP segment handled  can function in the face of
independently of others congestion

Transport Layer: 3-18

*UDP: User Datagram Protocol
 UDP used for :
 streaming multimedia apps (loss tolerant, rate sensitive)
 DNS: Domain Name System (Service)
 SNMP: Simple Network Management Protocol
 HTTP/3: Hypertext Transfer Protocol v3
 if reliable transfer needed over UDP (e.g., HTTP/3):
 add needed reliability at application layer
 add congestion control at application layer

Transport Layer: 3-19

 *UDP segment format (structure)
32 bits
source port # dest port #
UDP Header
length checksum

For error detection

length, in bytes of (next slide)
UDP segment, application
including header data
(payload)

data to/from
UDP segment format application layer

Transport Layer: 3-20

UDP checksum
Goal: detect errors (i.e., flipped bits) in transmitted segment
sender: receiver:
 Compute checksum value  compute checksum of received
then put it into UDP segment
checksum field
 check if computed checksum equals
checksum field value:
• If Not equal  error detected
• If Equal  no error detected.
• But maybe errors nonetheless? More later
….

Transport Layer: 3-21

Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-22

 *Principles of reliable and unreliable data transfer
*Reliable= No error and no loss *Unreliable = errors OR loss MAY happen

sending receiving sending receiving

process process process process
application data data application data data
transport transport
reliable channel
sender-side of receiver-side
reliable service abstraction reliable data of reliable data
transfer protocol transfer protocol

transport
network
unreliable channel

reliable service implementation

Transport Layer: 3-23

*Principles of reliable and unreliable data transfer

sending receiving
process process
application data data
transport

sender-side of receiver-side
Complexity of reliable data reliable data
transfer protocol
of reliable data
transfer protocol
transfer protocol will depend
(strongly) on characteristics of transport
network
unreliable channel (lose, unreliable channel
corrupt, reorder data?)
reliable service implementation

Transport Layer: 3-24

 *Principles of reliable and unreliable data transfer

sending receiving
process process
application data data
transport
Sender, receiver do not know the
“state” of each other, e.g., was a sender-side of receiver-side
reliable data of reliable data
message received? transfer protocol transfer protocol
 unless communicated via a message
 e.g.: receiver sends transport
network
“Acknowledgment (ACK)” unreliable channel

message: reliable service implementation

 Received correctly
 There is error or loss Transport Layer: 3-25
 *Data Communication over channels with errors

Assumption 1: underlying channel approach: sender sends packet(s) then

can have errors in packets (data, waits “reasonable” amount of time
ACKs) for Acknowledgment (ACK)
 retransmits if no ACK received in this time
 if pkt (or ACK) just delayed (not lost):
• retransmission will be duplicate, but
seq. #’s already handles this
• receiver must specify seq # of pkt being
ACKed
 requires countdown timer

Transport Layer 3-26

*Data Communication over channels with Loss

Assumption 2: underlying channel approach: sender waits “reasonable”

can also lose packets (data, ACKs) amount of time for ACK
 retransmits if no ACK received in this time
 if pkt (or ACK) just delayed (not lost):
• retransmission will be duplicate, but seq.
#’s already handles this
• receiver must specify seq # of pkt being
ACKed
 requires countdown timer

Transport Layer 3-27

 *Examples on How Data Communication
Works

sender receiver sender receiver

send pkt0 pkt0 send pkt0 pkt0
rcv pkt0 rcv pkt0
ack0 send ack0 ack0 send ack0
rcv ack0 rcv ack0
send pkt1 pkt1 send pkt1 pkt1
rcv pkt1 X
ack1 send ack1 loss
rcv ack1
send pkt0 pkt0
rcv pkt0 timeout
ack0 send ack0 resend pkt1 pkt1
rcv pkt1
?? ack1 send ack1
rcv ack1
send pkt0 pkt0
rcv pkt0
ack0 send ack0
??

(a) no loss (b) packet loss

Transport Layer 3-28
 *Examples on How Data Communication Works
sender receiver
sender receiver send pkt0 pkt0
send pkt0 pkt0 rcv pkt0
ack0 send ack0
rcv pkt0
send ack0 rcv ack0
ack0 send pkt1 pkt1
rcv ack0 rcv pkt1
send pkt1 pkt1
rcv pkt1 send ack1
ack1 ack1
send ack1
X
loss timeout
resend pkt1 pkt1
rcv pkt1
timeout
resend pkt1 pkt1 rcv ack1 pkt0 (detect duplicate)
rcv pkt1 send pkt0 send ack1
(detect duplicate) ack1
ack1 send ack1 rcv ack1 rcv pkt0
rcv ack1 ack0 send ack0
pkt0 send pkt0 pkt0
send pkt0 rcv pkt0
rcv pkt0 ack0 (detect duplicate)
ack0 send ack0 send ack0
??
??
(c) ACK loss (d) premature timeout/ delayed ACK

Transport Layer 3-29

 stop-and-wait operation*
sender receiver
first packet bit transmitted, t = 0
last packet bit transmitted, t = L / R

first packet bit arrives

Round Trip Time last packet bit arrives, send ACK
(RTT )

ACK arrives, send next

packet, t = RTT + L / R

Example:
Calculate Utilization of sender if: t=.008 ms, RTT= 30 ms.

U L/R .008
sender = = = 0.00027 = 27/100,000. (Very bad utilization)
RTT + L / R 30.008

Transport Layer 3-30

*Pipelined protocols operation
pipelining: sender allows multiple, “in-flight”, yet-
to-be-acknowledged pkts
• range of sequence numbers must be increased
• buffering at sender and/or receiver

two generic forms of pipelined protocols: go-Back-N,

selective repeat
Transport Layer 3-31
 *Pipelined protocols: overview
Go-back-N:
 sender can have up to N unacked packets in pipeline
 receiver only sends a cumulative ack
• doesn’t ack packet if there’s a gap
 sender has timer for oldest unacked packet
• when timer expires, retransmit all unacked packets

Transport Layer 3-32

Go-Back-N: sender
 sender: “window” of up to N, consecutive transmitted but unACKed pkts
• k-bit seq # in pkt header

 cumulative ACK: ACK(n): ACKs all packets up to, including seq # n

• on receiving ACK(n): move window forward to begin at n+1
 timer for oldest in-flight packet
 timeout(n): retransmit packet n and all higher seq # packets in window
Transport Layer: 3-33
 *GBN in action
Seq#: 0-8, just an example
sender window size (N=4) sender receiver
012345678 send pkt0
012345678 send pkt1
send pkt2 receive pkt0, send ack0
012345678
send pkt3 Xloss receive pkt1, send ack1
012345678
(wait)
receive pkt3, discard,
012345678 rcv ack0, send pkt4 (re)send ack1
012345678 rcv ack1, send pkt5 receive pkt4, discard,
(re)send ack1
ignore duplicate ACK receive pkt5, discard,
(re)send ack1
pkt 2 timeout
012345678 (re)send pkt2
012345678 (re)send pkt3
012345678 (re)send pkt4 rcv pkt2, deliver, send ack2
012345678 (re)send pkt5 rcv pkt3, deliver, send ack3
rcv pkt4, deliver, send ack4
rcv pkt5, deliver, send ack5

Transport Layer 3-34

*Selective repeat
 sender can have up to N unacked packets in pipeline
 receiver sends individual ack for all correctly received packets
• buffers packets, as needed, for eventual in-order delivery to upper
layer
 sender times-out/retransmits individually for unACKed packets
• sender maintains timer for each unACKed pkt
 sender window
• N consecutive seq #s
• limits seq #s of sent, unACKed packets

Transport Layer: 3-35

*Selective repeat: sender, receiver windows

Transport Layer: 3-36

Selective repeat: sender and receiver
sender
data from above:
 if next available seq # in
window, send packet
timeout(n):
 resend packet n, restart timer
ACK(n) in [sendbase,sendbase+N]:
 mark packet n as received
 if n smallest unACKed packet,
advance window base to next
unACKed seq #
receiver
packet n in [rcvbase, rcvbase+N-1]
 send ACK(n)
 out-of-order: buffer
 in-order: deliver (also deliver
buffered, in-order packets),
advance window to next not-yet-
received packet
packet n in [rcvbase-N,rcvbase-1]
 ACK(n)
otherwise:
 ignore
Transport Layer: 3-37
Selective Repeat in action
sender window (N=4) sender receiver
012345678 send pkt0
012345678 send pkt1
012345678 send pkt2 receive pkt0, send ack0
012345678 send pkt3 Xloss receive pkt1, send ack1
(wait)
receive pkt3, buffer,
012345678 rcv ack0, send pkt4 send ack3
012345678 rcv ack1, send pkt5
receive pkt4, buffer,
record ack3 arrived send ack4
receive pkt5, buffer,
pkt 2 timeout send ack5
012345678 REsend pkt2
012345678 (but not 3,4,5)
012345678 rcv pkt2; deliver pkt2,
012345678 pkt3, pkt4, pkt5; send ack2

Q: what happens when ack2 arrives?

Transport Layer: 3-38

Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
• segment structure
• reliable data transfer
• flow control
• connection management
 Principles of congestion control
 TCP congestion control
Transport Layer: 3-39
 *TCP: overview
connection-oriented:
 handshaking (exchange of
control msgs) inits sender,
receiver state before data
exchange
 reliable (No Loss)
 in-order delivery :
flow controlled:
 sender will not overwhelm
receiver
Congestion controlled:
 sender will not overwhelm
network
RFCs: 793,1122, 2018, 5681, 7323
 pipelined:
• TCP congestion and flow
control set window size
full duplex data:
 bi-directional data flow in
same connection
 MSS: maximum segment
size
 point-to-point:
• one sender, one receiver
Transport Layer: 3-40
 *TCP segment structure (format)
ACK: seq # of next expected
byte; A bit: this is an ACK
length (of TCP header)
Internet checksum
C, E: congestion notification
TCP options
RST, SYN, FIN: connection
management
32 bits
source port # dest port # segment seq #: counting
sequence number bytes of data into bytestream
(not segments!)
acknowledgement number
head not
len used C EUAP R SF receive window flow control: # bytes
checksum Urg data pointer receiver willing to accept
options (variable
length)
application data sent by an
data application layer
(variable length) protocol into TCP socket
Transport Layer: 3-41
*TCP round trip time (RTT), timeout
Q: how to set TCP timeout
value?
 longer than RTT, but RTT varies!
 too short: premature timeout,
unnecessary retransmissions
 too long: slow reaction to
segment loss
Q: how to estimate RTT?
 SampleRTT:measured time
from segment transmission until
ACK receipt
• ignore retransmissions
 SampleRTT will vary, want
estimated RTT “smoother”
• average several recent
measurements, not just current
SampleRTT
Transport Layer: 3-42
 *TCP round trip time (RTT),
timeout
Timeout= EstimatedRTT + Safety_Margin_Time
RTT: gaia.cs.umass.edu to fantasia.eurecom.fr

350

RTT: gaia.cs.umass.edu to fantasia.eurecom.fr

300

RTT (milliseconds)
RTT (milliseconds) 250

200

150
sampleRTT

EstimatedRTT
100
1 8 15 22 29 36 43 50 57 64 71 78 85 92 99 106
time (seconnds)

SampleRTT Estimated RTT

time (seconds)

Transport Layer 3-43

TCP Sender (simplified)
event: data received from
application
 create segment with seq #
 seq # is byte-stream number
of first data byte in segment
 start timer if not already
running
• think of timer as for oldest
unACKed segment
• expiration interval:
TimeOutInterval
event: timeout
 retransmit segment that
caused timeout
 restart timer
event: ACK received
 if ACK acknowledges
previously unACKed segments
• update what is known to be
ACKed
• start timer if there are still
unACKed segments
Transport Layer: 3-44
 *TCP: retransmission scenarios
Host A Host B Host A Host B

SendBase=92
Seq=92*, rwnd= 8 bytes of data Seq=92, 8 bytes of data

Seq=100, 20 bytes of data

timeout

timeout
ACK=100
X
ACK=100
ACK=120, rwnd=10 B

Seq=92, rwnd= 8 bytes of data Seq=92, 8

SendBase=100 bytes of data send cumulative
SendBase=120 ACK for 120
ACK=100, rwnd= 15B

SendBase=120 ACK=120, rwnd=10 B

lost ACK scenario premature timeout

*Seq=92: Assumed Number Transport Layer: 3-45

TCP: retransmission scenarios
Host A Host B

Seq=92, 8 bytes of data

Seq=100, 20 bytes of data

ACK=100
X
ACK=120, rwnd=15 B

Seq=120, 15 bytes of data

cumulative ACK covers *cumulative ACK 120 avoids retransmission of

for earlier lost ACK the first segment (Seq=92, 8 bytes of data)

Transport Layer: 3-46

TCP fast retransmit
Host A Host B
TCP fast retransmit
if sender receives 3 additional
Seq=92
ACKs for same data (“triple Seq=1
, 8 bytes
of data
duplicate ACKs”), resend unACKed 0 0, 20 b
ytes o
f data
segment with smallest seq # X
 likely that unACKed segment lost,
=100
so don’t wait for timeout ACK

=100

timeout
ACK
CK =100
A
=100
Receipt of three duplicate ACKs ACK

indicates 3 segments received Seq=100, 20 bytes of data

after a missing segment – lost

segment is likely. So retransmit!

Transport Layer: 3-47

Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
• segment structure
• reliable data transfer
• flow control
• connection management
 Principles of congestion control
 TCP congestion control
Transport Layer: 3-48
 **TCP flow control
Q: What happens if network layer application
delivers data faster than Application removing
process

application layer removes data data from TCP socket

buffers
from socket buffers? TCP socket
A: TCP socket receiver buffer will receiver buffers

be over-loaded (or overflow)

TCP
code
Q: How to solve it? Network layer
delivering IP datagram
A: Using TCP Flow Control payload into TCP
IP
• Next slide socket buffers code

from sender

receiver protocol stack

Transport Layer: 3-49

 *TCP flow control
flow control application
receiver controls sender, so sender Application removing
process

won’t over-load (overflow) receiver’s data from TCP socket

buffer by transmitting too much, too fast buffers
TCP socket
receiver buffers

TCP
code

receive window
flow control: # bytes
receiver willing to accept IP
code

from sender

receiver protocol stack

Transport Layer: 3-50

TCP flow control
 TCP receiver “advertises” free buffer
space in rwnd field in TCP header to application process
• RcvBuffer size set via socket
options (typical default is 4096 bytes) RcvBuffer buffered data
• many operating systems autoadjust
rwnd free buffer space
RcvBuffer
 sender limits amount of unACKed
(“in-flight”) data to received rwnd TCP segment payloads

 guarantees receive buffer will not TCP receiver-side buffering

overflow

Transport Layer: 3-51

TCP connection management
before exchanging data, sender/receiver “handshake”:
 agree to establish connection (each knowing the other willing to establish connection)
 agree on connection parameters (e.g., starting seq #s)

application application

connection state: ESTAB connection state: ESTAB

connection variables:
seq # client-to-server
server-to-client
rcvBuffer size
at server,client
connection Variables:
seq # client-to-server
server-to-client
rcvBuffer size
at server,client

network network

Socket clientSocket = Socket connectionSocket =

newSocket("hostname","port number"); welcomeSocket.accept();
Transport Layer: 3-52
 *TCP 3-way handshake (Connection Setup)
Client state Server state
serverSocket = socket(AF_INET,SOCK_STREAM)
serverSocket.bind((‘’,serverPort))
serverSocket.listen(1)
clientSocket = socket(AF_INET, SOCK_STREAM) connectionSocket, addr = serverSocket.accept()
LISTEN
clientSocket.connect((serverName,serverPort)) LISTEN
choose init seq num, x
send TCP SYN msg
SYNSENT SYNbit=1, Seq=x
choose init seq num, y
send TCP SYNACK
msg, acking SYN SYN RCVD
SYNbit=1, Seq=y
ACKbit=1; ACKnum=x+1
received SYNACK(x)
ESTAB indicates server is live;
send ACK for SYNACK;
this segment may contain ACKbit=1, ACKnum=y+1
client-to-server data
received ACK(y)
indicates client is live
ESTAB

Transport Layer: 3-53

 *TCP 3-way handshake (Connection Setup)
Remember (from Slide 43):

Transport Layer: 3-54

Closing a TCP connection
 client, server each close their side of connection
• send TCP segment with FIN bit = 1
 respond to received FIN with ACK
• on receiving FIN, ACK can be combined with own FIN
 simultaneous FIN exchanges can be handled

Transport Layer: 3-55

*TCP: closing a connection
client state server state
ESTAB ESTAB
clientSocket.close()
FIN_WAIT_1 can no longer FINbit=1, seq=x
send but can
receive data CLOSE_WAIT
ACKbit=1; ACKnum=x+1
can still
FIN_WAIT_2 wait for server send data
close

LAST_ACK
FINbit=1, seq=y
TIMED_WAIT can no longer
send data
ACKbit=1; ACKnum=y+1
timed wait
for 2*max CLOSED
segment lifetime

CLOSED

Transport Layer 3-56

Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-57

 *Principles of congestion control
Congestion:
 informally: “too many sources sending too
much data too fast for network to handle”
 different from flow control!
 Manifestations (indicators :
• long delays (queueing in router buffers)
• packet loss (buffer overflow at routers)
 a top-10 problem! congestion control:
 Q: How to solve it? too many senders,
sending too fast
 A: Using TCP Congestion Control
 controlling sender, so it won’t over-load the network by flow control: one sender
transmitting too much, too fast
too fast for one receiver
 Next slide
Transport Layer: 3-58
Chapter 3: roadmap
 Transport-layer services
 Multiplexing and demultiplexing
 Connectionless transport: UDP
 Principles of reliable data transfer
 Connection-oriented transport: TCP
 Principles of congestion control
 TCP congestion control

Transport Layer: 3-59

*TCP congestion control: AIMD (Additive Increase Multiplicative
Decrease)
 approach: senders can increase sending rate until packet loss (congestion) occurs, then decrease sending
rate on loss event
 How is it implemented?
 additive increase: sender increases transmission rate (congestion window size) cwnd by 1 MSS every
RTT until loss detected.
 MSS: Maximum Segment Size. RTT: Round Trip Time
 multiplicative decrease: cut cwnd in half after loss
 AIMD Behavior is called SAW Tooth Behavior
  cwnd is dynamic, function of perceived network congestion
additively increase window size …
congestion window size …. until loss occurs (then cut window in half)
cwnd: TCP sender

AIMD saw tooth

behavior: probing
for bandwidth

time Transport Layer 3-60

TCP slow start
Host A Host B
 when connection begins,
increase rate exponentially
one segm
until first loss event: ent

RTT
• initially cwnd = 1 MSS two segm
ents
• double cwnd every RTT
• done by incrementing cwnd
for every ACK received four segm
ents

 summary: initial rate is

slow, but ramps up
exponentially fast time

Transport Layer: 3-61

 **TCP: from slow start to congestion avoidance
Tahoe / Reno Algorithms

 ssthresh: slow start threshold. MSS: Maximum Segment Size

 For Transmission. Rounds 1-8, Tahoe and Reno are identical till loss happens. Then:
 ssthresh2= 0.5 Last_Max_cwnd= (in the figure = 0.5*12= 6 MSS),
 Tahoe_cwnd cut to 1MSS always, then increases exponentially to ssthresh2, then Linearly till loss
happens .
 Reno_cwnd cut to = 0.5 Last_Max_cwnd= (in the figure = 6 MSS), then increases Linearly till loss
happens .
* Check out the online interactive exercises for more examples: http://gaia.cs.umass.edu/kurose_ross/interactive/ Transport Layer
https://gkf168.files.wordpress.com/2012/05/tahoe-reno.png?w=546&h=304 3-62
Chapter 3: summary
 principles behind transport Up next:
layer services:  leaving the network
• multiplexing, demultiplexing “edge” (application,
• reliable data transfer transport layers)
• flow control  into the network “core”
• congestion control
 two network-layer
 instantiation, implementation chapters:
in the Internet • data plane
• UDP • control plane
• TCP

Transport Layer: 3-63