optional · CSS study notes
Classification of Network
🧭
On this page — click any heading below to jump straight to it. ⬅️ Back to P-II.II. Computer Communications & Networks
OSI Layer: Foundations & Models
1. 📖 Definition
Networks are classified by geographical scale, transmission technology, ownership, and topology.
2. 📍 By Geographical Scale
| Type | Range | Speed | Ownership | Example |
|---|---|---|---|---|
| PAN | 1–10 m | Low | Personal | Bluetooth headset |
| LAN | Room–campus | 100 Mbps–10 Gbps | Private | Office/university network |
| MAN | City (5–50 km) | High | Private/public | Cable TV, metro fibre |
| WAN | Country–global | Variable | Public/leased | The Internet, PTCL backbone |
- CAN (Campus Area Network) — several LANs across one campus
- SAN (Storage Area Network) — dedicated high-speed network for storage devices
- VPN — logical private network overlaid on public infrastructure
3. 📡 By Transmission Technology
- Broadcast networks — single shared channel; packet carries address field, all machines receive, intended one processes (e.g., classic Ethernet, Wi-Fi)
- Point-to-point networks — many connections between individual pairs; packets may traverse intermediate nodes; routing required
4. 🏢 By Ownership
- Private — owned and operated by a single organisation
- Public — carrier-operated, service sold to subscribers (PTCL, mobile operators)
5. 🤝 By Connection Type
- Client-Server — centralised, easier control and security
- Peer-to-Peer — decentralised, scalable, harder to secure
6. 🧮 Numericals (Step-by-Step)
A. Formula Sheet — memorise this first
| Quantity | Formula | Unit |
|---|---|---|
| Propagation delay (Tp) | d ÷ v | s |
| Transmission delay (Tt) | L ÷ B | s |
| Total delay (one link) | Tt + Tp | s |
| Mesh links | n(n − 1) ÷ 2 | links |
| Ports per node (mesh) | n − 1 | ports |
| Star links | n (one cable per node to the hub/switch) | links |
| Share of a broadcast channel | B ÷ number of active stations | bps |
| Store-and-forward over N links | N × (L ÷ B) | s |
| Client-server distribution time | max(NF ÷ us , F ÷ dmin) | s |
| P2P distribution time | max(F ÷ us , F ÷ dmin , NF ÷ (us + Σui)) | s |
⚠️
Unit conversions
- 1 byte = 8 bits; 1 MB = 8 × 10⁶ bits; 1 Gbit = 10⁹ bits
- 1 km = 10³ m; 1 ms = 10⁻³ s; 1 µs = 10⁻⁶ s
- Signal speed in copper or fibre ≈ 2 × 10⁸ m/s unless the question gives another value
✍️
Method to write in the exam: Given → Formula → Convert units → Substitute → Answer with unit → One-line interpretation linked back to LAN/MAN/WAN or broadcast/point-to-point.
B. Solved Numericals
Q1 — Propagation Delay by Network Scale
Given: v = 2 × 10⁸ m/s; LAN = 100 m; MAN = 20 km = 2 × 10⁴ m; WAN = 5,000 km = 5 × 10⁶ m
Find: Propagation delay for each network
Step 1 — Formula
Step 2 — LAN
Step 3 — MAN
Step 4 — WAN
Answer: LAN = 0.5 µs; MAN = 100 µs; WAN = 25 ms
Interpretation: Delay grows in direct proportion to distance. The WAN delay is 50,000 times the LAN delay, which is why a LAN feels instant and an intercontinental link does not.
Q2 — Same File over a LAN and a WAN
Given: File = 1 MB; LAN: B = 1 Gbps, d = 100 m; WAN: B = 10 Mbps, d = 5,000 km; v = 2 × 10⁸ m/s
Find: Total delay on each network
Step 1 — Convert file size to bits
Step 2 — LAN
Step 3 — WAN
Answer: LAN ≈ 8 ms; WAN ≈ 0.825 s (roughly 100 times slower)
Interpretation: A WAN loses on both counts. Its bandwidth is lower because long-distance capacity is leased and costly, and its distance is far greater. This is the numerical proof behind the "Speed" column of the scale table.
Q3 — Links and Ports in a Mesh vs a Star
Given: n = 10 nodes
Find: Links and ports for a fully connected mesh, and links for a star
Step 1 — Mesh links
Step 2 — Ports per node
Step 3 — Star links
Answer: Mesh = 45 links with 9 ports per node; star = 10 links
Interpretation: A full mesh is practical for a handful of WAN backbone routers, where redundancy matters most. For a 10-PC office LAN a star through one switch is far cheaper.
Q4 — Broadcast (Shared) vs Point-to-Point (Switched)
Given: 20 stations share a 100 Mbps hub (broadcast); the same 20 stations are then moved to a 100 Mbps switch with a dedicated link per port
Find: Bandwidth available to each station in both cases (all stations active)
Step 1 — Broadcast channel
Step 2 — Switched point-to-point links
Answer: Hub = 5 Mbps each; switch = 100 Mbps each
Interpretation: In a broadcast network every station shares one channel, so capacity is divided. Point-to-point links give each pair its own channel, which is why switches replaced hubs in modern LANs.
Q5 — Store-and-Forward over a Point-to-Point Path
Given: Packet L = 8,000 bits; path has 2 routers, so N = 3 links; each link B = 1 Mbps; propagation ignored
Find: End-to-end delay
Step 1 — Delay on one link
Step 2 — Over all links
Answer: End-to-end delay = 24 ms
Interpretation: In a point-to-point network every router must receive the whole packet before forwarding it. Each extra hop adds one more transmission delay, so routing and the number of hops directly affect speed.
Q6 — Client-Server vs Peer-to-Peer Distribution Time
Given: File F = 1 Gbit = 10⁹ bits; N = 10 peers; server upload us = 100 Mbps = 10⁸ bps; slowest peer download dmin = 50 Mbps = 5 × 10⁷ bps; each peer upload ui = 10 Mbps, so Σui = 10 × 10⁷ = 10⁸ bps
Find: Minimum time to give all 10 peers a copy under each model
Step 1 — Client-server: server sends N copies
Step 2 — P2P: server sends one copy, peers share the rest
Answer: Client-server = 100 s; P2P = 50 s
Interpretation: In client-server the server's upload is the bottleneck, and time grows straight with N. In P2P every new peer also adds upload capacity, so the network scales itself. This is the numerical case for the "P2P is scalable" point.
C. Common Mistakes Checklist
- Leaving distance in km while the speed is in m/s
- Forgetting ×8 when the file size is in bytes
- Using n(n − 1) for mesh links instead of n(n − 1) ÷ 2 (that double-counts every cable)
- In store-and-forward, counting routers instead of links (links = routers + 1)
- In client-server, forgetting the factor N: the server must upload one copy per client
D. Practice MCQs on Numericals
MCQ 1. A fully connected mesh of 6 nodes needs how many links?
- (A) 6
- (B) 12
- (C) 15
- (D) 30
Answer: (C) 15. Links = n(n − 1) ÷ 2 = 6 × 5 ÷ 2 = 15. Option (D) is n(n − 1) without dividing by 2, which counts each cable twice.
MCQ 2. Ten stations share a 10 Mbps broadcast channel and all are active. Each station gets about:
- (A) 10 Mbps
- (B) 1 Mbps
- (C) 100 Mbps
- (D) 0.1 Mbps
Answer: (B) 1 Mbps. In a broadcast network the channel is shared, so 10 ÷ 10 = 1 Mbps. Option (A) would be true only for a dedicated point-to-point (switched) link.
MCQ 3. Two cities are 1,000 km apart, linked by fibre (v = 2 × 10⁸ m/s). The propagation delay is:
- (A) 0.5 ms
- (B) 5 ms
- (C) 50 ms
- (D) 5 µs
Answer: (B) 5 ms. Tp = (10⁶ m) ÷ (2 × 10⁸ m/s) = 5 × 10⁻³ s = 5 ms. Leaving the distance as 1,000 (in km) gives (D).
7. 📝 Long-Question Outlines
✍️
Write this outline first (2–3 minutes), then develop each heading. Roman numerals = main headings · A / B / C = points · (1) / (2) = details.
Outline 1 — Classify computer networks with examples of each (20 marks)
- I. Introduction
- A. Definition of a computer network
- B. Bases of classification: scale, transmission technology, ownership, connection type
- II. Classification by Geographical Scale
- A. PAN: 1–10 m, Bluetooth headset
- B. LAN: room to campus, office or university network
- C. MAN: city-wide, cable TV or metro fibre
- D. WAN: country to global, the Internet, PTCL backbone
- E. Other types
- (1) CAN: several LANs on one campus
- (2) SAN: dedicated network for storage
- (3) VPN: private network over public infrastructure
- F. Comparison table (range, speed, ownership, example)
- III. Classification by Transmission Technology
- A. Broadcast: one shared channel, all receive, addressed one processes
- B. Point-to-point: dedicated pairs, routing needed
- IV. Classification by Ownership
- A. Private networks
- B. Public networks (PTCL, mobile operators)
- V. Classification by Connection Type
- A. Client-server: central control, easier security
- B. Peer-to-peer: decentralised, scalable
- VI. Numerical Support
- (1) Propagation delay by scale (Q1)
- (2) Client-server vs P2P distribution time (Q6)
- VII. Pakistani Examples
- A. NUST campus LAN
- B. City cable network as MAN
- C. PTCL nationwide WAN
- VIII. Conclusion: no single best type; choice depends on distance, cost and control
Marks guide: intro 2 · scale with table 6 · transmission technology 3 · ownership 2 · connection type 3 · numerical/examples 2 · conclusion 2
Outline 2 — Compare LAN, MAN and WAN on range, speed, ownership and media (8–10 marks)
- I. Introduction: classification by geographical scale
- II. Brief definition of each
- A. LAN
- B. MAN
- C. WAN
- III. Comparison table: range, speed, ownership, media, error rate, cost, example
- IV. Numerical illustration: same file over LAN vs WAN (Q2)
- V. Conclusion: LANs are fast and cheap; WANs trade speed for reach
Outline 3 — Differentiate broadcast and point-to-point networks (6–8 marks)
- I. Introduction: classification by transmission technology
- II. Broadcast networks
- (1) Shared channel and address field
- (2) Example: classic Ethernet, Wi-Fi
- III. Point-to-point networks
- (1) Dedicated links and routing
- (2) Example: WAN links, switched Ethernet
- IV. Comparison table plus numerical (hub vs switch, Q4)
- V. Conclusion
8. 🎯 CSS Exam Angle
- Present the scale table first — it frames the whole answer
- Add the broadcast vs point-to-point classification; most candidates omit it and lose the "complete coverage" marks
- Pakistani examples: NUST campus LAN, city cable network as MAN, PTCL nationwide WAN
9. 🔁 Likely Questions
- Classify computer networks with examples of each.
- Differentiate broadcast and point-to-point networks.
- Compare LAN, MAN, and WAN on range, speed, ownership, and media.
10. 📜 Past-Paper Questions & Structured Answers
Coverage check: no standalone question on LAN/MAN/WAN classification was located in the reviewed 2016–2026 descriptive papers or the available 2024–2026 Paper-II MCQ sheets. This is not proof that it has never appeared. Questions labelled “Likely” above are practice, not verified past-paper questions.
Relevant preparation: Use classification to introduce the 2022 campus-design answer in LAN Technologies and the 2025 Internet-structure answer in Overview of Networking. The examined tasks require design and explanation, not merely a list of network categories.