Introduction to Data Communications and Networks

Data communications and computer networks form the core infrastructure of modern distributed information systems. This guide covers the essential principles of signal transmission, physical media characteristics, reference architectures, and routing protocols.

1. Fundamentals of Data Communications

At its simplest, telecommunication refers to communication at a distance. Modern data communications is the exchange of digital information between two endpoints through a transmission medium.

1.1 Five Core Components

Every data communication system relies on five fundamental structural elements working together:

text

+-------------------------------------------------------------+
|                          Protocol                           |
+-------------------------------------------------------------+
|    +--------+      Transmission Medium      +----------+    |
|    | Sender |==============================>| Receiver |    |
|    +--------+                               +----------+    |
|        ||                                         ||        |
|  [Generates Msg]                            [Consumes Msg]  |
+-------------------------------------------------------------+
                         Message: [Data]

Message: The actual information or data to be communicated. This can consist of text, numbers, images, audio, or video formats.
Sender: The device that originates and transmits the data message (e.g., computer, telephone, camera).
Receiver: The target device that receives the transmitted data.
Transmission Medium: The physical path over which a message travels from sender to receiver. Media are classified into:
- Guided media: Wired paths like twisted-pair copper, coaxial cables, or fiber-optic strands.
- Unguided media: Wireless paths utilizing radio waves, microwaves, or infrared light.
Protocol: A set of formal rules governing data communication. A protocol determines what is communicated, how it is communicated, and when it is communicated. Without protocols, two connected devices are unable to coordinate or interpret incoming data.

1.2 Data Flow Modes

Information exchange between two communication nodes can occur in three distinct directions:

text

Simplex:
[ Node A ] ------------------------> [ Node B ]  (One-way only)
 
Half-Duplex:
[ Node A ] <=======================> [ Node B ]  (Alternating directions)
 
Full-Duplex:
[ Node A ] <=======================> [ Node B ]  (Simultaneous bi-directional)
           ------------------------>
           <------------------------

Simplex: Communication is strictly unidirectional. One device acts only as a transmitter, while the other acts only as a receiver (e.g., traditional broadcast television or keyboards).
Half-Duplex: Each station can both transmit and receive data, but not at the same time. While one device is sending, the other can only listen. The full capacity of the transmission medium is dedicated to one direction at a time (e.g., walkie-talkies).
Full-Duplex (Duplex): Both stations can transmit and receive data simultaneously. The physical channel's capacity is shared between both directions, either by splitting the link physically or by using different frequency ranges for transmission and reception (e.g., telephone networks).

2. Network Topologies and Categories

A network is a collection of devices, often called nodes, connected by communication links. A node can be a computer, server, router, switch, or any other device capable of sending and receiving data across the network.

2.1 Network Topologies

Topologies define the geometric and physical layout of links and nodes:

text

Star Topology:                    Bus Topology:
    [Node A]   [Node B]           [Node A]   [Node B]   [Node C]
       \         /                   |          |          |
        v       v                 =========================== (Bus Cable)
     +-------------+                            |
     | Central Hub |                         [Node D]
     +-------------+
        ^       ^                 Ring Topology:
       /         \                    [Node A] ---> [Node B]
    [Node C]   [Node D]                  ^             |
                                         |             v
                                      [Node D] <--- [Node C]

Mesh: Every node has a dedicated point-to-point link to every other node in the network. A fully connected mesh network with $N$ nodes requires a total number of physical duplex channels ( $L$ ) calculated by:

$L = \frac{N(N - 1)}{2}$

Each node must also have physical communication ports. While highly redundant and fault-tolerant, mesh topologies are expensive and difficult to scale.

2.2 Network Classification

Networks are generally categorized by their physical scale, administrative control, and geographic span:

Local Area Network (LAN): Covers a small geographical area, such as a single office, home, or building. LANs typically offer high data rates and are owned and managed by a single organization.
Wide Area Network (WAN): Spans large geographical regions, linking cities, states, or countries. WANs use leased telecommunication lines provided by common carriers to bridge distant LAN networks.
Internetwork (The Internet): A global network of networks created by connecting different LANs and WANs using routers and standard transport protocols.

