Transport Layer Protocols

The transport layer provides process-to-process delivery: TCP adds connections, reliability, ordering and flow/congestion control, while UDP is a thin, connectionless best-effort service; port numbers distinguish applications.

Key formulas & points

Skim these first — then read the full notes below.

  • TCP three-way handshake: SYN, SYN-ACK, ACK
  • Congestion control: slow start then AIMD
  • A port number identifies the application endpoint

Topic details

Introduction

This Tanenbaum topic covers end-to-end delivery. You compare TCP and UDP, trace the three-way handshake, understand sliding-window flow control and congestion control (slow start, AIMD), and estimate throughput from window size and round-trip time.

Key relations & formulas

Formulas (Indian textbook notation)

  • TCPusessequenceacknowledgementnumbersandaslidingwindowTCP uses \frac{sequence}{acknowledgement} numbers and a sliding window

Formulas (Indian textbook notation)

  • UDPisconnectionlesswithanoptionalchecksumandnoretransmissionUDP is connectionless with an optional checksum and no retransmission

Formulas (Indian textbook notation)

  • TCPthroughputwindowsizeRTT(simplified)TCP throughput \approx window \frac{size}{RTT} (simplified)

Notation and sign conventions

Relation 1 —
TCPusessequenceacknowledgementnumbersandaslidingwindowTCP uses \frac{sequence}{acknowledgement} numbers and a sliding window

Formulas (Indian textbook notation)

  • TCPusessequenceacknowledgementnumbersandaslidingwindowTCP uses \frac{sequence}{acknowledgement} numbers and a sliding window
Write this relation with symbols exactly as in Data Communications & Networking — Behrouz Forouzan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 2 —
UDPisconnectionlesswithanoptionalchecksumandnoretransmissionUDP is connectionless with an optional checksum and no retransmission

Formulas (Indian textbook notation)

  • UDPisconnectionlesswithanoptionalchecksumandnoretransmissionUDP is connectionless with an optional checksum and no retransmission
Write this relation with symbols exactly as in Data Communications & Networking — Behrouz Forouzan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 3 —
TCPthroughputwindowsizeRTTTCP throughput \approx window \frac{size}{RTT}

Formulas (Indian textbook notation)

  • TCPthroughputwindowsizeRTT(simplified)TCP throughput \approx window \frac{size}{RTT} (simplified)
Write this relation with symbols exactly as in Data Communications & Networking — Behrouz Forouzan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

Concept in depth

Where IP delivers packets between hosts, the transport layer delivers between processes, using port numbers to multiplex many conversations over one host. TCP builds a reliable, ordered byte stream on unreliable IP: it establishes a connection with the three-way handshake, numbers bytes so losses can be detected and retransmitted, and uses a sliding window both for flow control (not overwhelming the receiver) and congestion control (not overwhelming the network, via slow start and additive-increase/multiplicative-decrease). UDP skips all of this, offering minimal overhead and no guarantees, which suits latency-sensitive or loss-tolerant traffic like DNS queries, streaming and games.

Assumptions and validity limits

State assumptions explicitly before using any relation for transport layer protocols — steady state, uniform properties, linear elastic material, ideal gas, incompressible flow, etc., as applicable.
Wrong assumptions invalidate the entire solution even when the formula is correct. In Computer Networks viva and GATE descriptive questions, listing valid assumptions often earns separate marks.

Step-by-step problem approach

1. Read the question and list given data with SI units (common in Computer Networks papers).
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to transport layer protocols.
4. Use equation 1:
TCPusessequenceacknowledgementnumbersandaslidingwindowTCP uses \frac{sequence}{acknowledgement} numbers and a sliding window
.
5. Use equation 2:
UDPisconnectionlesswithanoptionalchecksumandnoretransmissionUDP is connectionless with an optional checksum and no retransmission
.
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.

Applications & exam relevance

Transport Layer Protocols appears in internet and enterprise IT. In Indian it software curricula this topic is tested because it connects theory to layered network protocols.
GATE and semester exams often combine transport layer protocols with earlier units — revise prerequisites before attempting mixed problems.
Industry interview panels sometimes ask: "Where did you use transport layer protocols?" — answer with a lab, mini-project, or plant visit example if possible.

Common mistakes in exams

Students think UDP is reliable or ordered (it is neither), confuse flow control (receiver-driven) with congestion control (network-driven), and miscount the handshake segments. Assuming a port number is part of the IP address rather than the transport header is a common error.

Quick revision checklist

Before attempting transport layer protocols problems, confirm you can:
1. TCP three-way handshake: SYN, SYN-ACK, ACK
2. Congestion control: slow start then AIMD
3. A port number identifies the application endpoint
Revise the solved examples in Data Communications & Networking — Behrouz Forouzan and one previous-year GATE or university paper for this unit.

Worked examples

Try the problem first — open the solution when you are ready to check.

TCP throughput estimate

Problem

Window size = 64 KB and RTT = 40 ms. Estimate the maximum throughput.

Solution

Throughput ≈ window/RTT = 64 KB / 0.04 s = 1600 KB/s ≈ 1.6 MB/s, ignoring losses and congestion. The window must grow to fill high-latency links.

Conceptual check — Transport Layer Protocols

Problem

In a Computer Networks semester or GATE paper you are asked: "State the main assumption, the governing relation, and one practical consequence of transport layer protocols." What should a complete answer include?

📖 Standard books (India)

  • Data Communications & NetworkingBehrouz Forouzan

    Read: Syllabus unit

    OSI, TCP/IP, and network protocols