BITS Pilani

Pilani Campus

Computer Networks
Lecture No. 5
Original contents
J.F Kurose and K.W. Ross
Position of transport layer

BITS Pilani, Pilani Campus

Packetizing

Transport layer create packet from the message received by the application layer

Packetizing - divides long message into smaller ones smaller ones are
encapsulated into the data field of the TL packet and headers are added

BITS Pilani, Pilani Campus

Connection Control

Connection-oriented delivery

• Establishes virtual path between sender & receiver

• Packets may travel in of order
• Transparent to communication in both direction

Connectionless Delivery
• Treats each packet independently
• No connection

BITS Pilani, Pilani Campus

ADDRESSING

Packet carrying the request must specify to which server program the request
must be delivered

PROVIDING RELIABILITY

Flow control
Error control

BITS Pilani, Pilani Campus

Types of data deliveries

BITS Pilani, Pilani Campus

Transport services and protocols

• provide logical communication between app application

transport
processes running on different hosts network
data link network
physical data link
network physical
• transport protocols run in end systems data link
physical
– send side: breaks app messages into network
data link
segments, passes to network layer physical network
data link
physical
– rcv side: reassembles segments into
network
messages, passes to app layer data link
physical

application
• more than one transport protocol available to transport
network
apps data link
physical
– Internet: TCP and UDP

BITS Pilani, Pilani Campus

Port numbers for Internet model

16 bit numbers ( between 0 and 65,535)

Client Program - ephemeral port - chosen randomly - transport layer software

running on the client host

Server program - well known port numbers- Universal port numbers

BITS Pilani, Pilani Campus

Port numbers

BITS Pilani, Pilani Campus

IP addresses versus port numbers

BITS Pilani, Pilani Campus

Transport Layer
Multiplexing, Demultiplexing

Sliding Window

Flow and Error control; connectionless and connection oriented

BITS Pilani, Pilani Campus

Transport services and protocols
application
transport
❖ provide logical communication network
data link
physical
between app processes running
on different hosts
❖ transport protocols run in end
systems
▪ send side: breaks app messages into
segments, passes to network layer
▪ rcv side: reassembles segments into
messages, passes to app layer
application

❖ more than one transport transport

network
data link
protocol available to apps physical

▪ Internet: TCP and UDP

BITS Pilani, Pilani Campus

Two principal Internet transport protocols
application

▪ TCP: Transmission Control Protocol

transport
network
mobile network
data link
physical
• reliable, in-order delivery national or global ISP

• congestion control
• flow control
• connection setup
local or
▪ UDP: User Datagram Protocol regional ISP

• unreliable, unordered delivery home network content

provider
• no-frills extension of “best-effort” IP network datacenter
application
network
▪ services not available: transport
network
data link

• delay guarantees physical

• bandwidth guarantees enterprise

network

BITS Pilani, Pilani Campus

Transport Layer Actions

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

link ▪ passes segment to IP link

physical physical
Transport Layer Actions

Receiver:
application ▪ receives segment from IP application
▪ checks header values
transport
app. msg ▪ extracts application-layer transport
message
network (IP) network (IP)
▪ demultiplexes message up
link to application via socket link

physical physical
Th app. msg
Multiplexing/Demultiplexing

HTTP
Transport FTP Transport
Layer Layer
Telnet

Network Network
Layer Layer

Use same communication channel between

hosts for several logical communication
processes
How does Mux/DeMux work?
Sockets: doors between process & host
UDP socket: (dest. IP, dest. Port)
TCP socket: (src. IP, src. port, dest. IP, dest.
Port)

BITS Pilani, Pilani Campus

Multiplexing / Demultiplexing
HTTP server
client
application application
HTTP msg
transport

transport network transport

network link network
link physical link
physical physical
Multiplexing / Demultiplexing
HTTP server
client
application application
HTTP msg
transport
Ht HTTP msg

transport network transport

network link network
link physical link
physical physical
Multiplexing / Demultiplexing
HTTP server
client
application application
HTTP msg
transport
Ht HTTP msg