3. Physical Layer: Signals and Impairments

For data to be sent across a transmission medium, it must first be converted into electromagnetic signals.

3.1 Analog and Digital Signals

Signals can be represented in either analog or digital forms:

Analog Signals: Have an infinite number of values within a continuous range over time.
Digital Signals: Have a limited, discrete set of states (commonly representing binary values like $0$ and $1$ ).

In data communications, we commonly use periodic analog signals (such as sine waves) and nonperiodic digital signals to represent information.

3.2 Mathematical Representation of Periodic Analog Signals

A simple periodic analog signal can be modeled mathematically as a sine wave:

$s(t) = A \sin(2\pi f t + \phi)$

Where the physical properties of the wave are defined as:

Peak Amplitude ( $A$ ): The absolute value of the signal's highest intensity, measured in volts ( $V$ ) for electrical signals.
Frequency ( $f$ ): The number of complete cycles a wave completes in one second, measured in Hertz ( $\text{Hz}$ ).
Period ( $T$ ): The time in seconds required to complete one full cycle. Frequency and period are inversely related:

$f = \frac{1}{T} \quad \text{and} \quad T = \frac{1}{f}$

Amplitude Equivalency: Peak vs. RMS

Electrical systems often measure power using the Root Mean Square (RMS) voltage instead of the peak voltage ( $V_{\text{peak}}$ ). For a standard sinusoidal AC signal, the relationship is:

$V_{\text{peak}} = \sqrt{2} \times V_{\text{rms}} \approx 1.414 \times V_{\text{rms}}$

For example, a standard US wall outlet rated at $115\text{ V}_{\text{rms}}$ has a peak voltage of:

$115 \text{ V} \times 1.414 \approx 162.6 \text{ V}$

3.3 Frequency and Time Domains

Signals can be analyzed from two different perspectives:

text

Time Domain Representation:           Frequency Domain Representation:
  Amplitude                              Amplitude
     ^     _         _                      ^
     |    / \       / \                     |       |
     |   /   \     /   \                    |       | (Single Spike at f1)
   0 |---+----+---+----+---> Time           |-------+---------------> Freq
     |  /      \ /      \                   0       f1
     | /        -        -

Time-Domain Plot: Shows amplitude changes over time. It is useful for observing the continuous shape of a wave.
Frequency-Domain Plot: Shows amplitude plotted against frequency. A simple, single-frequency sine wave is represented in the frequency domain as a single vertical spike. This domain is useful for analyzing complex composite signals.

3.4 Composite Signals and Bandwidth

A single-frequency sine wave cannot carry complex data. To transmit information, we must use a composite signal, which is made of many individual sine waves.

According to Fourier Analysis, any composite signal is a combination of simple sine waves, each with its own frequency, amplitude, and phase.

If the composite signal is periodic, it decomposes into a discrete set of frequencies.
If the composite signal is nonperiodic, it decomposes into a continuous spectrum of infinite frequencies.

The bandwidth ( $B$ ) of a composite signal is the difference between its highest and lowest frequencies:

$B = f_{\text{high}} - f_{\text{low}}$

3.5 Digital Signals

Digital signals represent discrete states. For example, a binary signal can map a $1$ to a positive voltage and a $0$ to zero volts.

If a digital signal has $L$ distinct signaling levels, the number of bits ( $N_b$ ) required to represent each level is:

$N_b = \log_2(L)$

Transmission Methods

Digital signals can be sent across physical media in two ways:

Baseband Transmission: Sending a digital signal directly over a channel without converting it to an analog signal. This requires a low-pass channel (a channel with a frequency response starting at zero). Baseband transmission requires a very wide or infinite bandwidth to preserve the clean, square shape of the digital signal.
Broadband Transmission (Modulation): Converting digital signals into a composite analog signal before transmission. This allows the signal to travel over a bandpass channel (where the usable frequency range does not start at zero, such as a telephone subscriber line or wireless band). Devices like modulators-demodulators (modems) are used to translate the digital signal to and from an analog carrier wave.

