CPD timing for this level
Applied time breakdown
This is the first pass of a defensible timing model for this level, based on what is actually on the page: reading, labs, checkpoints, and reflection.
What changes at this level
Level expectations
I want each level to feel independent, but also clearly deeper than the last. This panel makes the jump explicit so the value is obvious.
Prove behaviour with evidence. TCP, UDP, NAT, routing, TLS, and common failure modes.
Not endorsed by a certification body. This is my marking standard for consistency and CPD evidence.
- A timing breakdown note: DNS, TCP connect, TLS handshake, TTFB, download. Include what each step implies.
- A NAT and state explanation with one failure mode (timeouts, UDP fragility, or hairpinning) and how you would prove it.
- A layer-based troubleshooting checklist you can run under pressure, including what tool output counts as evidence.
Applied OSI and TCP IP
CPD tracking
Fixed hours for this level: 14. Timed assessment time is included once on pass.
View in My CPDCPD assessment
Network models Applied
Certificates support your career and help keep the site free for learners using the browser only tier. Sign in before you learn if you want progress and CPD evidence recorded.
Applied covers the behaviours that show up in real troubleshooting: TCP, UDP, routing, NAT, and TLS. This maps well to:
- Cisco CCNA (core protocol behaviour and diagnosis)
- CompTIA Network+ (applied networking concepts)
- Security practice (understanding where controls apply and where they cannot)
In foundations we built language and the basic flow. Here we get more exact about behaviour. We focus on what you can prove using inspection, not what you can recite.
🧵TCP reliability and flow
TCP provides a reliable byte stream between two endpoints. Reliable means three specific things.
- Data is delivered in order.
- Data is retransmitted if it is lost.
- Data is protected against corruption using checksums.
TCP also manages flow control so a fast sender does not overwhelm a slow receiver. It also performs congestion control so the network is not overwhelmed.
Worked example. “The server is slow” vs “the network is slow”
A page loads slowly. People immediately blame the server or “the Internet”. The applied way to think is: what is slow, exactly. DNS resolution. TCP connection establishment. TLS handshake. Or the request/response once the connection is established.
My opinion: if you cannot say which step is slow, you do not yet have a problem statement. You have a feeling.
Maths ladder (optional). RTT, throughput, and why distance matters
Foundations. Time and rate
Real networks add overheads and waiting time, but this gives you a sanity check.
🧮Maths and formal methods (the useful kind)
This section is here for two reasons. First, networks are graphs and queues, whether you like it or not. Second, protocols are state machines, whether the spec admits it politely or not. If you understand those three lenses, a lot of “network mystery” evaporates.
Graph theory lens. Routing as a shortest path problem
Treat routers as nodes and links as edges. Routing is a path selection problem on that graph. In link-state routing (conceptually), each router learns a view of the topology and computes paths. You do not need to run Dijkstra by hand, but you should understand what the algorithm is doing for you.
Routing as a graph
Nodes are routers. Edges have costs.
- Do all routers agree on the topology view (or are there partitions).
- Are link costs stable or flapping, causing route churn.
- Does policy override the “shortest” path (which is sometimes correct, sometimes disastrous).
Queueing lens. Latency is waiting time under load
At a very blunt level, every interface is a queue. Packets wait when the sender is faster than the link. As utilisation approaches 100%, queueing delay grows quickly. This is why “it works fine until peak hours” is a predictable story.
A simple mental model: if arrivals are near the service rate, the system becomes sensitive to bursts. You then see increased latency, drops, and retransmissions. People interpret that as “random slowness”. It is not random. It is saturation plus burstiness.
State machine lens. Protocols are behaviour, not packets
Protocols like TCP are easier to reason about as finite state machines: LISTEN, SYN-SENT, ESTABLISHED, FIN-WAIT, and so on. This is not academic. It is how you explain why a socket is stuck, why TIME-WAIT exists, and why resets happen.
Verification. Three “maths” questions that make you faster
- Graph: what path is being selected, and why.
- Queue: where is waiting happening, and is it load driven or loss driven.
- State: what state is each endpoint in, and what event would move it forward.
A level. Round-trip time (RTT) as a limit on feedback
RTT is the time for a message to go from client to server and back again. TCP uses acknowledgements, so RTT affects how quickly a sender can learn “the data arrived”.
When RTT is high, you need a larger window of in-flight data to keep throughput high.
Undergraduate. Bandwidth-delay product (BDP)
A useful quantity is the bandwidth-delay product:
- : link rate (bits per second)
- : round-trip time (seconds)
- : bits “in flight” needed to fully utilise the link
Intuition: if your TCP window is smaller than BDP, you cannot fill the pipe.
Common mistakes (TCP edition)
- Treating “reliable” as “fast”. TCP can be reliable and still slow under loss and high RTT.
- Thinking TCP “sends packets”. TCP provides a byte stream; IP carries packets; link carries frames.
- Forgetting that congestion control is a feature, not an error. It is TCP trying not to melt the network.
Verification. What you should be able to explain from a capture
- Identify the SYN, SYN-ACK, ACK handshake.
- Explain what sequence and acknowledgement numbers represent (ordering and confirmation).
- Explain what a retransmission indicates (loss or missing acknowledgement).
🧠DNS resolution in practice
When DNS fails, people often blame the Internet. I try to be more exact. I ask which step failed.
Common mistakes (DNS edition)
- Treating “DNS is down” as one thing. It could be local resolver, upstream resolver, cache, or network reachability.
- Forgetting caching exists, then being confused when “it worked for me” but not for others.
- Mixing “name” problems and “connection” problems. If you have an IP, you have moved past DNS.
Verification. The DNS steps you should be able to narrate
- Client asks resolver.
- Resolver answers from cache or queries upstream.
- Response contains records (A/AAAA/CNAME) and TTLs that drive caching behaviour.
⚡UDP and real world trade offs
UDP is a connectionless transport. It sends datagrams. It does not provide ordering or retransmission.
This is not always a weakness. Some applications implement reliability themselves. Some applications prefer timeliness over perfect delivery.
Examples you will see often:
- DNS commonly uses UDP for queries.
- Real time audio and video often uses UDP based transports.
- Modern web transports can run over UDP based protocols such as QUIC.
Verification. When UDP is the right choice
- When timeliness matters more than perfect delivery (some real-time media).
- When the application provides its own recovery or ordering.
- When you want to avoid some TCP behaviours (for example head-of-line blocking) and the protocol is designed for it.
🧭Routing and forwarding
Routing is how a device decides which next hop to use for a destination. Forwarding is the act of moving a packet from one interface to another based on that decision.
Switching is different. A switch forwards frames inside a local network using MAC addresses. A router forwards packets across networks using IP addresses.
This is why you can have a perfect Wi Fi link and still fail to reach a remote site.
Common mistakes (routing edition)
- Assuming “no traceroute hop” means “no route”. Some devices do not reply, or replies are filtered.
- Confusing switching and routing when diagnosing failures.
- Forgetting that the default route exists. Many failures are “no route for this destination”.
Verification. The TTL story
- TTL decreases at each router hop.
- When TTL hits zero, a router may send back “time exceeded”.
- Traceroute uses this behaviour to infer a path, imperfectly.
🔁NAT and state
Network Address Translation changes addresses as packets pass through a device. The most common pattern is translating many private addresses to one public address.
NAT is not the same thing as a firewall. Many devices combine NAT with stateful filtering, which is why people confuse them.
Common failure patterns:
- The mapping expires and breaks a long lived flow.
- A port is reused and traffic is delivered to the wrong internal endpoint.
- An inbound flow is blocked because there is no mapping and no explicit rule.
Common mistakes (NAT edition)
- Thinking NAT provides security by itself. It does not. It is translation.
- Forgetting timeouts exist, then being confused when long-lived connections die.
- Using protocols that embed IP/port information without considering NAT traversal behaviour.
Verification. What the NAT table must contain
- Inside IP:port and outside IP:port mapping.
- Timeout behaviour (when entries expire).
- Direction rules (what is allowed inbound vs outbound).
🔐TLS and where it sits
TLS is the protocol most people mean when they say HTTPS. TLS provides confidentiality and integrity for application data.
OSI explanations often place TLS in the presentation layer because it is about encoding and protection of data. In TCP IP practice, TLS is usually treated as part of the application layer stack because it is above the transport layer.
This is the key point. Layer models describe responsibilities. They do not force a protocol to live in one place forever.
Verification. What TLS gives you (and what it does not)
- Confidentiality and integrity for application data in transit.
- Server identity verification via certificates (when correctly validated).
- It does not fix bad authentication, insecure endpoints, or poor authorisation logic.
🧪A troubleshooting method you can repeat
My method is simple.
- State the user visible symptom in one sentence.
- State what success would look like.
- Pick the smallest test that isolates one layer boundary.
- Record the result and update your hypothesis.
When you do this, you stop jumping straight to rare causes.
Common mistakes (troubleshooting edition)
- Starting with rare causes because they are interesting.
- Changing three things at once, then not knowing what fixed it.
- Not writing down observations, then losing evidence under pressure.
✅Applied capstone
Pick one real page you trust. Use a browser. Write down the DNS step, the TCP step, and the TLS step. For each step, write one observation you could use as evidence.
CPD evidence (keep it practical)
- What I studied: TCP reliability, DNS resolution, UDP trade-offs, routing vs switching, NAT behaviour, TLS placement.
- What I practised: one walkthrough using a tool and one written troubleshooting narrative for a real page.
- What I learned: one place I used to guess (for example DNS vs TCP) and the test I will now run first.
- Evidence artefact: a short step-by-step write-up with observations and assumptions.
Quick check
Scenario: A stream arrives with gaps, then later corrects itself. What does TCP reliability actually guarantee (in practical terms)
Scenario: Users report 'it is slow' but only some of the time. Name one TCP/network reason that fits and the first evidence you’d check
Scenario: DNS resolves but the destination is unreachable. What does routing actually decide
Scenario: A game works on mobile data but fails on home Wi‑Fi. Name one NAT/UDP reason that fits and what you’d test first
Scenario: Someone says 'NAT is our firewall'. What is the defensible correction
