Transport Layer Part 2

Transport Layer 3-1

Rdt1.0: reliable transfer over a reliable channel

r underlying channel perfectly reliable

m no bit errors
m no loss of packets
r separate FSMs for sender, receiver:
m sender sends data into underlying channel
m receiver read data from underlying channel

Wait for rdt_send(data) Wait for rdt_rcv(packet)

call from call from extract (packet,data)
above packet = make_pkt(data) below deliver_data(data)
udt_send(packet)

sender receiver

Transport Layer 3-2

rdt2.0: FSM specification
rdt_send(data)
snkpkt = make_pkt(data, checksum) receiver
udt_send(sndpkt)
rdt_rcv(rcvpkt) &&
isNAK(rcvpkt)
Wait for Wait for rdt_rcv(rcvpkt) &&
call from ACK or udt_send(sndpkt) corrupt(rcvpkt)
above NAK
udt_send(NAK)

rdt_rcv(rcvpkt) && isACK(rcvpkt)

Wait for
L
call from
sender below

rdt_rcv(rcvpkt) &&
notcorrupt(rcvpkt)
extract(rcvpkt,data)
deliver_data(data)
udt_send(ACK)

Transport Layer 3-3

rdt2.0 has a fatal flaw!
What happens if Handling duplicates:
ACK/NAK corrupted? r sender retransmits current
r sender doesn’t know what pkt if ACK/NAK garbled
happened at receiver! r sender adds sequence
r can’t just retransmit: number to each pkt
possible duplicate r receiver discards (doesn’t
deliver up) duplicate pkt

stop and wait

Sender sends one packet,
then waits for receiver
response

Transport Layer 3-4

rdt2.1: sender, handles garbled ACK/NAKs
rdt_send(data)
sndpkt = make_pkt(0, data, checksum)
udt_send(sndpkt) rdt_rcv(rcvpkt) &&
( corrupt(rcvpkt) ||
Wait for Wait for
ACK or
isNAK(rcvpkt) )
call 0 from
NAK 0 udt_send(sndpkt)
above
rdt_rcv(rcvpkt)
&& notcorrupt(rcvpkt) rdt_rcv(rcvpkt)
&& isACK(rcvpkt) && notcorrupt(rcvpkt)
&& isACK(rcvpkt)
L
L
Wait for Wait for
ACK or call 1 from
rdt_rcv(rcvpkt) && NAK 1 above
( corrupt(rcvpkt) ||
isNAK(rcvpkt) ) rdt_send(data)

udt_send(sndpkt) sndpkt = make_pkt(1, data, checksum)

udt_send(sndpkt)

Transport Layer 3-5

 rdt2.1: receiver, handles garbled ACK/NAKs