3.6 Transmission Impairments

Physical transmission lines are not perfect. This imperfection means that the signal received at the end of a link is not identical to the signal that was sent. There are three main causes of signal impairment:

text

              +-----------------------------+
              |   Transmission Impairments  |
              +-----------------------------+
               /             |             \
              v              v              v
       +-------------+ +------------+ +-----------+
       | Attenuation | | Distortion | |   Noise   |
       +-------------+ +------------+ +-----------+

Attenuation: The loss of signal energy as it travels over a distance. To compensate for this loss, networks use amplifiers or repeaters to boost the signal. Attenuation and gain are measured in decibels ( $\text{dB}$ ):

$\text{dB} = 10 \log_{10}\left(\frac{P_2}{P_1}\right)$

4. Channel Capacity and Performance Metrics

A key consideration in network design is how fast data can be sent across a channel, measured in bits per second ( $\text{bps}$ ). This maximum speed is determined by the channel's physical bandwidth, its signaling levels, and its noise levels.

4.1 Noiseless Channels: The Nyquist Bit Rate

For an ideal, noiseless channel, the Nyquist formula defines the maximum theoretical bit rate ( $C_{\text{Nyquist}}$ ) as:

$C_{\text{Nyquist}} = 2 \times B \times \log_2(L)$

Where $B$ is the bandwidth in Hertz and $L$ is the number of signal levels. Increasing the number of signaling levels ( $L$ ) increases the data rate, but makes the receiver more complex and sensitive to small variations.

4.2 Noisy Channels: The Shannon Capacity

Real-world channels always contain noise. The Shannon capacity formula determines the absolute maximum data rate ( $C_{\text{Shannon}}$ ) for a noisy channel:

$C_{\text{Shannon}} = B \times \log_2(1 + \text{SNR})$

This capacity limit cannot be exceeded, regardless of how many signaling levels are used. For extremely noisy channels where $\text{SNR} \approx 0$ (the noise is much stronger than the signal), the capacity drops to zero, making data transmission impossible.

4.3 Combining Nyquist and Shannon

In practical system design, engineers use both formulas:

Use the Shannon formula to find the absolute upper limit of the channel's capacity.
Choose a practical target bit rate below this limit.
Use the Nyquist formula to calculate how many signaling levels ( $L$ ) are needed to achieve that target rate.

4.4 Network Performance Metrics

Bandwidth in Hz: The range of frequencies a channel can pass.
Bandwidth in bps: The nominal transmission speed of a link (e.g., $10\text{ Gbps}$ Ethernet).
Throughput: The actual rate at which data is successfully sent through a network. Throughput is always less than the nominal bandwidth due to protocol overhead, collisions, and queue delays.
Latency (Delay): The total time required for an entire message to reach its destination. Latency is the sum of four delay components:

$\text{Latency} = T_{\text{propagation}} + T_{\text{transmission}} + T_{\text{queuing}} + T_{\text{processing}}$

5. Layered Network Models: OSI and TCP/IP

To simplify network design, complex communication tasks are divided into hierarchical layers. Each layer relies on the services of the layer directly below it and provides services to the layer directly above it.

5.1 The OSI vs. TCP/IP Reference Models

The Open Systems Interconnection (OSI) model is a conceptual 7-layer framework developed by the International Organization for Standardization (ISO). The TCP/IP suite is the practical, 5-layer architecture used to build the modern Internet:

