Chapter 23

Process-to-Process Delivery:
UDP, TCP, and SCTP

23.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
23.2
 Note

The transport layer is responsible for

process-to-process delivery.

23.3
 Figure 23.1 Types of data deliveries

23.4
 Figure 23.2 Port numbers

23.5
 Figure 23.3 IP addresses versus port numbers

23.6
 Figure 23.4 IANA ranges

23.7
 Figure 23.5 Socket address

23.8
 Figure 23.6 Multiplexing and demultiplexing

23.9
 Figure 23.7 Error control

23.10
 Figure 23.8 Position of UDP, TCP, and SCTP in TCP/IP suite

23.11
23.12
 Table 23.1 Well-known ports used with UDP

23.13
 Example 23.1

In UNIX, the well-known ports are stored in a file called

/etc/services. Each line in this file gives the name of the
server and the well-known port number. We can use the
grep utility to extract the line corresponding to the desired
application. The following shows the port for FTP. Note
that FTP can use port 21 with either UDP or TCP.

23.14
 Example 23.1 (continued)

SNMP uses two port numbers (161 and 162), each for a
different purpose, as we will see in Chapter 28.

23.15
 Figure 23.9 User datagram format

UDP length
= IP length – IP header’s length
23.16
 Figure 23.10 Pseudoheader for checksum calculation

23.17
 Example 23.2

Figure 23.11 shows the checksum calculation for a very

small user datagram with only 7 bytes of data. Because
the number of bytes of data is odd, padding is added for
checksum calculation. The pseudoheader as well as the
padding will be dropped when the user datagram is
delivered to IP.

23.18
 Figure 23.11 Checksum calculation of a simple UDP user datagram

23.19
 UDP Operation
• Connectionless Service:UDP is a
connectionless service. Each user datgram
sent by UDP is an independent datagram, can
travel on a different path.
• Flow & Error Control:No Error Control
mechanism in UDP except Checksum .Means
that sender does not know if a msg has been
lost or duplicated.No Flow Control,so the
receiver overflow with incoming messages.
• Encapsulation & Decapsulation:Udp
protocol encapsulates & decpasulates
messages in an IP Datagram.
23.20
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2000
 Figure 23.12 Queues in UDP

23.21
23.22
 TCP Services

1. Process to Process Communication

2. Stream Delivery Service
a. Sending and Receiving buffers
b. Segments
3. Full-Duplex Communication
4. Connection Oriented Service
5. Reliable Service

23.23
 Table 23.2 Well-known ports used by TCP

23.24
 Figure 23.13 Stream delivery

23.25
 Figure 23.14 Sending and receiving buffers

23.26
 Figure 23.15 TCP segments

23.27
 TCP Features

1. Numbering System
a. Byte Number
b. Sequence Number
c. Aknowledgement Number
2. Flow Control
3. Error Control
4. Congestion Control

23.28
 Note

The bytes of data being transferred in

each connection are numbered by TCP.
The numbering starts with a randomly
generated number.

23.29
 Example 23.3

The following shows the sequence number for each

segment:

23.30
 Note

The value in the sequence number field

of a segment defines the
number of the first data byte
contained in that segment.

23.31
 Note

The value of the acknowledgment field

in a segment defines
the number of the next byte a party
expects to receive.
The acknowledgment number is
cumulative.

23.32
 Figure 23.16 TCP segment format

23.33
 Figure 23.17 Control field

23.34
 Table 23.3 Description of flags in the control field

23.35
 TCP Connection

1. Connection Establishment
a. Three-way Handshaking
b. SYN Flooding attack(problem in connection establishment)
2. Data Transfer
a. Pushing Data
b. Urgent Data
3. Connection Termination
a. Three-way Handshaking (Full-close):: Asymmetric Release)
b. Half - close :: Symmetric Release

23.36
 Figure 23.18 Connection establishment using three-way handshaking

SYN FLOODING ATTACK :

DENIAL-OF-SERVICE
ATTACK

POSTPONE RESOURCE
ALLOCATION UNTIL THE ENTIRE
SETUP::: USING COOKIE

23.37
 Note

A SYN segment cannot carry data, but it

consumes one sequence number.

23.38
 Note

A SYN + ACK segment cannot

carry data, but does consume one
sequence number.

23.39
 Note

An ACK segment, if carrying no data,

consumes no sequence number.

23.40
 Figure 23.19 Data transfer

23.41
 Figure 23.20 Connection termination using three-way handshaking

23.42
 Note

The FIN segment consumes one

sequence number if it does
not carry data.

23.43
 Note

The FIN + ACK segment consumes

one sequence number if it
does not carry data.

23.44
 Figure 23.21 Half-close

23.45
 TCP FLOW CONTROL

The sliding window protocol used by TCP, however, is

something between the Go-Back-N and Selective Repeat
sliding window.
The sliding window protocol in TCP looks like the Go-Back-N
protocol because it does not use NAKs; it looks like Selective
Repeat because the receiver holds the out-of-order
segments until the missing ones arrive.

There are two big differences between this sliding

window and the one we used at the data link layer.
First, the sliding window of TCP is byte-oriented; the one we
discussed in the data link layer is frame-oriented.
Second, the TCP's sliding window is of variable size;
the one we discussed in the data link layer was of fixed size.
23.46
 TCP FLOW CONTROL

Figure 23.22 Sliding window

23.47
 Note

A sliding window is used to make

