Format the next question

1 files changed, 73 insertions, 44 deletions

diff --git a/assignments/1/README.md b/assignments/1/README.md
index f328cc9..593d673 100644
--- a/assignments/1/README.md
+++ b/assignments/1/README.md
@@ -143,18 +143,23 @@ traceroute to google.com (142.251.215.238), 64 hops max, 40 byte packets
 | --- | ---    | ---    | ---    | -----  |
 |     |        |        |        | 263.380|
 
-#### Analysis:
+Analysis
 
 The traceroute measurements reveal several important network characteristics:
 
 Round-Trip Time Analysis:
+
 - Measurement 1 (14:34): Highest average RTT (34.34 ms) with largest standard deviation (25.61 ms), indicating significant network variability
 - Measurements 2 & 3 (14:39, 15:08): Similar performance with averages around 15.4 ms and standard deviations around 9.1 ms, showing more stable conditions
+
 Router Path Analysis:
+
 - Measurement 1: 13 hops - took a longer path through Google's network infrastructure
 - Measurements 2 & 3: 8 hops - more direct routing to the same destination IP (142.251.215.238)
 - The hop count reduction suggests load balancing and route optimization occurred between measurements
+
 Network Behavior Patterns:
+
 - Initial measurement showed higher latency and variability, possibly due to:
   - Cold cache effects
   - Different routing through Google's CDN
@@ -165,7 +170,7 @@ Network Behavior Patterns:
 Key Findings:
 
 1. Route Optimization: Google's network dynamically selected shorter paths for better performance
-2. Time-of-Day Effects: Network performance improved over the 30-minute measurement window
+2. Time of Day Effects: Network performance improved over the 30-minute measurement window
 3. Latency Consistency: Later measurements showed lower variability, indicating more predictable performance
 4. Load Balancing: Different destination IPs (142.251.32.78 vs 142.251.215.238) demonstrate Google's distributed infrastructure
 
@@ -175,13 +180,13 @@ Key Findings:
 
 The Internet protocol stack consists of five layers, each with specific responsibilities:
 
-| Layer | Name | Function |
-|-------|------|----------|
-| 5 | Application | Provides network services to applications (HTTP, SMTP, FTP, DNS) |
-| 4 | Transport | Provides reliable data transfer between processes (TCP, UDP) |
-| 3 | Network | Routes packets across networks using IP addresses (IP, ICMP) |
-| 2 | Link | Handles data transfer between adjacent network nodes (Ethernet, WiFi) |
-| 1 | Physical | Transmits raw bits over physical medium (cables, radio waves) |
+| Layer  | Name          | Function                                                                |
+| ------ | ------------- | ----------------------------------------------------------------------- |
+| 5      | Application   | Provides network services to applications (HTTP, SMTP, FTP, DNS)        |
+| 4      | Transport     | Provides reliable data transfer between processes (TCP, UDP)            |
+| 3      | Network       | Routes packets across networks using IP addresses (IP, ICMP)            |
+| 2      | Link          | Handles data transfer between adjacent network nodes (Ethernet, WiFi)   |
+| 1      | Physical      | Transmits raw bits over physical medium (cables, radio waves)           |
 
 #### Layer Details:
 
@@ -193,39 +198,62 @@ The Internet protocol stack consists of five layers, each with specific responsi
 
 ### 1.3 Packet-Switched vs Circuit-Switched Networks (5%)
 