text

       OSI Layer Model                  TCP/IP Suite Model
  +-------------------------+       +-------------------------+
  | 7. Application Layer    |  ===> |                         |
  +-------------------------+       | 5. Application Layer    |
  | 6. Presentation Layer   |  ===> |                         |
  +-------------------------+       +-------------------------+
  | 5. Session Layer        |  ===> | (Managed by Application)|
  +-------------------------+       +-------------------------+
  | 4. Transport Layer      |  ===> | 4. Transport Layer      |
  +-------------------------+       +-------------------------+
  | 3. Network Layer        |  ===> | 3. Network Layer        |
  +-------------------------+       +-------------------------+
  | 2. Data Link Layer      |  ===> | 2. Data Link Layer      |
  +-------------------------+       +-------------------------+
  | 1. Physical Layer       |  ===> | 1. Physical Layer       |
  +-------------------------+       +-------------------------+

OSI Layer Functions

Physical Layer (Layer 1): Transmits raw bits over a physical medium. It defines mechanical, electrical, and optical specifications, including bit synchronization and line configuration.
Data Link Layer (Layer 2): Grouping raw bits into frames for reliable hop-to-hop transmission. It handles physical addressing (MAC addresses), flow control, and error detection.
Network Layer (Layer 3): Responsible for routing packets from their original source to their final destination across multiple networks. It manages logical addressing (IP addresses) and path selection.
Transport Layer (Layer 4): Ensures reliable, end-to-end delivery of the entire message from the source process to the destination process. It handles segmentation, reassembly, flow control, and connection management (TCP/UDP).
Session Layer (Layer 5): Manages dialog control, establishing, maintaining, and synchronizing communication sessions between applications.
Presentation Layer (Layer 6): Translates, encrypts, and compresses data, ensuring that information sent by one application can be read by another.
Application Layer (Layer 7): Provides network services directly to user applications (such as HTTP, FTP, and SMTP).

5.2 Addressing in the TCP/IP Stack

The TCP/IP suite uses four levels of addressing to route data across networks:

text

   Layer                    Address Type           Scope
+-------------+          +-----------------+    +-----------------+
| Application | =======> | Specific (URI)  |    | Global Process  |
+-------------+          +-----------------+    +-----------------+
| Transport   | =======> | Port (16-bit)   |    | Local Process   |
+-------------+          +-----------------+    +-----------------+
| Network     | =======> | Logical (IP)    |    | Global End-Host |
+-------------+          +-----------------+    +-----------------+
| Data Link   | =======> | Physical (MAC)  |    | Local Link Hop  |
+-------------+          +-----------------+    +-----------------+

Physical (MAC) Address: A local, link-specific address (typically a 48-bit hex address like 07:01:02:01:2C:4B) used to forward frames between adjacent devices on the same physical network.
Logical (IP) Address: A globally unique identifier (such as a 32-bit IPv4 or 128-bit IPv6 address) used to route packets across multiple networks. IP addresses generally remain unchanged from the source to the final destination.
Port Address: A 16-bit destination identifier (e.g., port 80 for HTTP, port 443 for HTTPS) that directs incoming data to the correct application or process running on a host.
Specific Address: User-friendly identifiers, such as email addresses or Uniform Resource Locators (URLs), which are translated into logical and port addresses by the application layer.

6. Network Layer: IP Datagram Mechanics

At the network layer, data is packaged into variable-length packets called datagrams. Each datagram contains two parts: a header and a data payload.

6.1 The IPv4 Header Structure

An IPv4 header has a base length of 20 bytes, but can expand up to 60 bytes if options are included. It is typically represented in 32-bit (4-byte) rows:

text

 0                   1                   2                   3
 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|Version|  HLEN |    TOS/DSCP   |          Total Length         |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|         Identification        |Flags|      Fragment Offset    |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|  Time to Live |    Protocol   |        Header Checksum        |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                         Source IP Address                     |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                      Destination IP Address                   |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                    Options (Variable, 0-40 Bytes)             |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

Key Header Fields

Version (4 bits): Specifies the IP version used. For IPv4, this value is binary 0100 ( $4$ ).
Header Length (HLEN) (4 bits): Specifies the total length of the IP header in 32-bit words.
- The minimum value is $5$ (binary 0101), which corresponds to a $5 \times 4 = 20$ -byte header.
- The maximum value is $15$ (binary 1111), which corresponds to a -byte header.