transmission more efficient as well as
to control the flow of data so that the
destination does not become
overwhelmed with data.
TCP sliding windows are byte-oriented.

23.48
 Example 23.4

What is the value of the receiver window (rwnd) for host

A if the receiver, host B, has a buffer size of 5000 bytes
and 1000 bytes of received and unprocessed data?

Solution
The value of rwnd = 5000 − 1000 = 4000. Host B can
receive only 4000 bytes of data before overflowing its
buffer. Host B advertises this value in its next segment to
A.

23.49
 Example 23.5

What is the size of the window for host A if the value of

rwnd is 3000 bytes and the value of cwnd is 3500 bytes?

Solution
The size of the window is the smaller of rwnd and cwnd,
which is 3000 bytes.

23.50
 Example 23.6

Figure 23.23 shows an unrealistic example of a sliding

window. The sender has sent bytes up to 202. We assume
that cwnd is 20 (in reality this value is thousands of
bytes). The receiver has sent an acknowledgment number
of 200 with an rwnd of 9 bytes (in reality this value is
thousands of bytes). The size of the sender window is the
minimum of rwnd and cwnd, or 9 bytes. Bytes 200 to 202
are sent, but not acknowledged. Bytes 203 to 208 can be
sent without worrying about acknowledgment. Bytes 209
and above cannot be sent.

23.51
 Figure 23.23 Example 23.6

23.52
 Note

Some points about TCP sliding windows:

❏ The size of the window is the lesser of rwnd and
cwnd.
❏ The source does not have to send a full window’s
worth of data.
❏ The window can be opened or closed by the
receiver, but should not be shrunk.
❏ The destination can send an acknowledgment at
any time as long as it does not result in a shrinking
window.
❏ The receiver can temporarily shut down the
window; the sender, however, can always send a
segment of 1 byte after the window is shut down.

23.53
 Error Control

• TCP is a reliable transport layer protocol.

• This means that an application program that delivers a stream of
data to TCP relies on TCP to deliver the entire stream to the application
program on the other end in order, without error, and without any part
lost or duplicated.

• TCP provides reliability using error control.

• Error control includes mechanisms for detecting corrupted segments,
lost segments, out-of-order segments, and duplicated segments.

• Error control also includes a mechanism for correcting errors after

they are detected.

23.54
 Error detection and correction in TCP is achieved through the
use of three simple tools:

checksum,

acknowledgment,

time-out.

23.55
 Note

ACK segments do not consume

sequence numbers and are not
acknowledged.

23.56
 Note

In modern implementations, a
retransmission occurs if the
retransmission timer expires or three
duplicate ACK segments have arrived.

23.57
 Note

No retransmission timer is set for an

ACK segment.

23.58
 Note

Data may arrive out of order and be

temporarily stored by the receiving TCP,
but TCP guarantees that no out-of-order
segment is delivered to the process.

23.59
 Figure 23.24 Normal operation

23.60
 Figure 23.25 Lost segment

23.61
 Note

The receiver TCP delivers only ordered

data to the process.

23.62
 Figure 23.26 Fast retransmission

23.63
23.64
 Note

SCTP is a message-oriented, reliable

protocol that combines the best features
of UDP and TCP.

23.65
 Table 23.4 Some SCTP applications

23.66
 Figure 23.27 Multiple-stream concept

23.67
 Note

An association in SCTP can involve

multiple streams.

23.68
 Figure 23.28 Multihoming concept

23.69
 Note

SCTP association allows multiple IP

addresses for each end.

23.70
 Note

In SCTP, a data chunk is numbered

using a TSN.

23.71
 Note

To distinguish between different

streams, SCTP uses an SI.

23.72
 Note

To distinguish between different data

chunks belonging to the same stream,
SCTP uses SSNs.

23.73
 Note

TCP has segments; SCTP has packets.

23.74
 Figure 23.29 Comparison between a TCP segment and an SCTP packet

23.75
 Note

In SCTP, control information and data

information are carried in separate
chunks.

23.76
 Figure 23.30 Packet, data chunks, and streams

23.77
 Note

Data chunks are identified by three

items: TSN, SI, and SSN.
TSN is a cumulative number identifying
the association; SI defines the stream;
SSN defines the chunk in a stream.

23.78
 Note

In SCTP, acknowledgment numbers are

used to acknowledge only data chunks;
control chunks are acknowledged by
other control chunks if necessary.

23.79
 Figure 23.31 SCTP packet format

23.80
 Note

In an SCTP packet, control chunks come

before data chunks.

23.81
 Figure 23.32 General header

23.82
 Table 23.5 Chunks

23.83
 Note

A connection in SCTP is called an

association.

23.84
 Note

No other chunk is allowed in a packet

carrying an INIT or INIT ACK chunk.
A COOKIE ECHO or a COOKIE ACK
chunk can carry data chunks.

23.85
 Figure 23.33 Four-way handshaking

23.86
 Note

In SCTP, only DATA chunks

consume TSNs;
DATA chunks are the only chunks
that are acknowledged.

23.87
 Figure 23.34 Simple data transfer

23.88
 Note

The acknowledgment in SCTP defines

the cumulative TSN, the TSN of the last
data chunk received in order.

23.89
 Figure 23.35 Association termination

23.90
 Figure 23.36 Flow control, receiver site

23.91
 Figure 23.37 Flow control, sender site

23.92
 Figure 23.38 Flow control scenario

23.93
 Figure 23.39 Error control, receiver site

23.94
 Figure 23.40 Error control, sender site

23.95