NET-220 · Kernel Networking · Advanced
Traffic Control & QoS — full syllabus
Shaping, scheduling and prioritising traffic with tc, including the modern queue disciplines.
Who this course is for
Engineers who must shape, schedule and prioritise traffic on Linux routers or hosts — and need to prove the QoS policy works under overload, not just that it parses.
Prerequisites
- NET-101-level stack knowledge
- Solid TCP/IP (flows, RTT, queueing basics)
- Linux command line
Course outline
Day 1 — the tc architecture
- The qdisc model: where queueing actually happens
- Classful vs classless qdiscs
- Ingress and egress hooks; the ifb device
- Filters, classifiers and the handle scheme
- Reading tc -s output without squinting
Day 2 — the queue disciplines
- HTB: classes, rates, ceilings and borrowing
- FQ and FQ-CoDel: flow isolation and AQM
- CAKE: what it automates and what it assumes
- Policing vs shaping; TBF and burst mathematics
- Choosing a discipline for a stated requirement
Day 3 — classification, offload and validation
- u32 and flower classifiers
- Hardware offload of tc and what your NIC can do
- Bufferbloat: measuring latency under load
- Validating a QoS policy with iperf3 and Flent-style tests
- Documenting a policy so the next engineer trusts it
Hands-on labs
- Lab: build an HTB hierarchy with guarantees and ceilings; verify each class with parallel iperf3 flows
- Lab: compare FQ-CoDel and CAKE on a bottleneck link and chart latency under load
- Lab: classify flows with flower filters and prove placement with tc -s counters
- Lab: police vs shape the same flow and document the different drop and delay signatures
- Lab: overload a link, then fix it with an AQM and show the before/after bufferbloat evidence
Capstone project
Design, implement and validate a QoS policy for a shared link with stated per-class guarantees and a latency bound: the written design, the tc implementation, and measurement evidence — per-class throughput under overload and latency-under-load distributions — proving each guarantee holds.
What you leave with
- A working command of tc: HTB, FQ-CoDel, CAKE and flower
- The ability to measure bufferbloat and latency under load honestly
- Classifier skills from u32 to flower with offload awareness
- A validation workflow that turns QoS from folklore into evidence
Upcoming dates
| Dates | Where | Seats | Early bird | Regular | |
|---|---|---|---|---|---|
| 11 Oct – 13 Oct 20263 full days | RiyadhIn person · KAFD Conference Centre | 11 of 14 | — | SAR 9,000 | |
| 11 Oct – 13 Oct 20263 full days | Kuwait CityIn person · Al Hamra Tower | 6 of 14 | — | KWD 740 | |
| 18 Oct – 20 Oct 20263 full days | MuscatIn person · Knowledge Oasis Muscat | 11 of 14 | — | OMR 920 | |
| 25 Oct – 1 Nov 20266 half-days | Gulf bandLive online · 09:00–13:00 GMT+3 | 3 of 20 | — | US$1,750 | |
| 26 Oct – 28 Oct 20263 full days | OttawaIn person · Kanata North Tech Park | 6 of 14 | — | CAD 3,260 | |
| 26 Oct – 28 Oct 20263 full days | TorontoIn person · MaRS Discovery District | 11 of 14 | — | CAD 3,260 | |
| 26 Oct – 2 Nov 20266 half-days | Europe bandLive online · 09:00–13:00 CET | 8 of 20 | — | US$1,750 | |
| 2 Nov – 4 Nov 20263 full days | LondonIn person · Shoreditch Works | 6 of 14 | — | GBP 1,870 | |
| 2 Nov – 9 Nov 20266 half-days | Americas bandLive online · 13:00–17:00 ET | 13 of 20 | — | US$1,750 | |
| 9 Nov – 11 Nov 20263 full days | BerlinIn person · Factory Görlitzer Park | 11 of 14 | EUR 1,990until 10 Oct |
Book a seat, or bring this course to your team
Seats can be reserved online; private delivery runs on-site or live online, adapted to your stack.
Questions about fit or prerequisites? Email hello@kernelsystems.academy. To save this syllabus, print this page to PDF from your browser.