Hnnetwork
Ht HTTP msg transport
transport
network link network
link physical link
physical physical
Multiplexing / Demultiplexing
HTTP server
client
application application

transport

transport network transport

network link network
link physical link
physical physical

Hn Ht HTTP msg
Multiplexing / Demultiplexing
HTTP server
client1 client2
application P-client1 P-client2 application

transport

transport network transport

network link network
link physical link
physical physical
Multiplexing / Demultiplexing

multiplexing at sender: demultiplexing at receiver:

handle data from multiple use header info to deliver
sockets, add transport header received segments to correct
(later used for demultiplexing) socket

application

application P1 P2 application socket

P3 transport P4
process
transport network transport
network link network
link physical link
physical physical
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
Connectionless demux

UDP socket identified by two-tuple:

– (dest IP address, dest port number)

When host receives UDP segment:

– checks destination port number in segment
– directs UDP segment to socket with that port number
IP datagrams with different source IP addresses and/or source port numbers
directed to same socket

BITS Pilani, Pilani Campus

Connection-oriented demux

TCP socket identified by 4-tuple:

Server host may support many simultaneous
– source IP address
TCP sockets:
– source port number
each socket identified by its own 4-tuple
– dest IP address Web servers have different sockets for each
– dest port number connecting client
recv host uses all four values to non-persistent HTTP will have different socket for
direct segment to appropriate each request
socket

BITS Pilani, Pilani Campus

Principles of Reliable Data Transfer
important in application, transport, and link layers

Sending Receiving Sending Receiving

Process Process Process Process
Application Layer

Transport Layer
Reliable Channel RDT protocol RDT protocol
(sending side) (receiving side)

Network Layer
Unreliable Channel

characteristics of unreliable channel will determine complexity

of reliable data transfer protocol (rdt)

BITS Pilani, Pilani Campus

 Principles of reliable data transfer

sending receiving
process process
application data data
transport
reliable channel

reliable service abstraction

 Principles of reliable data transfer

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

Principles of reliable 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
Principles of reliable data transfer

sending receiving
process process
application data data
transport

sender-side of receiver-side
Sender, receiver do not know reliable data
transfer protocol
of reliable data
transfer protocol
the “state” of each other, e.g.,
was a message received? transport
network
▪ unless communicated via a unreliable channel

message
reliable service implementation
 Reliable data transfer protocol (rdt): interfaces
rdt_send(): called from above, deliver_data(): called by rdt
(e.g., by app.). Passed data to to deliver data to upper layer
deliver to receiver upper layer
sending receiving
process process
rdt_send() data data
deliver_data()

sender-side data receiver-side

implementation of implementation of
rdt reliable data packet rdt reliable data
transfer protocol transfer protocol

udt_send() Header data Header data rdt_rcv()

unreliable channel
udt_send(): called by rdt rdt_rcv(): called when packet
to transfer packet over arrives on receiver side of
Bi-directional communication over
unreliable channel to receiver unreliable channel channel
Reliable data transfer: getting started
We will:
▪ incrementally develop sender, receiver sides of reliable data transfer
protocol (rdt)
▪ consider only unidirectional data transfer
• but control info will flow in both directions!
▪ use finite state machines (FSM) to specify sender, receiver
event causing state transition
actions taken on state transition
state: when in this “state”
next state uniquely state state
determined by next 1 event
event 2
actions
Reliable data transfer: getting started

rdt_send(): called from above, deliver_data(): called by

(e.g., by app.). Passed data to rdt to deliver data to upper
deliver to receiver upper layer

send receive
side side

udt_send(): called by rdt, rdt_rcv(): called when packet

to transfer packet over arrives on rcv-side of channel
unreliable channel to receiver
Reliable Data Transfer: FSMs

We’ll:
incrementally develop sender, receiver sides of reliable data transfer protocol
(rdt)
consider only unidirectional data transfer
– but control info will flow on both directions!
use finite state machines (FSM) to specify sender, receiver

BITS Pilani, Pilani Campus

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 
 Wait for Wait
