About these notes
These notes are personal preparation material for the doctoral project Certified Dynamic Reconfiguration of Time-Sensitive Networks: Online Admission Control under Worst-Case Determinism Guarantees (LyRIDS, ECE × CEDRIC, Cnam). They collect, in a single place, the background in deterministic network calculus needed to read the TSN analysis literature and to follow the companion repository CNAM-ECE/network-calculus.
Organisation
The site has two parts.
- Learning path — thirty-eight posts grouped into six topics, meant to be read in this order: deterministic networks, network calculus, IEEE 802.1, IETF, TSN (including the TSN profiles) and SDN. The IEEE 802.1 topic covers how standards are amended and revised, the bridge and its control protocols (RSTP, MSTP, SPB, path control, MRP/MVRP, SRP); the TSN topic has one post per standard (802.1AS, CBS, TAS, 802.3br, 802.1Qbu, CQF, ATS, PSFP, FRER, stream reservation), and a profiles sub-section one post per profile (802.1BA, 802.1CM, IEC/IEEE 60802, 802.1DG).
- Reference — material for consultation rather than reading: a notation and results sheet, a TSN glossary, and an annotated list of resources.
Prerequisites
The posts assume familiarity with undergraduate real analysis (infimum, supremum, monotone functions) and with the basics of switched Ethernet. No prior exposure to queueing theory is required.
Conventions
- Time is continuous, ; data is measured in bits.
- .
- Rates are in bit/s, latencies in seconds unless stated otherwise; numerical examples use µs and Mbit/s.
- "Bound" always means a worst-case bound valid for every trajectory compatible with the stated arrival and service curves.
Status
These are study notes, not a peer-reviewed text. Results are stated as found in the cited references; derivations are sketches. Corrections are welcome through the repository's issue tracker.