Skip to main content

Determinism: from the OSI and TCP/IP Ethernet stack to TSN

· 11 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

A control loop on a factory floor and an e-mail server can share the same cable only if the network can promise the first one something the second never needs: that every packet arrives on time. This post starts from the ordinary Ethernet and TCP/IP stack, shows where its timing breaks down, and explains how Time-Sensitive Networking (TSN) extends it without replacing it.

Why deterministic guarantees? From TSN to worst-case bounds

· 7 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Time-Sensitive Networking (TSN) promises that a standard Ethernet network can carry control traffic with bounded latency. This first post explains what "bounded" means, why it cannot be established by measurement alone, and why deterministic network calculus is the analytical tool of choice for establishing it.

Min-plus algebra: the language of network calculus

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Network calculus is often summarised as "queueing theory in the min-plus algebra". In conventional system theory, a linear time-invariant system is characterised by its impulse response and its output is a convolution in the (+,×)(+,\times) algebra. Network calculus keeps the same structure but replaces addition by minimum and multiplication by addition. This post sets up that algebra.

Aggregate multiplexing and residual service

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

In a real switch, a flow does not have a server to itself: it shares an egress port with other flows, possibly in the same queue. To apply the results of the previous posts to one flow, we need the service that remains for it once the competing traffic has been served. This is the residual service curve, and its form depends on the multiplexing policy.

Dynamic reconfiguration of TSN: where network calculus fits

· 7 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

The guarantees developed in this series are established for a fixed configuration. This final post examines what happens when the configuration changes at run time, through two recent contributions, and argues that network calculus is the natural tool to certify a reconfiguration, whatever method proposes it.

Deterministic networking in OSI 7-layer Architecture

· 15 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

"Deterministic networking" names a goal before it names a technology: a packet network that delivers selected flows within a bounded latency, with almost no loss. This post defines the goal, lists what it demands from the network, and shows which standards body is responsible for which layer.

IEEE 802.1 standards: base standards, amendments, revisions and families

· 10 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Papers on TSN cite "802.1Qbv-2015", "802.1Q-2018" and "802.1Q-2022" for what looks like the same mechanism. They are not contradictory: the mechanism was written as an amendment, then merged into a new edition of the base standard, which was later revised again. This post explains how IEEE 802.1 documents are created, changed, merged and grouped, using 802.1Q as the running example.

IEEE 802.1Q: the bridge, its architecture, data-plane actions and forwarding process

· 9 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Every TSN mechanism in this series is described as an addition to "the bridge". This post opens that box. It uses the figures with which the IEEE 802.1 working group itself explains the bridge: in its 2013 tutorial to the IETF, and in its 2017 and 2018 introductions to TSN.

IEEE 802.1Qat SRP: the Stream Reservation Protocol

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

The Stream Reservation Protocol (SRP) was AVB's answer to congestion loss: a stream is admitted only if every bridge on its path can carry it. This post covers the protocol itself. The stream reservation post places SRP among later reservation approaches and derives the latency bound that each bridge has to compute.

IEEE 802.1w RSTP: the Rapid Spanning Tree Protocol

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Ethernet frames carry no hop count, so a loop in a bridged network would circulate broadcasts forever. Bridges therefore agree on a loop-free subset of the links: a spanning tree. The Rapid Spanning Tree Protocol (RSTP) is the standard way to compute it, and the first control protocol listed for the active topology in the bridge post.

IEEE 802.1Qca PCR: path control with explicit trees in IS-IS

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

SPB computes shortest paths. Deterministic networks often need other paths: two disjoint routes for FRER, or a route that avoids a link already carrying critical streams. IEEE 802.1Qca, Path Control and Reservation (PCR), lets a controller impose such paths, while IS-IS keeps doing everything else.

IEEE 802.1ak MRP and MVRP: registering VLANs across a bridged network

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Once RSTP, MSTP or SPB has fixed the active topology, a bridge still needs to know where the members of each VLAN are, so that it does not flood VLAN traffic everywhere. The Multiple VLAN Registration Protocol (MVRP) learns this automatically. It is one application of a general framework, the Multiple Registration Protocol (MRP), which also carries stream reservations.

IEEE 802.1Qbu: frame preemption in the bridge

· 6 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

A long frame already on the wire delays everything behind it: a 1522-byte frame occupies a 1 Gbit/s link for about 12 µs. IEEE 802.3br gave Ethernet the means to cut such a frame. IEEE 802.1Qbu decides, inside the bridge, which frames may cut which, and coordinates the cut with the gates of scheduled traffic.

IEEE 802.1Qcr ATS: asynchronous traffic shaping without a clock

· 7 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Class-based shapers let the bursts of a stream grow from hop to hop, and scheduled traffic needs a network-wide clock and a central schedule. Asynchronous Traffic Shaping (ATS) avoids both problems: it restores each stream's original traffic contract at every hop, using only the bridge's local clock.

IEEE 802.1Qci PSFP: per-stream filtering and policing at ingress

· 5 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Every bound in this series assumes that each talker respects its arrival curve. Per-Stream Filtering and Policing (PSFP) is the TSN mechanism that makes that assumption hold. It checks each stream where it enters a bridge and stops a faulty or malicious talker before it can harm the streams that behave.

IEEE 802.1Qat, 802.1Qcc and P802.1DD: stream reservation and admission control

· 7 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

A shaper bounds latency only if the traffic it serves stays within what it was configured for. Something must therefore decide, before a stream starts, whether the network can carry it. This post covers the distributed way of making that decision, in which the bridges themselves admit or reject streams. The centralised alternative is covered in the SDN post.

IEEE 802.1Qcc and SDN: the CNC as a software-defined controller

· 7 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

TSN gives every bridge gates, shapers, filters and redundancy. Something still has to decide how all of them are set, in a consistent way, across the whole network. In most TSN deployments that is a central controller, and the architecture it fits into is software-defined networking (SDN).

ATM and MPLS: the networks behind the classic network calculus examples

· 12 min read
PhD candidate, LyRIDS (ECE) × CEDRIC (Cnam)

Network calculus grew up in the 1990s, when the networks that promised quality of service were ATM and, a little later, IP with IntServ, DiffServ and MPLS. That is why its textbooks speak of cells, leaky buckets, virtual circuits and label-switched paths. This post explains those networks just enough to read the classic examples, and shows that the same ideas reappear in TSN and DetNet.