6.2 IP Fragmentation

Each physical network link has a Maximum Transfer Unit (MTU), which is the largest frame payload size it can transmit. For example, standard Ethernet has an MTU of 1500 bytes.

When an IP datagram's size exceeds the outgoing link's MTU, routers must break the payload into smaller pieces through a process called fragmentation. Only the payload data is fragmented; a new IP header is generated for each fragment.

text

Original Datagram:
+-------------------+------------------------------------------+
| IP Header (20B)   |               Payload (4000B)            |
+-------------------+------------------------------------------+
  Total Length = 4020B, ID = 14567, Flags: DF=0, MF=0, Offset = 0
 
Fragmented for MTU = 1500B (Max Payload = 1480B):
+-------------------+-----------------------+
| IP Header (20B)   |     Payload (1480B)   | Fragment 1: MF=1, Offset=0
+-------------------+-----------------------+
+-------------------+-----------------------+
| IP Header (20B)   |     Payload (1480B)   | Fragment 2: MF=1, Offset=185
+-------------------+-----------------------+
+-------------------+-----------------------+
| IP Header (20B)   |     Payload (1040B)   | Fragment 3: MF=0, Offset=370
+-------------------+-----------------------+

Fields Governing Fragmentation

Identification (16 bits): A unique ID assigned by the sender to identify all fragments belonging to the same original datagram.
Flags (3 bits):
- Bit 0: Reserved (always set to 0).
- Bit 1 (Don't Fragment - DF): If set to 1, routers are forbidden from fragmenting the packet. If the packet exceeds the MTU of a link, it is discarded, and an ICMP error is returned.
- Bit 2 (More Fragments - MF): Set to 1 for all fragments except the very last one, which is set to 0.
Fragmentation Offset (13 bits): Indicates where the fragment's payload fits relative to the beginning of the original unfragmented payload. To save header space, the offset is measured in 8-byte units (blocks).

Fragmentation Calculation

Consider an IP datagram with a total length of 4020 bytes (including a 20-byte base IP header) that must pass through a network with an MTU of 1500 bytes.

Determine Header and Payload Sizes:
- Original header size = 20 bytes.
- Original payload size = $4020 - 20 = 4000$ bytes.
- Maximum payload size per fragment = $\text{MTU} - \text{Header Size} = 1500 - 20 = 1480$ bytes.
Verify Alignment:
- The payload size of each fragment (except the last) must be a multiple of 8 bytes so that the offset can be represented as an integer.
- Check: (an integer, so 1480 bytes is a valid fragment payload size).

7. Summary

Data communications systems require a message, sender, receiver, physical medium, and a set of protocols. Data flow can be simplex, half-duplex, or full-duplex.
Network topologies (Mesh, Star, Bus, Ring, Hybrid) determine the physical layout of links and nodes. Fully connected mesh networks offer high redundancy but scale poorly.
Analog signals are continuous waves defined by amplitude, frequency, phase, and wavelength. Digital signals use discrete levels to represent binary data.
Transmission impairments (attenuation, distortion, and noise) degrade signals over distance.
The Nyquist theorem defines the maximum data rate for noiseless channels, while the Shannon formula determines the capacity limit for noisy channels based on the signal-to-noise ratio.
Standard reference models (OSI and TCP/IP) divide network tasks into layers. Each layer provides specific services and relies on physical, logical, port, or specific addressing.
IP datagrams contain key routing fields (Version, HLEN, Total Length, TTL). When a datagram exceeds a link's MTU, routers use fragmentation to break the payload into smaller pieces, tracking their order with the Flags and Fragmentation Offset fields.

Assessed progress

Introduction to Data Communications and Networks

Key Concepts

Data Communication Components

Analog vs. Digital Signaling

Transmission Impairments

Layered Architectures

IP Datagram Fragmentation

Quick Check

Computer Networks

Computer Networks