for timeout
call 0from
above ACK0
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) 
rdt_rcv(rcvpkt) &&
( corrupt(rcvpkt) || sndpkt = make_pkt(1, data, checksum)
isACK(rcvpkt,0) ) udt_send(sndpkt)
start_timer


BITS Pilani, Pilani Campus

rdt3.0 in action

BITS Pilani, Pilani Campus

rdt3.0 in action

BITS Pilani, Pilani Campus

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

first packet bit arrives

RTT last packet bit arrives, send ACK

ACK arrives, send next

packet, t = RTT + L / R

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

BITS Pilani, Pilani Campus

Pipelining: Increased Utilization

sender receiver

last bit transmitted, t = L / R

first packet bit arrives

RTT last packet bit arrives, send ACK
Connectionless demux: example

ACK arrives, send next

packet, t = RTT + L / R

Increase utilization
by a factor of 3!

BITS Pilani, Pilani Campus

Pipelining: Motivation

Stop-and-wait allows the sender to only have a single unACKed packet at

any time
example: 1 Mbps link (R), end-2-end round trip propagation delay (D) of
92ms, 1KB packet (L):
Ttransmit = L (packet length in bits) 8kb/pkt
= = 8 ms
R (transmission rate, bps) 10**3 kb/sec

U L/R 8ms
= = = 0.08
sender 100ms
D+L/R microsec
onds

1KB pkt every 100 ms -> 80Kbps throughput on a 1 Mbps link

BITS Pilani, Pilani Campus

Pipelined protocols

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

BITS Pilani, Pilani Campus

Go-Back-N

Allow up to N unACKed pkts in the network

– N is the Window size

Sender Operation:

– If window not full, transmit

– ACKs are cumulative
– On timeout, send all packets previously sent but not yet ACKed.
– Uses a single timer – represents the oldest transmitted, but not yet ACKed pkt

BITS Pilani, Pilani Campus

4 intervals in the range of sequence numbers

1. [0, base-1] - packets that have already been transmitted and acknowledged

2. [base,nextsequence-1] - packets that have been sent but not yet ack

3. [nextseqnum, base+N-1] - packets that can be sent immediately

4. Seqnum > N+1 cannot be used until unack packet in the pipelimne is ack

BITS Pilani, Pilani Campus

Go-Back-N
Sender:
k-bit seq # in pkt header
“window” of up to N, consecutive unack’ed pkts allowed

• ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK”

– may receive duplicate ACKs (see receiver)
• timer for each in-flight pkt
• timeout(n): retransmit pkt n and all higher seq # pkts in window

BITS Pilani, Pilani Campus

GBN in action

BITS Pilani, Pilani Campus

Selective Repeat

receiver individually acknowledges all correctly received pkts

– buffers pkts, as needed, for eventual in-order delivery to upper layer
sender only resends pkts for which ACK not received
– sender timer for each unACKed pkt
sender window
– N consecutive seq #’s
– again limits seq #s of sent, unACKed pkts

BITS Pilani, Pilani Campus

Selective repeat: sender, receiver windows

BITS Pilani, Pilani Campus

Selective repeat

data from above : pkt n in [rcvbase, rcvbase+N-1]

if next available seq # in  send ACK(n)

window, send pkt  out-of-order: buffer
timeout(n):  in-order: deliver (also
resend pkt n, restart timer deliver buffered, in-order
pkts), advance window to
ACK(n) in [sendbase,sendbase+N]: next not-yet-received pkt
mark pkt n as received
pkt n in [rcvbase-N,rcvbase-1]
if n smallest unACKed pkt,
 ACK(n)
advance window base to
next unACKed seq # otherwise:
 ignore

BITS Pilani, Pilani Campus

Selective Repeat Example
PKT0
0123 456789
PKT1
0 1234 56789
PKT2
PKT3 01 2345 6789

ACK0 ACK1

0 1234 56789 ACK2

0 1234 56789 ACK3 PKT4
01234 5678 9
Time-Out
PKT1

ACK4

ACK1
01234 5678 9

Sender Receiver
BITS Pilani, Pilani Campus
Another Example

BITS Pilani, Pilani Campus

GBN in action

BITS Pilani, Pilani Campus