Chapter 1 — Calculus I
Lesson map
Lesson 01 published. Map, example, EX001.
flowchart TD
N0["Learning outcomes"]
N1["1.1 The case"]
N2["1.2 Rates of change"]
N3["1.4 Why this matters for security"]
N4["Synthesis"]
N0 --> N1 --> N2 --> N3 --> N4
N4 --> EX["Worked example"]
EX --> Q["Exercise EX001"]
Logical drawing
flowchart LR
N0["Learning outcomes"]
N1["1.1 The case"]
N2["1.2 Rates of change"]
N3["1.4 Why this matters for security"]
N4["Synthesis"]
N0 --> N1 --> N2 --> N3 --> N4 --> Q["EX001"]
[Learning outcomes]
|
v
[1.1 The case]
|
v
[1.2 Rates of change]
|
v
[1.4 Why this matters for security]
|
v
[Synthesis]
|
v
[Worked example] --> [Exercise EX001]
Learning outcomes
You will (1) use rates of change to describe network quantities; (2) interpret derivatives of traffic and queue length; (3) connect limits to capacity planning.
1.1 The case
Kofi Mensah is a five-year engineering student at the fictional Ravenmoor Institute of Technology, supervised by Dr Elena Vasquez. His long project is with the fictional Ashcombe District Council, whose eight offices share one flat network: staff laptops, servers, desk phones, CCTV cameras and guest Wi-Fi all sit in the same address space and can reach each other freely. Last year a guest laptop infected with malware was found trying to connect to council file servers. Nothing was lost, but the council asked for a segmented design and secure links between offices. This book follows Kofi from foundations to a defended engineering thesis.
1.2 Rates of change
Network engineering is full of quantities that change over time: bytes transferred, queue lengths in a router, the number of active connections. The derivative of transferred bytes with respect to time is throughput. If a backup job's transferred total grows as a smooth curve, the slope at any moment tells Kofi the instantaneous rate, which matters when checking whether a link of fixed capacity will be saturated. A steep slope at 02:00 in the council's traffic graph is the nightly backup, and its peak rate decides whether that link needs more capacity.
1.3 Queues and limits
A router queue grows when packets arrive faster than they can be sent. If arrival rate exceeds service rate by a constant amount, queue length grows linearly; its derivative is that difference. As utilisation approaches one, average waiting time in simple queue models grows without bound, which is a limit in the calculus sense. Kofi uses this to explain to council staff why a link at 95 percent utilisation feels far slower than one at 70 percent, even though the difference in load looks small.
1.4 Why this matters for security
Security controls add work to the network path. A firewall inspecting traffic has a service rate; if inspection slows it, queues build at busy times. Kofi will later measure added latency, and calculus gives him the language to reason about how small increases in per-packet cost become large delays near capacity. It also helps him read rate-based alerts, such as a sudden rise in connection attempts, as changes in slope rather than raw counts.
Security decisions in networks are quantitative more often than they look. Whether a link can absorb a backup and an incident response capture at once, or how quickly a log store fills, are questions of rates and totals. An engineer who can estimate them catches impossible plans early, before a control is designed that the network cannot carry.
Worked example
Given cumulative backup bytes B(t) = 2t² gigabytes for t in hours from 0 to 3, the throughput is B'(t) = 4t GB per hour, peaking at 12 GB per hour at the third hour, which Kofi compares with the inter-office link capacity.
Synthetic case. Kofi Mensah, Ravenmoor Institute of Technology, Ashcombe District Council and all figures are synthetic.
Errors and limits
Real traffic is bursty, not smooth; derivatives of fitted curves describe trends, not individual packets.
Exercises
- EX001 — Throughput derivative. If B(t) = 5t + t² GB, what is throughput at t = 4 hours? Rubric: 3 = 13 GB/h with method;; 2 = correct value only;; 1 = method without value;; 0 = none.
- EX002 — Utilisation intuition. Explain why delay rises sharply as utilisation approaches 1. Rubric: 3 = waiting time grows without bound in queue models;; 2 = queues grow;; 1 = vague;; 0 = none.
- EX003 — Security link. How does a firewall's service rate relate to queue growth? Rubric: 3 = slower inspection lowers service rate, queues at peaks;; 2 = slows traffic;; 1 = vague;; 0 = none.
Synthesis
Calculus turns traffic graphs into rates and helps reason about queues and the cost of inspection near capacity.