rdt_rcv(rcvpkt) && notcorrupt(rcvpkt)
&& has_seq0(rcvpkt)
extract(rcvpkt,data)
deliver_data(data)
sndpkt = make_pkt(ACK, chksum)
udt_send(sndpkt)
rdt_rcv(rcvpkt) && (corrupt(rcvpkt) rdt_rcv(rcvpkt) && (corrupt(rcvpkt)
sndpkt = make_pkt(NAK, chksum) sndpkt = make_pkt(NAK, chksum)
udt_send(sndpkt) udt_send(sndpkt)
Wait for Wait for
rdt_rcv(rcvpkt) && 0 from 1 from rdt_rcv(rcvpkt) &&
not corrupt(rcvpkt) && below below not corrupt(rcvpkt) &&
has_seq1(rcvpkt) has_seq0(rcvpkt)
sndpkt = make_pkt(ACK, chksum) sndpkt = make_pkt(ACK, chksum)
udt_send(sndpkt) udt_send(sndpkt)
rdt_rcv(rcvpkt) && notcorrupt(rcvpkt)
&& has_seq1(rcvpkt)

extract(rcvpkt,data)
deliver_data(data)
sndpkt = make_pkt(ACK, chksum)
udt_send(sndpkt)

Transport Layer 3-6

rdt2.1: discussion
Sender:
r seq # added to pkt
r two seq. #’s (0,1) will
suffice.
r must check if received
ACK/NAK corrupted
r twice as many states
m state must “remember”
whether “current” pkt
has 0 or 1 seq. #
Receiver:
r must check if received
packet is duplicate
m state indicates whether
0 or 1 is expected pkt
seq #
r note: receiver can not
know if its last
ACK/NAK received OK
at sender
Transport Layer 3-7
rdt2.2: a NAK-free protocol

r same functionality as rdt2.1, using ACKs only

r instead of NAK, receiver sends ACK for last pkt
received OK
m receiver must explicitly include seq # of pkt being ACKed
r duplicate ACK at sender results in same action as
NAK: retransmit current pkt

Transport Layer 3-8

 rdt2.2: sender, receiver fragments
rdt_send(data)
sndpkt = make_pkt(0, data, checksum)
udt_send(sndpkt)
rdt_rcv(rcvpkt) &&
( corrupt(rcvpkt) ||
Wait for Wait for
ACK isACK(rcvpkt,1) )
call 0 from
above 0 udt_send(sndpkt)
sender FSM
fragment rdt_rcv(rcvpkt)
&& notcorrupt(rcvpkt)
rdt_rcv(rcvpkt) && && isACK(rcvpkt,0)
(corrupt(rcvpkt) || L
has_seq1(rcvpkt)) Wait for receiver FSM
0 from
udt_send(sndpkt) below fragment
rdt_rcv(rcvpkt) && notcorrupt(rcvpkt)
&& has_seq1(rcvpkt)
extract(rcvpkt,data)
deliver_data(data)
sndpkt = make_pkt(ACK1, chksum)
udt_send(sndpkt) Transport Layer 3-9
rdt3.0: channels with errors and loss
New assumption:
underlying channel can
also lose packets (data
or ACKs)
m checksum, seq. #, ACKs,
retransmissions will be
of help, but not enough
Approach: sender waits
“reasonable” amount of
time for ACK
r retransmits if no ACK
received in this time
r if pkt (or ACK) just delayed
(not lost):
m retransmission will be
duplicate, but use of seq.
#’s already handles this
m receiver must specify seq
# of pkt being ACKed
r requires countdown timer
Transport Layer 3-10
rdt3.0 sender
rdt_send(data)
rdt_rcv(rcvpkt) &&
sndpkt = make_pkt(0, data, checksum) ( corrupt(rcvpkt) ||
udt_send(sndpkt) isACK(rcvpkt,1) )
rdt_rcv(rcvpkt) start_timer L
L Wait for Wait
for timeout
call 0from
ACK0 udt_send(sndpkt)
above
start_timer
rdt_rcv(rcvpkt)
&& notcorrupt(rcvpkt) rdt_rcv(rcvpkt)
&& isACK(rcvpkt,1) && notcorrupt(rcvpkt)
stop_timer && isACK(rcvpkt,0)
stop_timer
Wait Wait for
timeout for call 1 from
udt_send(sndpkt) ACK1 above
start_timer rdt_rcv(rcvpkt)
rdt_send(data) L
rdt_rcv(rcvpkt) &&
( corrupt(rcvpkt) || sndpkt = make_pkt(1, data, checksum)
isACK(rcvpkt,0) ) udt_send(sndpkt)
start_timer
L

Transport Layer 3-11

rdt3.0 in action

Transport Layer 3-12

rdt3.0 in action

Transport Layer 3-13

Performance of rdt3.0 (Stop and
Wait)
r rdt3.0 works, but performance stinks
r ex: 1 Gbps link, 15 ms prop. delay, 8000 bit packet:

L 8000bits
d trans = = 9
= 8 microseconds
R 10 bps
m U sender: utilization – fraction of time sender busy sending

U L/R .008
= = = 0.00027
sender 30.008
RTT + L / R microsec
onds
m 1KB pkt every 30 msec -> 33kB/sec thruput over 1 Gbps link
m network protocol limits use of physical resources!****

Transport Layer 3-14

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

first packet bit arrives

RTT last packet bit arrives, send ACK

ACK arrives, send next

packet, t = RTT + L / R

U L/R .008
= = = 0.00027
sender 30.008
RTT + L / R microsec
onds

Transport Layer 3-15

Automatic repeat request
(ARQ Protocols)
r Used both at the transport and data link
layers
r Automatic repeat request (ARQ), is an error-control method
for data transmission that uses acknowledgements
(ACK/NAK) and timeouts to achieve reliable data
transmission over an unreliable communication channel. If
the sender does not receive an acknowledgment before the
timeout, it re-transmits the packet until it receives an
acknowledgment or exceeds a predefined number of
retransmissions.
r Variations of ARQ protocols include Stop-and-wait ARQ, Go-
Back-N ARQ, and Selective Repeat ARQ.
r Pipelining = Go-Back-N ARQ Or Selective Repeat ARQ

Transport Layer 3-16

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

r Two generic forms of pipelined protocols: go-Back-N,

selective repeat
Transport Layer 3-17
 Pipelining: increased utilization
sender receiver
first packet bit transmitted, t = 0
last bit transmitted, t = L / R

first packet bit arrives

RTT last packet bit arrives, send ACK
last bit of 2nd packet arrives, send ACK
last bit of 3rd packet arrives, send ACK
ACK arrives, send next
packet, t = RTT + L / R

Increase utilization
by a factor of 3!

U 3*L/R .024
= = = 0.0008
sender 30.008
RTT + L / R microsecon
ds
Transport Layer 3-18
Pipelining Protocols
Go-back-N: big picture:
r Sender can have up to
N unacked packets in
pipeline
r Rcvr only sends
cumulative acks
m Doesn’t ack packet if
there’s a gap
r Sender has timer for
oldest unacked packet
m If timer expires,
retransmit all unacked
packets
Selective Repeat: big pic
r Sender can have up to
N unacked packets in
pipeline
r Rcvr acks individual
packets
r Sender maintains
timer for each
unacked packet
m When timer expires,
retransmit only unack
packet
Transport Layer 3-19
Selective repeat: big picture
r Sender can have up to N unacked packets
in pipeline
r Rcvr acks individual packets
r Sender maintains timer for each unacked
packet
m When timer expires, retransmit only unack
packet

Transport Layer 3-20

Go-Back-N
Sender:
r k-bit seq # in pkt header
r “window” of up to N, consecutive unack’ed pkts allowed
r send_base: oldest unacked packet
r nextseqnum: smallest unused seqnum

r nextseqnum - send_base ≤Sender Window Size (SWS=N)

r ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK”
m may receive duplicate ACKs (see receiver)
r timeout(n): retransmit pkt n and all higher seq # pkts in window

Transport Layer 3-21

GBN: sender extended FSM
rdt_send(data)
if (nextseqnum < base+N) {
sndpkt[nextseqnum] = make_pkt(nextseqnum,data,chksum)
udt_send(sndpkt[nextseqnum])
if (base == nextseqnum)
start_timer
nextseqnum++
}
L else
refuse_data(data)
base=1
nextseqnum=1
timeout
start_timer
Wait
udt_send(sndpkt[base])
rdt_rcv(rcvpkt) udt_send(sndpkt[base+1])
&& corrupt(rcvpkt) …
udt_send(sndpkt[nextseqnum-1])
L rdt_rcv(rcvpkt) &&
notcorrupt(rcvpkt)
base = getacknum(rcvpkt)+1
If (base == nextseqnum)
stop_timer
else
restart_timer Transport Layer 3-22
GBN: receiver extended FSM
default
udt_send(sndpkt) rdt_rcv(rcvpkt)
&& notcurrupt(rcvpkt)
L && hasseqnum(rcvpkt,expectedseqnum)
expectedseqnum=1
Wait extract(rcvpkt,data)
sndpkt = deliver_data(data)
make_pkt(expectedseqnum,ACK,chksum) sndpkt = make_pkt(expectedseqnum,ACK,chksum)
udt_send(sndpkt)
expectedseqnum++

ACK-only: always send ACK for correctly-received pkt

with highest in-order seq #
m may generate duplicate ACKs
m need only remember expectedseqnum
r out-of-order pkt:
m discard (don’t buffer) -> no receiver buffering!
• Is it bad?
m Re-ACK pkt with highest in-order seq # Transport Layer 3-23
GBN in
action

Transport Layer 3-24

Selective Repeat
r receiver individually acknowledges all correctly
received pkts
m buffers pkts, as needed, for eventual in-order delivery
to upper layer
r sender only resends pkts for which ACK not
received
m sender timer for each unACKed pkt
r sender window
m N consecutive seq #’s
m again limits seq #s of sent, unACKed pkts

Transport Layer 3-25

Selective repeat in action

Transport Layer 3-26

 TCP: Overview RFCs: 793, 1122, 1323, 2018, 2581
r full duplex data:
r point-to-point: m bi-directional data flow
in same connection
m one sender, one receiver
m MSS: maximum segment
r reliable, in-order byte size (536, 1460)
steam: m MSS is set based on
m no “message boundaries” MTU (MSS = MTU – 40)
r pipelined: m Path MTU Discovery
m TCP congestion and flow r connection-oriented:
control set window size m handshaking (exchange
r send & receive buffers of control msgs) init’s
sender, receiver state
application application
before data exchange
flow controlled:
writes data reads data
socket
door
socket
door r
TCP TCP
send buffer
segment
receive buffer
m sender will not
overwhelm receiver 3-27
 TCP segment structure
32 bits
URG: urgent data counting
(generally not used) source port # dest port #
by bytes
sequence number of data
ACK: ACK #
valid acknowledgement number (not segments!)
head not
PSH: push data now len used
UA P R S F Receive window
(generally not used) # bytes
checksum Urg data pnter
rcvr willing
RST, SYN, FIN: to accept
Options (variable length)
connection estab
(setup, teardown
commands)
application
Internet data
checksum (variable length)
(as in UDP)

Transport Layer 3-28

TCP reliable data transfer
r TCP creates rdt r Retransmissions are
service on top of IP’s triggered by:
unreliable service m timeout events
r Pipelined segments m duplicate acks
r Cumulative acks r Initially consider
r TCP uses single
simplified TCP sender:
ignore duplicate acks
retransmission timer m
m ignore flow control,
congestion control

Transport Layer 3-29

NextSeqNum = InitialSeqNum
SendBase = InitialSeqNum

loop (forever) {
switch(event)

event: data received from application above

create TCP segment with sequence number NextSeqNum
if (timer currently not running)
start timer
pass segment to IP
NextSeqNum = NextSeqNum + length(data)

event: timer timeout

retransmit not-yet-acknowledged segment with
smallest sequence number
start timer

event: ACK received, with ACK field value of y

if (y > SendBase) {
SendBase = y
if (there are currently not-yet-acknowledged segments)
start timer
}

} /* end of loop forever */

Transport Layer 3-30
 TCP: retransmission scenarios
Host A Host B Host A Host B

Seq=9 Seq=9
2, 8 b 2, 8 b
ytes d ytes d
ata Seq= ata

Seq=92 timeout
100,
20 by
tes d
ata
timeout

C K =100
A 0
10
X C K
A AC
=
K =120
loss
Seq=9 Seq=9
2, 8 b
2, 8 b
ytes d Sendbase ytes d
ata
ata
= 100

Seq=92 timeout
SendBase
= 120 =120
K
C K =100 AC
A

SendBase
= 100 SendBase
= 120 premature timeout
time time
lost ACK scenario
Transport Layer 3-31
 TCP retransmission scenarios (more)
Host A Host B

Seq=9
2, 8 b
ytes d
ata

=100
timeout

Seq=1 A C K
00, 20
bytes
data
X
loss

SendBase C K =120
A
= 120

time
Cumulative ACK scenario

Transport Layer 3-32

TCP Connection Management
Recall: TCP sender, receiver
establish “connection”
before exchanging data
segments
r initialize TCP variables:
m seq. #s
m buffers, flow control
info (e.g. RcvWindow)
r client: connection initiator
Socket clientSocket = new
Socket("hostname","port
number");
r server: contacted by client
Socket connectionSocket =
welcomeSocket.accept();
Three way handshake:
Step 1: client host sends TCP
SYN segment to server
m specifies initial seq #
m no data
Step 2: server host receives
SYN, replies with SYNACK
segment
m server allocates buffers
m specifies server initial
seq. #
Step 3: client receives SYNACK,
replies with ACK segment,
which may contain data
Transport Layer 3-33
3-way Handshake

Transport Layer 3-34

TCP Connection Management (cont.)

Closing a connection: client server

close
client closes socket: FIN
clientSocket.close();

Step 1: client end system A CK

close
sends TCP FIN control FIN
segment to server

timed wait
Step 2: server receives A CK

FIN, replies with ACK.

Closes connection, sends
FIN. closed

Transport Layer 3-35

TCP Connection Management (cont.)

Step 3: client receives FIN, client server

replies with ACK. closing
FIN
m Enters “timed wait” -
will respond with ACK
to received FINs A CK closing
Step 4: server, receives FIN

ACK. Connection closed.

timed wait
A CK

closed

closed

Transport Layer 3-36

Transport Layer 3-37
Transport Layer 3-38
Transport Layer 3-39
Transport Layer 3-40