-> What are packet-switched network and circuit-switched network, respectively? Develop a table to summarise their features, pros, and cons.
-
- Packet-switched network: Data is divided into packets that are independently routed through the network. Each packet contains destination information and can take different paths to reach the destination.
- Circuit-switched network: A dedicated communication path is established between sender and receiver for the entire duration of the communication session.
-
-| Aspect | Packet-Switched | Circuit-Switched |
-|--------|----------------|------------------|
-| Connection | Connectionless | Connection-oriented |
-| Resource allocation | Dynamic, shared | Dedicated, reserved |
-| Path determination | Per packet, can vary | Fixed for entire session |
-| Bandwidth utilization | Efficient, statistical multiplexing | Less efficient, reserved even when idle |
-| Setup time | None | Required before communication |
-| Reliability | Best effort delivery | Guaranteed delivery once connected |
-| Cost | Lower, pay per usage | Higher, pay for reserved capacity |
-| Congestion handling | Queuing delays, packet loss possible | No congestion once circuit established |
-
-#### Features:
-
-Packet-Switched:
-- Pros: Efficient bandwidth usage, robust against link failures, cost-effective, supports multiple simultaneous connections
-- Cons: Variable delays, potential packet loss, no guaranteed service quality, requires complex routing protocols
-
-Circuit-Switched:
-- Pros: Guaranteed bandwidth, predictable performance, simple once established, suitable for real-time applications
-- Cons: Inefficient resource utilization, blocking when circuits unavailable, requires setup/teardown time, expensive for bursty traffic
+> What are packet-switched network and circuit-switched network,
+> respectively? Develop a table to summarise their features, pros,
+> and cons.
+
+Packet-switched network: Data is divided into small packets that
+are independently routed through the network. Each packet contains
+destination information, headers, and a portion of the original
+message. Packets can take different paths to reach the destination
+and are reassembled at the receiver. The network resources are
+shared among multiple users through statistical multiplexing.
+
+Circuit-switched network: A dedicated communication path (circuit)
+is established between sender and receiver before any data transmission
+begins. This circuit reserves network resources for the entire
+duration of the communication session, providing a guaranteed path
+with fixed bandwidth. The circuit must be torn down when communication
+is complete.
+
+| Aspect                | Packet-Switched                      | Circuit-Switched                              |
+| ------                | ------                               | -------                                       |
+| Connection Model      | Connectionless                       | Connection-oriented                           |
+| Resource Allocation   | Dynamic, shared among users          | Dedicated, reserved for session               |
+| Path Determination    | Per packet, can vary                 | Fixed for entire session                      |
+| Bandwidth Utilization | Efficient, statistical multiplexing  | Less efficient, reserved even when idle       |
+| Setup Requirements    | None                                 | Required before communication                 |
+| Data Transmission     | Store-and-forward                    | Direct circuit path                           |
+| Reliability           | Best effort delivery                 | Guaranteed delivery once connected            |
+| Cost Model            | Lower, pay per usage                 | Higher, pay for reserved capacity             |
+| Congestion Handling   | Queuing delays, packet loss possible | No congestion once circuit established        |
+| Scalability           | Highly scalable                      | Limited by available circuits                 |
+| Fault Tolerance       | Robust, automatic rerouting          | Vulnerable, circuit failure breaks connection |
+| Performance           | Variable delays, jitter possible     | Predictable, consistent performance           |
+
+#### Advantages and Disadvantages:
+
+Packet-Switched Networks:
+
+- Pros: Efficient bandwidth usage, robust against link failures, cost-effective, supports multiple simultaneous connections, flexible routing
+- Cons: Variable delays, potential packet loss, no guaranteed service quality, requires complex routing protocols, possible congestion
+
+Circuit-Switched Networks:
+
+- Pros: Guaranteed bandwidth, predictable performance, simple once established, suitable for real-time applications, no packet overhead
+- Cons: Inefficient resource utilization, blocking when circuits unavailable, requires setup/teardown time, expensive for bursty traffic, poor fault tolerance
 
 #### Examples:
-- Packet-switched: Internet (IP), Ethernet LANs, modern data networks
-- Circuit-switched: Traditional telephone networks (PSTN), dedicated leased lines
+
+- Packet-switched: Internet (IP), Ethernet LANs, modern data networks, email systems, web browsing
+- Circuit-switched: Traditional telephone networks (PSTN), dedicated leased lines, T1/T3 connections
 
 ### 1.4 Network Delays and Traffic Intensity (5%)
 
-> What are processing delay, queuing delay, transmission delay, and propagation delay, respectively? Where does each delay occur? What is traffic intensity? Why should the traffic intensity be no greater than one (1) when designing a computer network?
+> What are processing delay, queuing delay, transmission delay, and
+> propagation delay, respectively? Where does each delay occur? What
+> is traffic intensity? Why should the traffic intensity be no greater
+> than one (1) when designing a computer network?
 
 #### Four Types of Network Delays:
 
@@ -240,19 +268,19 @@ Circuit-Switched:
 3. Transmission Delay (`d_trans`):
   - Definition: Time required to push all packet bits onto the transmission link
   - Where it occurs: At the sending router when transmitting packet bits
-  - Formula: d_trans = L/R (where L = packet length in bits, R = link transmission rate in bps)
+  - Formula: `d_trans = L/R` (where L = packet length in bits, R = link transmission rate in bps)
 4. Propagation Delay (`d_prop`):
   - Definition: Time for a signal to propagate from sender to receiver over physical medium
   - Where it occurs: Along the physical transmission medium (cables, fiber, wireless)
-  - Formula: d_prop = d/s (where d = physical distance, s = propagation speed ≈ 2×10^8 m/s)
+  - Formula: `d_prop = d/s` (where d = physical distance, s = propagation speed)
 
 #### Traffic Intensity:
 
-Definition: Traffic intensity (ρ) = La/R, where:
+Definition: Traffic intensity `(ρ) = La/R`, where:
 
-- L = average packet length (bits)
-- a = average packet arrival rate (packets/sec)
-- R = transmission rate (bps)
+- `L` = average packet length (bits)
+- `a` = average packet arrival rate (packets/sec)
+- `R` = transmission rate (bps)
 
 Why Traffic Intensity ≤ 1:
 
@@ -263,12 +291,13 @@ Traffic intensity represents the fraction of time the link is busy transmitting
 - ρ > 1: Traffic exceeds link capacity. Queues grow without bound, leading to packet loss and network instability.
 
 Design Principle: Networks must be designed with ρ < 1 to ensure:
+
 - Stable operation with bounded delays
 - Ability to handle traffic variations and bursts
 - Acceptable quality of service for applications
 - Prevention of congestion collapse
 
-A safety margin (typically ρ ≤ 0.7-0.8) is often used to account for traffic variability and ensure good performance.
+A safety margin (typically `ρ ≤ 0.7-0.8`) is often used to account for traffic variability and ensure good performance.
 
 ### 1.5 Web Caching (5%)