Lazy loaded image
Words 0Read Time 1 min
Invalid Date
ID
1
 

COMP1323 Networks and Security – Chapter 1: Introduction (Exam Focus Summary)

University of Southampton Malaysia | Semester II, 2025–26

🔹 1. What is the Internet?

  • “Network of networks”: Interconnected ISPs (Internet Service Providers) and networks that enable global communication.
  • Two perspectives:
    • Nuts and Bolts View: Physical components (hosts, routers, links, protocols).
    • Service View: Provides infrastructure for applications (web, email, VoIP, IoT, streaming, etc.).

📌 Key Components:

Component
Description
Hosts (End Systems)
Devices running apps (laptops, phones, servers, IoT devices).
Routers / Switches
Packet switches that forward data between networks.
Communication Links
Physical media: fiber, copper, radio, satellite.
Bandwidth (R)
Transmission rate (bps) of a link.
Protocols
Rules governing message format, order, and actions (e.g., TCP, IP, HTTP, WiFi).
ISPs
Provide access to the Internet: Local → Regional → Tier-1 (global).
Content Providers
Google, Netflix, Microsoft — run private networks to serve content closer to users.
IXP (Internet Exchange Point)
Physical location where ISPs peer (exchange traffic directly).
💡 Fun Fact: From web-enabled toasters to Fitbits — the Internet connects everything (IoT).

🔹 2. What is a Protocol?

  • Definition: A set of rules that govern communication between devices.
  • Human analogy: “Hello”, “What time is it?”, handshakes.
  • Network protocol example:
    • Key elements:
      • Message format
      • Message order
      • Actions taken on send/receive

    📌 Examples:

    Protocol
    Function
    HTTP
    Web page retrieval
    TCP/IP
    Reliable data transfer + addressing
    WiFi (802.11)
    Wireless LAN access
    4G/5G
    Mobile cellular access
    Ethernet
    Wired LAN access
    RFCs (Request for Comments) = Official Internet standards documents. ✅ IETF = Organization that develops and promotes these standards.

    🔹 3. Network Edge

    ➤ Hosts

    • Clients → Request services (e.g., your laptop browsing a website).
    • Servers → Provide services (e.g., Google’s server hosting Gmail). → Often located in data centers.

    ➤ Access Networks

    How end systems connect to the edge router:
    Type
    Description
    Key Features
    Residential (Cable)
    HFC (Hybrid Fiber Coax)
    Up to 1.2 Gbps down, 30–100 Mbps up; shared bandwidth
    Residential (DSL)
    Uses phone line
    24–52 Mbps down, 3.5–16 Mbps up; dedicated line
    Wired Ethernet
    LAN in homes/offices
    100 Mbps – 10 Gbps
    WiFi (WLAN)
    IEEE 802.11
    54 Mbps – 450 Mbps; within ~100 ft
    Cellular (4G/5G)
    Mobile networks
    10s–100s Mbps; coverage ~10 km
    Enterprise
    Company/university
    Mix of Ethernet (wired) and WiFi; connects to ISP via router
    Data Center
    High-speed server farms
    Links: 10s–100s Gbps; hundreds to thousands of servers
    🔧 Home Network: Cable/DSL modem → Router (with NAT, firewall) → WiFi/Ethernet → devices.

    🔹 4. Network Core

    ➤ Key Functions:

    Function
    Description
    Forwarding
    Local: Move packet from input link → output link using forwarding table (router).
    Routing
    Global: Determine end-to-end path using routing algorithms (e.g., OSPF, BGP).

    ➤ Two Switching Techniques:

    Circuit Switching
    Packet Switching
    Dedicated path reserved for call (e.g., traditional phone)
    Data broken into packets; routed independently
    Fixed bandwidth allocated
    Shared bandwidth; dynamic allocation
    Delay: Constant
    Delay: Variable (due to queueing)
    No loss if bandwidth sufficient
    Loss possible if buffer overflows
    Inefficient for bursty traffic
    Efficient for bursty traffic
    Uses FDM or TDM
    Uses store-and-forward

    💡 Circuit Switching Techniques:

    • FDM (Frequency Division Multiplexing): Each user gets a unique frequency band.
    • TDM (Time Division Multiplexing): Each user gets time slots in sequence.

    Packet Switching: Store-and-Forward

    • Transmission delay: d_trans = L / R → L = packet size (bits), R = link speed (bps)
    • Queueing delay: Time waiting in router buffer.
    • Entire packet must arrive before forwarding → causes delay but enables sharing.

    Example: Circuit vs Packet Switching

    1 Gbps link, each user active 10% of the time at 100 Mbps → Circuit: Max 10 users (1 Gbps / 100 Mbps) → Packet: Can support 35+ users with negligible probability (>10 active at once) ≈ 0.0004

    Packet Switching Advantages:

    • Better for bursty traffic
    • No call setup
    • More efficient resource use

    Packet Switching Drawbacks:

    • Variable delay → bad for real-time apps
    • Packet loss → requires congestion control and retransmission
    🔄 Q: How to make packet switching “circuit-like”? → Use QoS (Quality of Service), traffic shaping, prioritization (covered later).

    🔹 5. Performance Metrics

    Four Sources of Delay

    d_nodal = d_proc + d_queue + d_trans + d_prop
    Delay Type
    Formula
    Description
    Processing (d_proc)
    < 1 µs
    Check for errors, determine output link
    Queueing (d_queue)
    Varies
    Time in router buffer; depends on congestion
    Transmission (d_trans)
    L / R
    Time to push packet out onto link
    Propagation (d_prop)
    d / s
    Time for bit to travel physical distance; s ≈ 2×10⁸ m/s
    Caravan Analogy (L=10 bits, R=10 bit/sec, d=100 km, s=100 km/hr):
    • Time to transmit caravan = 120 sec
    • Propagation time = 1 hr
    • Total = 1 hr 52 min

    Traffic Intensity: La / R

    • L = packet size (bits)
    • a = average packet arrival rate (packets/sec)
    • R = link rate (bps)
    La/R
    Queueing Delay
    ≈ 0
    Very low
    → 1
    Very high → unstable
    > 1
    Infinite delay (buffer overflow → loss)

    Throughput

    • Definition: Rate bits are delivered from sender to receiver.
    • Bottleneck Link: The link with the lowest capacity on the path determines end-to-end throughput.
      • e.g., If server link = 100 Mbps, client link = 10 Mbps → Throughput = 10 Mbps
    • Shared bottleneck: If N users share link of rate R → per-user throughput ≈ min(Rc, Rs, R/N)

    Packet Loss

    • Occurs when buffer (queue memory) fills up.
    • Packets are dropped → may be retransmitted (e.g., TCP) or discarded (e.g., UDP).
    • Detected via traceroute ( = timeout/loss).

    Traceroute

    • Sends 3 packets with TTL=1,2,3,… → each router returns ICMP error
    • Measures delay to each hop
    • Reveals network path and latency spikes
    👉 Example: 1 cs-gw (1ms) 2 border1… (1ms) 3 ... 8 62.40… (104ms) ← trans-oceanic jump!

    🔹 6. Network Security (Critical!)

    Original Internet Vision: “Mutually trusting users on a transparent network” → ❌ No security by design

    🔥 Common Attacks:

    Attack
    Description
    Packet Sniffing
    Capture packets on shared media (e.g., WiFi) → steal passwords (Wireshark)
    IP Spoofing
    Send packet with fake source IP → impersonate another host
    Denial of Service (DoS/DDoS)
    Overwhelm server with traffic from botnet (compromised devices) → service unavailable

    ✅ Defense Mechanisms:

    Technique
    Purpose
    Authentication
    Prove identity (e.g., SIM cards in mobile)
    Encryption
    Confidentiality (e.g., TLS, AES)
    Digital Signatures
    Integrity + non-repudiation
    Firewalls
    Filter packets by IP/port/protocol; block malicious traffic
    VPNs
    Encrypted tunnels over public networks
    ⚠️ Security is needed at every layer: Application, Transport, Network, Link, Physical.

    🔹 7. Protocol Layers & Encapsulation (CORE EXAM TOPIC!)

    Internet Protocol Stack (5 layers)

    Layer
    Name
    Function
    Protocols
    1
    Application
    End-user programs
    HTTP, SMTP, DNS, FTP, Zoom
    2
    Transport
    Process-to-process delivery
    TCP (reliable), UDP (unreliable)
    3
    Network
    Host-to-host routing
    IP, ICMP, Routing Protocols (BGP, OSPF)
    4
    Link
    Node-to-node data transfer
    Ethernet, WiFi (802.11), PPP
    5
    Physical
    Bits on wire
    Fiber, copper, radio signals
    No Presentation/Session layers (unlike OSI). → Those services implemented in application layer if needed.

    Encapsulation (Take this seriously!)

    • Each layer adds its own header (and sometimes trailer) to data from layer above.
    • Analogous to Matryoshka dolls (Russian nesting dolls).
    Layer
    Data Unit
    Encapsulation Flow
    Application
    Message (M)
    Transport
    Segment = (Ht + M)
    Ht = TCP/UDP header
    Network
    Datagram = (Hn + Ht + M)
    Hn = IP header
    Link
    Frame = (Hl + Hn + Ht + M)
    Hl = Ethernet header/trailer
    Physical
    Bits
    ➔ transmitted over medium

    Encapsulation at Each Node:

    • Sender: Adds headers → downward through layers
    • Router: Reads IP header → forwards → strips link header → adds new link header → sends
    • Receiver: Removes headers bottom-up → delivers M to app
    💡 Key Exam Question: “What parts of the original message arrive at the destination?”The entire payload M — headers are stripped away!

    OSI Model (For Awareness)

    Layer
    Name
    7
    Application
    6
    Presentation (encryption, compression) → Not in Internet
    5
    Session (sync, checkpoint) → Not in Internet
    4
    Transport
    3
    Network
    2
    Data Link
    1
    Physical
    Important: Internet stack does not use Presentation/Session — roll into Application layer.

    🔹 8. Internet History (Timeline Summary)

    Year
    Milestone
    1961
    Kleinrock → Packet switching theory
    1964
    Baran → Military packet networks
    1969
    First ARPAnet node
    1972
    First email, NCP protocol, 15 nodes
    1974
    Cerf & Kahn → TCP/IP architecture (basis of today’s Internet)
    1983
    TCP/IP replaces NCP → Birth of modern Internet
    1983–85
    DNS, FTP, SMTP defined
    1988
    TCP Congestion Control implemented
    1991
    NSF lifts commercial restrictions
    1993
    Mosaic Browser → Web explosion
    1990s–2000s
    Web, P2P, mobile, security become critical
    2008
    SDN (Software Defined Networking) emerges
    2010s
    4G/5G, Cloud (AWS, Azure), IoT surge
    2017
    More mobile than fixed devices
    2023
    ~15 billion Internet-connected devices
    💡 Key Takeaway: Internet evolved from research projectglobal utilitycritical infrastructure

    Final Summary Checklist (Exam Must-Knows)

    Topic
    Must Know?
    Internet = Network of Networks
    ✔️
    Hosts/End Systems, Routers, Links
    ✔️
    That’s a protocol? → Rules → Format, Order, Actions
    ✔️
    Circuit vs Packet Switching → Pros/Cons, Efficiency, FDM/TDM
    ✔️✔️
    Store-and-forward, d_trans = L/R
    ✔️
    4 Delays: Proc, Queue, Trans, Prop → Know formula for Trans/Prop
    ✔️
    Traffic Intensity = La/R → >1 = loss
    ✔️
    Throughput = bottleneck rate
    ✔️
    Packet loss = buffer overflow
    ✔️
    Security threats: Sniffing, Spoofing, DoS → Defenses: Encryption, Firewalls
    ✔️✔️
    5-Layer Stack (Application → Physical) → Protocols per layer
    ✔️✔️
    Encapsulation: M → Segment → Datagram → Frame → Bits
    ✔️✔️✔️ (Draw it!)
    OSI layers: Presentation & Session NOT in Internet stack
    ✔️
    Internet History: Key years (1969, 1974, 1983, 1991, 2008, 2023)
    ✔️

    🧠 Exam Tips

    • Draw the encapsulation stack with headers/footers — you’ll lose marks if you skip this!
    • Traceroute output analysis: What do mean? Why does delay jump at hop 8?
    • Compare circuit vs packet using the 100 Mbps user example.
    • Remember: “The Internet didn’t plan for security — we’re fixing it now.”
    • Use keywords like: bottleneck, store-and-forward, traffic intensity, encapsulation, tier-1 ISP, IXP, DoS, QoS

    📘 Recommended Practice

    • Try Wireshark capture (labs): Identify Ethernet, IP, TCP headers.
    • Use traceroute from your computer.
    • Practice the caravan analogy with different numbers.

    上一篇
    COMP1323 Networks and Security Notes
    下一篇
    About This Blog

    Comments
    Loading...