<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet type="text/xsl" href="rss.xsl"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>Network Calculus Notes Blog</title>
        <link>https://cnam-ece.github.io/learning-materials/blog</link>
        <description>Network Calculus Notes Blog</description>
        <lastBuildDate>Mon, 28 Sep 2026 00:00:00 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <item>
            <title><![CDATA[Determinism: from the OSI and TCP/IP Ethernet stack to TSN]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn</guid>
            <pubDate>Mon, 28 Sep 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[What determinism means for a network, how ordinary Ethernet fits the seven OSI layers and the four TCP/IP layers, why that stack is not deterministic, and how TSN extends standard Ethernet so that IT and OT traffic can share one connection.]]></description>
            <content:encoded><![CDATA[<p>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.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 310" width="720" role="img" aria-label="The seven OSI layers with example protocols and data units, the four TCP/IP layers they map to, and where IETF DetNet (Internet layer) and IEEE 802.1 TSN (link layer) extend the stack"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><text x="85" y="14" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">OSI model</text><text x="250" y="14" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Examples, data unit</text><text x="445" y="14" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TCP/IP model</text><text x="620" y="14" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Deterministic extension</text><g><g><rect x="10" y="30" width="150" height="32" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="85" y="46" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L7 Application</text></g><g><rect x="170" y="30" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="39.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">HTTP, OPC UA, MQTT</text><text x="255" y="52.175000000000004" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">data</text></g></g><g><g><rect x="10" y="68" width="150" height="32" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="85" y="84" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L6 Presentation</text></g><g><rect x="170" y="68" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="77.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">encoding, TLS</text><text x="255" y="90.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">data</text></g></g><g><g><rect x="10" y="106" width="150" height="32" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="85" y="122" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L5 Session</text></g><g><rect x="170" y="106" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="115.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">dialogue control</text><text x="255" y="128.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">data</text></g></g><g><g><rect x="10" y="144" width="150" height="32" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="85" y="160" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L4 Transport</text></g><g><rect x="170" y="144" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="153.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TCP, UDP</text><text x="255" y="166.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">segment, datagram</text></g></g><g><g><rect x="10" y="182" width="150" height="32" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="85" y="198" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L3 Network</text></g><g><rect x="170" y="182" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="191.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IP, routing</text><text x="255" y="204.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">packet</text></g></g><g><g><rect x="10" y="220" width="150" height="32" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="85" y="236" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L2 Data link</text></g><g><rect x="170" y="220" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="229.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ethernet MAC, bridging</text><text x="255" y="242.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame</text></g></g><g><g><rect x="10" y="258" width="150" height="32" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="85" y="274" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L1 Physical</text></g><g><rect x="170" y="258" width="170" height="32" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="255" y="267.825" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ethernet PHY, cable</text><text x="255" y="280.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">bits</text></g></g><g><g><rect x="370" y="30" width="150" height="108" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="445" y="84" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Application</text></g><path d="M340,84 H370" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path></g><g><g><rect x="370" y="144" width="150" height="32" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="445" y="160" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Transport</text></g><path d="M340,160 H370" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path></g><g><g><rect x="370" y="182" width="150" height="32" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="445" y="198" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Internet</text></g><path d="M340,198 H370" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path></g><g><g><rect x="370" y="220" width="150" height="70" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="445" y="255" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Link</text></g><path d="M340,255 H370" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path></g><g><rect x="550" y="30" width="160" height="146" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="630" y="90" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">unchanged</text><text x="630" y="103" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">applications see</text><text x="630" y="116" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">a bounded network</text></g><g><rect x="550" y="182" width="160" height="32" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="630" y="191.5" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IETF DetNet</text><text x="630" y="204.5" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IP, MPLS</text></g><g><rect x="550" y="220" width="160" height="70" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="630" y="242" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.1 TSN</text><text x="630" y="255" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">time, shaping,</text><text x="630" y="268" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">redundancy, config</text></g><path d="M520,198 H550" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)"></path><path d="M520,255 H550" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. The seven OSI layers, the four TCP/IP layers they correspond to, and where the deterministic extensions act. Upper layers are unchanged; IETF DetNet extends the internet layer, and IEEE 802.1 TSN extends the link layer that Ethernet implements.<span class="nc-figure-source">Source: <!-- -->own drawing, after the layer descriptions and the OSI to TCP/IP comparison in the Wikipedia articles <a href="https://en.wikipedia.org/wiki/OSI_model">OSI model</a> and<!-- --> <a href="https://en.wikipedia.org/wiki/Internet_protocol_suite">Internet protocol suite</a>, and<!-- --> <a href="https://www.rfc-editor.org/rfc/rfc1122">RFC 1122</a>.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->24<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-CSMACD"><td><b>CSMA/CD</b></td><td>Carrier-Sense Multiple Access with Collision Detection</td><td>The access method of the original shared-medium Ethernet: listen before sending, detect collisions, back off for a random time and retry. The random back-off makes the delay unpredictable.</td></tr><tr id="abbr-DetNet"><td><a href="https://www.rfc-editor.org/rfc/rfc8655"><b>DetNet</b></a></td><td>Deterministic Networking</td><td>The IETF architecture and working group for bounded-latency, low-loss flows over IP and MPLS (RFC 8655).</td></tr><tr id="abbr-FRER"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>FRER</b></a></td><td>Frame Replication and Elimination for Reliability</td><td>IEEE 802.1CB: frames are numbered, sent over disjoint paths, and duplicates are removed.</td></tr><tr id="abbr-GCL"><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/"><b>GCL</b></a></td><td>Gate Control List</td><td>The repeating timetable of gate states used by the Time-Aware Shaper (and by stream gates in PSFP).</td></tr><tr id="abbr-gPTP"><td><a href="https://1.ieee802.org/tsn/802-1as-2020/"><b>gPTP</b></a></td><td>generalized Precision Time Protocol</td><td>The profile of PTP defined by IEEE 802.1AS, in which every bridge takes part in time distribution.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IETF"><td><a href="https://www.ietf.org/"><b>IETF</b></a></td><td>Internet Engineering Task Force</td><td>The body that develops Internet standards, published as RFCs.</td></tr><tr id="abbr-IP"><td><a href="https://www.rfc-editor.org/rfc/rfc791"><b>IP</b></a></td><td>Internet Protocol</td><td>The network-layer protocol of the Internet (IPv4, RFC 791; IPv6, RFC 8200).</td></tr><tr id="abbr-IT"><td><b>IT</b></td><td>Information Technology</td><td>Computing and networking for information processing, such as office, business and cloud systems.</td></tr><tr id="abbr-LAN"><td><b>LAN</b></td><td>Local Area Network</td><td>A network covering a limited area, such as a building or a vehicle; IEEE 802 standardises LANs.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-OSI"><td><b>OSI</b></td><td>Open Systems Interconnection</td><td>The seven-layer reference model for communication protocols (ISO/IEC 7498-1).</td></tr><tr id="abbr-OT"><td><b>OT</b></td><td>Operational Technology</td><td>Hardware and software that monitor and control physical processes, such as controllers, drives and sensors in a factory.</td></tr><tr id="abbr-PDU"><td><b>PDU</b></td><td>Protocol Data Unit</td><td>The unit of data at one layer: a frame at the data link layer, a packet at the network layer, a segment (TCP) or datagram (UDP) at the transport layer.</td></tr><tr id="abbr-PHY"><td><b>PHY</b></td><td>Physical layer</td><td>Layer 1: the transmission of bits over a medium such as copper, fibre or radio.</td></tr><tr id="abbr-PTP"><td><a href="https://standards.ieee.org/ieee/1588/6825/"><b>PTP</b></a></td><td>Precision Time Protocol</td><td>IEEE 1588, a protocol that synchronises clocks over a packet network using timestamped message exchanges.</td></tr><tr id="abbr-QoS"><td><b>QoS</b></td><td>Quality of Service</td><td>The treatment a network gives to a flow or class, in terms of bandwidth, delay, jitter and loss.</td></tr><tr id="abbr-RTAG"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>R-TAG</b></a></td><td>Redundancy tag</td><td>The 802.1CB tag that carries the sequence number of a replicated frame.</td></tr><tr id="abbr-RFC"><td><a href="https://www.rfc-editor.org/"><b>RFC</b></a></td><td>Request for Comments</td><td>The document series in which IETF standards and related documents are published.</td></tr><tr id="abbr-TAS"><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/"><b>TAS</b></a></td><td>Time-Aware Shaper</td><td>IEEE 802.1Qbv scheduled traffic: a gate per queue, opened and closed by a repeating gate control list.</td></tr><tr id="abbr-TCP"><td><a href="https://www.rfc-editor.org/rfc/rfc9293"><b>TCP</b></a></td><td>Transmission Control Protocol</td><td>A reliable, connection-oriented transport protocol with congestion control (RFC 9293).</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-UDP"><td><a href="https://www.rfc-editor.org/rfc/rfc768"><b>UDP</b></a></td><td>User Datagram Protocol</td><td>A connectionless transport protocol without congestion control (RFC 768).</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition-determinism">1. Definition: determinism<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#1-definition-determinism" class="hash-link" aria-label="Direct link to 1. Definition: determinism" title="Direct link to 1. Definition: determinism" translate="no">​</a></h2>
<p>A network is <strong>deterministic</strong> for a flow when it can guarantee that every packet of the flow arrives within a precise, predictable and bounded time. In practice that means three properties, each stated as a bound rather than an average:</p>
<table><thead><tr><th>Property</th><th>Guarantee</th></tr></thead><tbody><tr><td>Bounded latency</td><td>No packet takes longer than a known maximum from source to destination</td></tr><tr><td>Bounded jitter</td><td>The variation of that latency stays within a known range</td></tr><tr><td>No congestion loss</td><td>No packet is dropped because a queue overflowed</td></tr></tbody></table>
<p>Fast is not the same as deterministic. A best-effort network can have a very low average delay and still, occasionally, delay a packet by orders of magnitude. For a closed control loop, one late packet can be as bad as a lost one [1]. <a class="" href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees">Why deterministic guarantees?</a> develops this contrast between average and worst case.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-the-osi-reference-model-seven-layers">2. The OSI reference model: seven layers<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#2-the-osi-reference-model-seven-layers" class="hash-link" aria-label="Direct link to 2. The OSI reference model: seven layers" title="Direct link to 2. The OSI reference model: seven layers" translate="no">​</a></h2>
<p>The <strong>OSI model</strong>, published by ISO in 1984, describes communication in seven abstraction layers, from the transmission of bits to the data of a distributed application. Each layer serves the one above it and is served by the one below [2]:</p>
<table><thead><tr><th>Layer</th><th>Role</th><th>Ethernet / Internet example</th><th>Data unit</th></tr></thead><tbody><tr><td>7 Application</td><td>Services to applications</td><td>HTTP, MQTT, OPC UA</td><td>data</td></tr><tr><td>6 Presentation</td><td>Representation of data</td><td>encoding, encryption (TLS)</td><td>data</td></tr><tr><td>5 Session</td><td>Dialogue between applications</td><td>opening and closing sessions</td><td>data</td></tr><tr><td>4 Transport</td><td>End-to-end delivery between processes</td><td>TCP, UDP</td><td>segment, datagram</td></tr><tr><td>3 Network</td><td>Addressing and routing across networks</td><td>IP</td><td>packet</td></tr><tr><td>2 Data link</td><td>Delivery between neighbours on one network</td><td>Ethernet MAC, bridging (IEEE 802.1)</td><td>frame</td></tr><tr><td>1 Physical</td><td>Bits on the medium</td><td>Ethernet PHY (IEEE 802.3), cable, fibre</td><td>bits</td></tr></tbody></table>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-ieee802-osi.png" alt="OSI reference model with IEEE 802 covering the data link and physical layers and IEEE 802.1 at the top of the data link layer" loading="lazy" style="max-width:min(100%, 300px)"><figcaption>Figure 2. Where IEEE 802 sits in the OSI model: IEEE 802 standards cover the physical and data link layers, with IEEE 802.1 at the top of the data link layer. Ethernet (IEEE 802.3) and TSN (IEEE 802.1) are both here.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 4<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-from-osi-to-the-tcpip-model">3. From OSI to the TCP/IP model<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#3-from-osi-to-the-tcpip-model" class="hash-link" aria-label="Direct link to 3. From OSI to the TCP/IP model" title="Direct link to 3. From OSI to the TCP/IP model" translate="no">​</a></h2>
<p>The protocols actually used on the Internet follow a simpler model. The <strong>Internet protocol suite</strong>, or TCP/IP model, defined in RFC 1122 and RFC 1123, has four layers named by their scope rather than numbered by function [3][4]:</p>
<table><thead><tr><th>TCP/IP layer</th><th>Scope</th><th>Corresponding OSI layers</th></tr></thead><tbody><tr><td>Application</td><td>Process-to-process data for applications</td><td>7, 6 and most of 5</td></tr><tr><td>Transport</td><td>Host to host: TCP (reliable) or UDP (unreliable)</td><td>4 (and part of 5)</td></tr><tr><td>Internet</td><td>Between independent networks: IP</td><td>part of 3</td></tr><tr><td>Link</td><td>Within one network segment: for example Ethernet</td><td>2, with functions of 1</td></tr></tbody></table>
<p>The OSI model is still the common vocabulary, but the TCP/IP suite became the standard for networking because its protocols were simpler and could be implemented independently [2]. Both models rest on <strong>encapsulation</strong>: each layer wraps the data of the layer above in its own header [3].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/udp-encapsulation.svg" alt="Application data wrapped in a UDP header, then an IP header, then an Ethernet frame header and footer as it descends the stack" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 3. Encapsulation down the TCP/IP stack: application data gets a UDP header, then an IP header, and finally an Ethernet frame header and trailer before it reaches the wire.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:UDP_encapsulation.svg">UDP encapsulation.svg</a> by <!-- -->Cburnett, colourised by Kbrose<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Internet_protocol_suite">Internet protocol suite</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by-sa/3.0/">CC BY-SA 3.0</a>.</span></figcaption></figure>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/ip-stack-connections.svg" alt="Two hosts connected through two routers: application and transport layers run end to end between the hosts, the internet layer runs in every router, and the link layer is per link" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 4. Two hosts connected through two routers. Application and transport layers run end to end, between the hosts only; the internet layer runs in every router; the link layer, such as Ethernet, runs separately on each link.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:IP_stack_connections.svg">IP stack connections.svg</a> by <!-- -->Kbrose<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Internet_protocol_suite">Internet protocol suite</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by-sa/3.0/">CC BY-SA 3.0</a>.</span></figcaption></figure>
<p>Figure 4 shows the key point for determinism: <strong>the link layer is where frames wait.</strong> Every switch or router on the path queues frames before sending them on the next link. Whatever happens in those queues decides the delay.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-ethernet-the-link-layer-of-almost-everything">4. Ethernet: the link layer of almost everything<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#4-ethernet-the-link-layer-of-almost-everything" class="hash-link" aria-label="Direct link to 4. Ethernet: the link layer of almost everything" title="Direct link to 4. Ethernet: the link layer of almost everything" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/ethernet-frame.svg" alt="Ethernet Type II frame: 14-byte MAC header with destination MAC, source MAC and EtherType, a 46 to 1500 byte payload, and a 4-byte CRC" loading="lazy"><figcaption>Figure 5. An Ethernet Type II frame: a 14-byte MAC header (destination address, source address, EtherType), 46 to 1500 bytes of payload, and a 4-byte check sequence.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Ethernet_Type_II_Frame_format.svg">Ethernet Type II Frame format.svg</a> by <!-- -->Wikimedia Commons contributors<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Ethernet_frame">Ethernet frame</a>”, Wikimedia Commons, <a href="https://commons.wikimedia.org/wiki/Commons:Licensing#Public_domain">Public domain</a>.</span></figcaption></figure>
<p>Ethernet, standardised by the IEEE 802 project from 1980 onward, covers the physical layer and the lower part of the data link layer (IEEE 802.3), while bridging and VLANs are specified by IEEE 802.1 [5][6]. Its history explains why it was not deterministic to begin with:</p>
<ul>
<li class=""><strong>Shared medium.</strong> The original Ethernet put every station on one coaxial cable. Access was governed by <strong>CSMA/CD</strong>: a station listens, transmits, and on a collision backs off for a random time and tries again. The random back-off makes the delay of a frame unpredictable, and heavy load makes collisions more frequent [5].</li>
<li class=""><strong>Switched, full-duplex Ethernet.</strong> Bridges and switches split the network into separate links, and full-duplex links remove collisions altogether [5]. This is the Ethernet used today. But a switch still <strong>stores frames in queues</strong> at each output port. When frames from several inputs head for the same output, they wait, and the waiting time depends on all the other traffic.</li>
<li class=""><strong>Priorities are not enough.</strong> IEEE 802.1Q gives eight priority levels, but a frame already being transmitted cannot be interrupted, and nothing ties transmission to a common time. A critical frame can still wait behind a long frame or a burst of other traffic [7].</li>
</ul>
<p>The layers above add their own variability. TCP retransmits lost segments and slows down on congestion, which is right for file transfer but useless for a control message that is only valid for a few milliseconds. UDP adds no retransmission, but no guarantee either. <strong>The stack as a whole is best effort:</strong> it delivers, usually quickly, but promises no bound.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-why-industry-needs-a-deterministic-ethernet">5. Why industry needs a deterministic Ethernet<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#5-why-industry-needs-a-deterministic-ethernet" class="hash-link" aria-label="Direct link to 5. Why industry needs a deterministic Ethernet" title="Direct link to 5. Why industry needs a deterministic Ethernet" translate="no">​</a></h2>
<p>Industrial systems carry two kinds of traffic with opposite needs [1]:</p>
<table><thead><tr><th></th><th>OT (operational technology)</th><th>IT (information technology)</th></tr></thead><tbody><tr><td>Examples</td><td>Machine control, sensor values</td><td>E-mail, firmware updates</td></tr><tr><td>What matters</td><td>Fixed delay, low latency, low jitter</td><td>Throughput</td></tr><tr><td>If late</td><td>The data is useless, and the machine may fail</td><td>Nothing serious; best effort is enough</td></tr><tr><td>Bandwidth</td><td>Usually small</td><td>Usually larger</td></tr></tbody></table>
<p>The traditional answer was <strong>two networks</strong>: one for OT, often a fieldbus or a proprietary variant of Ethernet, and one for IT. That doubles cabling and equipment, and the proprietary OT networks do not interoperate with each other or follow the speed increases of standard Ethernet [1][8].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-tsn-an-extension-of-standard-ethernet">6. TSN: an extension of standard Ethernet<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#6-tsn-an-extension-of-standard-ethernet" class="hash-link" aria-label="Direct link to 6. TSN: an extension of standard Ethernet" title="Direct link to 6. TSN: an extension of standard Ethernet" translate="no">​</a></h2>
<p><strong>Time-Sensitive Networking</strong> sits on top of standard Ethernet. It is a set of IEEE 802.1 standards that lets one Ethernet network carry IT and OT data on a shared connection, while each kind of traffic still gets what it needs [1][10]. In Cisco's description, the IEEE TSN task group develops specifications that provide deterministic services over layer 1 and layer 2. These are implemented in Ethernet switches such as the Cisco Industrial Ethernet 4000 Series, and are being extended towards wireless access such as 5G [9].</p>
<p>TSN does not replace any layer. As Figure 1 shows, applications, TCP/IP and the Ethernet frame format stay the same; TSN adds functions to the bridges and the MAC. Each standard covers one function, and system designers combine the ones they need [1]. The three described in [1] cover the three gaps of Section 4:</p>
<p><strong>A common time: 802.1AS.</strong> TSN timing comes from the Precision Time Protocol (PTP, IEEE 1588), which distributes time from a grandmaster clock, such as a GPS-disciplined source, through a tree of master and slave clocks. The generalized PTP of 802.1AS is a stricter profile: it requires a peer-to-peer delay measurement on every link, expects all devices to run at the same frequency (syntonised), and in newer revisions brings back one-step timestamping [1]. Devices are synchronised to within nanoseconds [1]. See <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1as-time-synchronization">the 802.1AS post</a>.</p>
<p><strong>Scheduled transmission: 802.1Qbv.</strong> A time-aware shaper at each egress port gives each of the eight queues a gate. A gate control list opens and closes the gates on a repeating schedule, so time slots can be reserved for OT traffic and others left to IT traffic [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/qbv-schedule.svg" alt="Two cycles of an 802.1Qbv schedule, each with a short time slice for VLAN priority 3 followed by a longer slice for all other priorities" loading="lazy"><figcaption>Figure 6. An 802.1Qbv schedule: in every cycle, one time slice is reserved for the time-critical priority and the rest is left to all other traffic.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Figure_1-_Example_IEEE_802.1Qbv_schedule.svg">Figure 1- Example IEEE 802.1Qbv schedule.svg</a> by <!-- -->Ulgorash<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Time-Sensitive_Networking">Time-Sensitive Networking</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by-sa/4.0/">CC BY-SA 4.0</a>.</span></figcaption></figure>
<p>Before each protected slot, the hardware keeps a <strong>guard band</strong>: it does not start a frame that could not finish before the slot begins, and holds it for the next slot of its class instead [1]. Traffic is mapped to queues by priority, protocol, destination port or traffic type [1]. See <a class="" href="https://cnam-ece.github.io/learning-materials/blog/time-aware-shaper">the TAS post</a>.</p>
<p><strong>Redundancy without retransmission: 802.1CB.</strong> Frames of a stream are replicated and sent over two paths, typically both ways round a ring. A redundancy tag carries a sequence number, and the receiver keeps the first copy of each number and discards the duplicates. If a link breaks, no frame is lost and no retransmission delay occurs, and the hardware does the work instead of application software [1]. See <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">the FRER post</a>.</p>
<p>The full set of tools, including credit-based shaping, preemption, cyclic queuing, policing and configuration, is described in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">the TSN toolbox</a>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="7-why-it-prepares-a-system-for-the-future">7. Why it prepares a system for the future<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#7-why-it-prepares-a-system-for-the-future" class="hash-link" aria-label="Direct link to 7. Why it prepares a system for the future" title="Direct link to 7. Why it prepares a system for the future" translate="no">​</a></h2>
<ul>
<li class=""><strong>One converged network.</strong> IT and OT share cables, switches and management, instead of running two networks side by side [1].</li>
<li class=""><strong>Standard Ethernet underneath.</strong> TSN rides on IEEE 802.3, so it benefits from each new Ethernet speed and from multi-vendor, standard hardware rather than a proprietary fieldbus [1][8].</li>
<li class=""><strong>Guarantees that can be proven.</strong> Bounded latency and no congestion loss are properties of the configuration, which can be checked before a stream is admitted. That is the role of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra">network calculus</a> in this series.</li>
<li class=""><strong>Beyond one LAN.</strong> Where a deterministic path must cross routers, IETF DetNet provides the same service at the internet layer (Figure 1 and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ietf-detnet">the DetNet post</a>).</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="8-summary">8. Summary<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#8-summary" class="hash-link" aria-label="Direct link to 8. Summary" title="Direct link to 8. Summary" translate="no">​</a></h2>
<table><thead><tr><th>Layer (TCP/IP)</th><th>Ordinary behaviour</th><th>Deterministic extension</th></tr></thead><tbody><tr><td>Application, transport</td><td>TCP retransmits and adapts; UDP gives no guarantee</td><td>Unchanged: they receive a bounded service</td></tr><tr><td>Internet</td><td>IP routing, best effort</td><td>IETF DetNet</td></tr><tr><td>Link (Ethernet)</td><td>Switched queues, eight priorities, no common time</td><td>IEEE 802.1 TSN: 802.1AS time, 802.1Qbv schedules, 802.1CB redundancy, and more</td></tr><tr><td>Physical</td><td>IEEE 802.3 PHY</td><td>Unchanged, plus frame preemption (802.3br)</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/determinism-from-ethernet-to-tsn#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J. Steinheider (NXP Semiconductors), "The Fundamentals of Time-Sensitive Networking," <em>All About Circuits</em>, industry article, 19 January 2021. <a href="https://www.allaboutcircuits.com/industry-articles/the-fundamentals-of-time-sensitive-networking/" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">Wikipedia, "OSI model," sections on the layer architecture and the comparison with the TCP/IP model. <a href="https://en.wikipedia.org/wiki/OSI_model" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">Wikipedia, "Internet protocol suite," sections on key architectural principles and layers. <a href="https://en.wikipedia.org/wiki/Internet_protocol_suite" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">R. Braden (Ed.), RFC 1122, "Requirements for Internet Hosts – Communication Layers," IETF, October 1989. <a href="https://www.rfc-editor.org/rfc/rfc1122" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">Wikipedia, "Ethernet," sections on standardisation, shared medium, and bridging and switching. <a href="https://en.wikipedia.org/wiki/Ethernet" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">IEEE, <em>IEEE 802.3, Standard for Ethernet</em>. <a href="https://standards.ieee.org/ieee/802.3/10422/" target="_blank" rel="noopener noreferrer" class="">IEEE SA</a></li>
<li class="">J. Farkas, "TSN Basic Concepts," DetNet–TSN workshop, 11 November 2018. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Woods, "IEC/IEEE 60802: The Case for the Converged Network in the Factory of the Future," IEEE SA TSN webinar series, April 2023, slide 8. <a href="https://www.ieee802.org/1/files/public/docs2023/webinar-woods-TSN_60802-0423.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">Cisco Systems, "Wi-Fi 6 and Private LTE/5G Technology and Business Models in Industrial IoT," white paper, 2019, section on IEEE standards. <a href="https://www.cisco.com/c/dam/en_us/solutions/iot/iot-5g-wp.pdf" target="_blank" rel="noopener noreferrer" class="">PDF</a></li>
<li class="">IEEE 802.1, <em>Time-Sensitive Networking (TSN) Task Group</em>. <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>Deterministic networking</category>
            <category>TSN</category>
            <category>IEEE 802.1</category>
            <category>Article</category>
        </item>
        <item>
            <title><![CDATA[Why deterministic guarantees? From TSN to worst-case bounds]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees</guid>
            <pubDate>Tue, 29 Sep 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Motivation for deterministic network calculus, and why measurement alone cannot certify a Time-Sensitive Network.]]></description>
            <content:encoded><![CDATA[<p><a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Time-Sensitive Networking</a> (TSN) promises that a standard <a href="https://standards.ieee.org/ieee/802.3/10422/" target="_blank" rel="noopener noreferrer" class="">Ethernet</a> network can carry control traffic with <em>bounded</em> <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a>. This first post explains what "bounded" means, why it cannot be established by measurement alone, and why deterministic <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> is the analytical tool of choice for establishing it.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-the-promise-of-tsn">1. The promise of TSN<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#1-the-promise-of-tsn" class="hash-link" aria-label="Direct link to 1. The promise of TSN" title="Direct link to 1. The promise of TSN" translate="no">​</a></h2>
<p>TSN is a family of <a href="https://1.ieee802.org/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1</a> amendments that add deterministic behaviour to bridged Ethernet. Industrial guides typically single out four of them [3]:</p>
<table><thead><tr><th>Standard</th><th>Mechanism</th><th>Role in the guarantee</th></tr></thead><tbody><tr><td><a href="https://1.ieee802.org/tsn/802-1as-2020/" target="_blank" rel="noopener noreferrer" class="">802.1AS</a></td><td>Generalised <a href="https://standards.ieee.org/ieee/1588/6825/" target="_blank" rel="noopener noreferrer" class="">Precision Time Protocol</a> (gPTP)</td><td>Common time base for all <a href="https://en.wikipedia.org/wiki/Network_bridge" target="_blank" rel="noopener noreferrer" class="">bridges</a> and end stations</td></tr><tr><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">802.1Qbv</a></td><td>Time-Aware Shaper (TAS)</td><td>Gate control lists open and close queues at scheduled instants</td></tr><tr><td><a href="https://1.ieee802.org/tsn/802-1qci/" target="_blank" rel="noopener noreferrer" class="">802.1Qci</a></td><td>Per-Stream Filtering and <a href="https://en.wikipedia.org/wiki/Traffic_policing_(communications)" target="_blank" rel="noopener noreferrer" class="">Policing</a> (PSFP)</td><td>Enforces the traffic contract declared by each stream</td></tr><tr><td><a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a></td><td>Frame Replication and Elimination (FRER)</td><td>Seamless redundancy over disjoint paths</td></tr></tbody></table>
<p>A shorter glossary is kept in the <a class="" href="https://cnam-ece.github.io/learning-materials/reference/tsn-glossary">TSN glossary</a>.</p>
<p>The promise is converged traffic: <a href="https://en.wikipedia.org/wiki/Control_loop" target="_blank" rel="noopener noreferrer" class="">control loops</a>, video and <a href="https://en.wikipedia.org/wiki/Best-effort_delivery" target="_blank" rel="noopener noreferrer" class="">best-effort</a> traffic share one physical network, and the control traffic still meets its deadlines. That promise is only as strong as the argument that supports it.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-average-case-versus-worst-case-performance">2. Average-case versus worst-case performance<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#2-average-case-versus-worst-case-performance" class="hash-link" aria-label="Direct link to 2. Average-case versus worst-case performance" title="Direct link to 2. Average-case versus worst-case performance" translate="no">​</a></h2>
<p>Classical queueing theory answers questions such as "what is the <em>mean</em> delay of a packet?" or "what is the probability that the delay exceeds 1 ms?". Such answers are indispensable for dimensioning best-effort networks, but they are the wrong kind of answer for a safety-critical control loop, for two reasons.</p>
<ol>
<li class=""><strong>Rare events are exactly the events that matter.</strong> A braking command delayed once in <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mn>10</mn><mn>9</mn></msup></mrow><annotation encoding="application/x-tex">10^9</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">9</span></span></span></span></span></span></span></span></span></span></span> frames is acceptable in a statistical sense and unacceptable in an engineering sense.</li>
<li class=""><strong>Stochastic assumptions are hard to justify.</strong> Poisson arrivals and independence between flows are modelling conveniences; certification authorities ask for arguments that hold for <em>every</em> admissible traffic pattern.</li>
</ol>
<p>Deterministic network calculus replaces probabilistic assumptions with <em>envelopes</em>: each flow is assumed only to respect an upper bound on the amount of data it can emit in any interval, and each network element is assumed only to guarantee a lower bound on the service it provides. From these two envelopes it derives bounds that hold for every trajectory compatible with them.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-why-measurement-does-not-suffice">3. Why measurement does not suffice<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#3-why-measurement-does-not-suffice" class="hash-link" aria-label="Direct link to 3. Why measurement does not suffice" title="Direct link to 3. Why measurement does not suffice" translate="no">​</a></h2>
<p>The practical TSN migration guide by TSF Technology proposes a five-phase method: audit the existing network and identify critical flows, design the TSN topology and synchronisation domains, pilot on a segment, configure scheduled traffic with 802.1Qbv, and finally <em>validate latency and <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">jitter</a> against requirements</em> [3]. The last phase is usually carried out by measurement.</p>
<p>Measurement establishes a <em>lower</em> bound on the worst-case delay: the largest observed value. A certificate needs an <em>upper</em> bound. The gap between the two can be large, because the worst case arises from a precise alignment of bursts on every hop of a path, which a test campaign is unlikely to provoke. In the companion repository on certified <a href="https://en.wikipedia.org/wiki/Admission_control" target="_blank" rel="noopener noreferrer" class="">admission control</a>, packet-level simulation of 4,915 admitted flows observed a median worst delay of only 19 % (control traffic) and 10 % (stream traffic) of the analytical bound [4]. These figures are a sanity check, not a tightness measure: they illustrate that the observed maximum and the provable maximum are different quantities.</p>
<div class="theme-admonition theme-admonition-note admonition_U78o alert alert--secondary"><div class="admonitionHeading_hpf8"><span class="admonitionIcon_bCJT"><svg viewBox="0 0 14 16"><path fill-rule="evenodd" d="M6.3 5.69a.942.942 0 0 1-.28-.7c0-.28.09-.52.28-.7.19-.18.42-.28.7-.28.28 0 .52.09.7.28.18.19.28.42.28.7 0 .28-.09.52-.28.7a1 1 0 0 1-.7.3c-.28 0-.52-.11-.7-.3zM8 7.99c-.02-.25-.11-.48-.31-.69-.2-.19-.42-.3-.69-.31H6c-.27.02-.48.13-.69.31-.2.2-.3.44-.31.69h1v3c.02.27.11.5.31.69.2.2.42.31.69.31h1c.27 0 .48-.11.69-.31.2-.19.3-.42.31-.69H8V7.98v.01zM7 2.3c-3.14 0-5.7 2.54-5.7 5.68 0 3.14 2.56 5.7 5.7 5.7s5.7-2.55 5.7-5.7c0-3.15-2.56-5.69-5.7-5.69v.01zM7 .98c3.86 0 7 3.14 7 7s-3.14 7-7 7-7-3.12-7-7 3.14-7 7-7z"></path></svg></span>Key distinction</div><div class="admonitionContent_PHbT"><p>A measured maximum answers "what happened?". A network calculus bound answers "what <em>can</em> happen, under the stated assumptions?". Only the second can be used as a guarantee.</p></div></div>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-static-configuration-and-the-reconfiguration-problem">4. Static configuration and the reconfiguration problem<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#4-static-configuration-and-the-reconfiguration-problem" class="hash-link" aria-label="Direct link to 4. Static configuration and the reconfiguration problem" title="Direct link to 4. Static configuration and the reconfiguration problem" translate="no">​</a></h2>
<p>TSN guarantees are usually established for a configuration that is computed and verified offline, then frozen. In practice, networks change: flows are added and removed, links fail, and production lines are reconfigured. Two recent lines of work, discussed in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn">the reconfiguration post</a>, illustrate the tension:</p>
<ul>
<li class="">Sertbaş Bülbül, Ergenç and Fischer use a <a href="https://www.rfc-editor.org/rfc/rfc7426" target="_blank" rel="noopener noreferrer" class="">software-defined networking</a> (SDN) controller to migrate time-sensitive flows to new paths at run time [5];</li>
<li class="">Boyer and Henia design a Time-Aware Shaper schedule that can absorb rescue flows after a permanent link fault without modifying existing windows [6].</li>
</ul>
<p>Both raise the same question: <em>after</em> the change, does every admitted flow still meet its deadline? Answering it quickly and soundly is the motivation for this series.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-plan-of-the-series">5. Plan of the series<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#5-plan-of-the-series" class="hash-link" aria-label="Direct link to 5. Plan of the series" title="Direct link to 5. Plan of the series" translate="no">​</a></h2>
<p>The posts are grouped by topic. Topics are meant to be read in this order, and posts in the order listed.</p>
<table><thead><tr><th>Topic</th><th>Posts</th></tr></thead><tbody><tr><td>Deterministic networks</td><td>This post · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking">Deterministic networking</a></td></tr><tr><td>Network calculus</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra">Min-plus algebra</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">Arrival curves</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/service-curves">Service curves</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">The three fundamental bounds</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once">Concatenation and "pay bursts only once"</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">Aggregate multiplexing and residual service</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/atm-and-mpls">ATM and MPLS</a></td></tr><tr><td>IEEE 802.1</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group">IEEE 802.1 and the TSN task group</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge">The IEEE 802.1Q bridge</a></td></tr><tr><td><a href="https://www.ietf.org/" target="_blank" rel="noopener noreferrer" class="">IETF</a></td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/ietf-detnet">IETF DetNet</a></td></tr><tr><td>TSN</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">The TSN toolbox</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1as-time-synchronization">802.1AS time synchronisation</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/credit-based-shaper">Credit-Based Shaper</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/time-aware-shaper">Time-Aware Shaper</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-3br-interspersing-express-traffic">802.3br</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qbu-frame-preemption">802.1Qbu</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/cyclic-queuing-and-forwarding">Cyclic Queuing and Forwarding</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/asynchronous-traffic-shaping">Asynchronous Traffic Shaping</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/per-stream-filtering-and-policing">Per-Stream Filtering and Policing</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">Frame Replication and Elimination</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/stream-reservation">Stream reservation</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn">Network calculus for TSN shapers</a></td></tr><tr><td>TSN profiles</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1ba-avb-profile">802.1BA (AVB)</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1cm-fronthaul-profile">802.1CM (fronthaul)</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/iec-ieee-60802-industrial-profile">IEC/IEEE 60802 (industrial)</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1dg-automotive-profile">802.1DG (automotive)</a></td></tr><tr><td>SDN</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/sdn-and-tsn-configuration">SDN and TSN configuration</a> · <a class="" href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn">Dynamic reconfiguration of TSN</a></td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>Networks and Calculus</em>, lecture by Prof. Jean-Yves Le Boudec (EPFL School of Computer and Communication Sciences). <a href="https://www.youtube.com/watch?v=NpoqqPM4LYA" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/why-deterministic-guarantees#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus: A Theory of Deterministic Queuing Systems for the Internet</em>, LNCS 2050, Springer, 2001. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus: From Theory to Practical Implementation</em>, Wiley-ISTE, 2018.</li>
<li class="">TSF Technology, "Migration vers TSN : guide pratique," technical guide. <a href="https://tsf-technology.com/fr/ressources/guides-techniques/migration-tsn-guide-pratique" target="_blank" rel="noopener noreferrer" class="">Link</a></li>
<li class="">CNAM-ECE, <em>Certified Admission Control for TSN</em>, companion repository. <a href="https://github.com/CNAM-ECE/network-calculus" target="_blank" rel="noopener noreferrer" class="">GitHub</a></li>
<li class="">N. Sertbaş Bülbül, D. Ergenç, M. Fischer, "Towards SDN-based Dynamic Path Reconfiguration for Time Sensitive Networking," IEEE/IFIP NOMS 2022. <a href="https://ieeexplore.ieee.org/document/9789890" target="_blank" rel="noopener noreferrer" class="">IEEE Xplore</a></li>
<li class="">M. Boyer, R. Henia, "Designing a Resilient Time-Aware Shaper Configuration for TSN," Ethernet &amp; IP @ Automotive Technology Day, Toulouse, October 2025. <a href="https://standards.ieee.org/wp-content/uploads/2025/10/D1_09_Marc-Boyer-TSN-reconfiguration.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Article</category>
            <category>Presentation</category>
            <category>Guide</category>
            <category>Book</category>
            <category>TSN</category>
            <category>SDN</category>
            <category>TAS</category>
            <category>Reconfiguration</category>
        </item>
        <item>
            <title><![CDATA[Min-plus algebra: the language of network calculus]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra</guid>
            <pubDate>Wed, 30 Sep 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Cumulative functions, the min-plus dioid, convolution and deconvolution, with the properties used throughout the series.]]></description>
            <content:encoded><![CDATA[<p><a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">Network calculus</a> is often summarised as "queueing theory in the <a href="https://en.wikipedia.org/wiki/Min-plus_algebra" target="_blank" rel="noopener noreferrer" class="">min-plus algebra</a>". In conventional system theory, a linear time-invariant system is characterised by its impulse response and its output is a <em>convolution</em> in the <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mo>+</mo><mo separator="true">,</mo><mo>×</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(+,\times)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord">+</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">×</span><span class="mclose">)</span></span></span></span> algebra. Network calculus keeps the same structure but replaces addition by minimum and multiplication by addition. This post sets up that algebra.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-cumulative-functions">1. Cumulative functions<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#1-cumulative-functions" class="hash-link" aria-label="Direct link to 1. Cumulative functions" title="Direct link to 1. Cumulative functions" translate="no">​</a></h2>
<p>A flow crossing a system is described by two <strong>cumulative functions</strong>:</p>
<ul>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span>, the number of bits that have <em>entered</em> the system in <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">[</mo><mn>0</mn><mo separator="true">,</mo><mi>t</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">[0, t]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">[</span><span class="mord">0</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span><span class="mclose">]</span></span></span></span>;</li>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R^*(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span>, the number of bits that have <em>left</em> the system in <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">[</mo><mn>0</mn><mo separator="true">,</mo><mi>t</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">[0, t]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">[</span><span class="mord">0</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span><span class="mclose">]</span></span></span></span>.</li>
</ul>
<p>Both belong to the set <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="script">F</mi></mrow><annotation encoding="application/x-tex">\mathcal{F}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathcal" style="margin-right:0.0993em">F</span></span></span></span> of wide-sense increasing functions <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>:</mo><msub><mi mathvariant="double-struck">R</mi><mrow><mo>≥</mo><mn>0</mn></mrow></msub><mo>→</mo><msub><mi mathvariant="double-struck">R</mi><mrow><mo>≥</mo><mn>0</mn></mrow></msub><mo>∪</mo><mo stretchy="false">{</mo><mo>+</mo><mi mathvariant="normal">∞</mi><mo stretchy="false">}</mo></mrow><annotation encoding="application/x-tex">f : \mathbb{R}_{\ge 0} \to \mathbb{R}_{\ge 0} \cup \{+\infty\}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">:</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9341em;vertical-align:-0.2452em"></span><span class="mord"><span class="mord mathbb">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2452em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">→</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9341em;vertical-align:-0.2452em"></span><span class="mord"><span class="mord mathbb">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2452em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">∪</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">{</span><span class="mord">+</span><span class="mord">∞</span><span class="mclose">}</span></span></span></span> with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">f(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span> (for cumulative functions). Causality and lossless operation give <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo>≤</mo><mi>R</mi></mrow><annotation encoding="application/x-tex">R^* \le R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8247em;vertical-align:-0.136em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>.</p>
<p>Two performance quantities are read directly from these curves:</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>b</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mspace width="2em"></mspace><mtext>(backlog&nbsp;at&nbsp;time&nbsp;</mtext><mi>t</mi><mtext>)</mtext></mrow><annotation encoding="application/x-tex">b(t) = R(t) - R^*(t) \qquad \text{(backlog at time } t\text{)}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">b</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:2em"></span><span class="mord text"><span class="mord">(backlog&nbsp;at&nbsp;time&nbsp;</span></span><span class="mord mathnormal">t</span><span class="mord text"><span class="mord">)</span></span></span></span></span></span>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>d</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>inf</mi><mo>⁡</mo><mo stretchy="false">{</mo><mtext> </mtext><mi>τ</mi><mo>≥</mo><mn>0</mn><mo>:</mo><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≤</mo><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo>+</mo><mi>τ</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mspace width="2em"></mspace><mtext>(virtual&nbsp;delay&nbsp;at&nbsp;time&nbsp;</mtext><mi>t</mi><mtext>)</mtext></mrow><annotation encoding="application/x-tex">d(t) = \inf \{\, \tau \ge 0 : R(t) \le R^*(t + \tau) \,\} \qquad \text{(virtual delay at time } t\text{)}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">d</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">in<span style="margin-right:0.0778em">f</span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.1132em">τ</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">:</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1132em">τ</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mspace" style="margin-right:2em"></span><span class="mord text"><span class="mord">(virtual&nbsp;delay&nbsp;at&nbsp;time&nbsp;</span></span><span class="mord mathnormal">t</span><span class="mord text"><span class="mord">)</span></span></span></span></span></span>
<p>The backlog is the <em>vertical</em> distance between the two curves, the virtual delay their <em>horizontal</em> distance. For a FIFO system, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>d</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">d(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">d</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span> is the delay experienced by the last bit that arrived at time <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-the-min-plus-dioid">2. The min-plus dioid<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#2-the-min-plus-dioid" class="hash-link" aria-label="Direct link to 2. The min-plus dioid" title="Direct link to 2. The min-plus dioid" translate="no">​</a></h2>
<p>The structure <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mi mathvariant="double-struck">R</mi><mo>∪</mo><mo stretchy="false">{</mo><mo>+</mo><mi mathvariant="normal">∞</mi><mo stretchy="false">}</mo><mo separator="true">,</mo><mi>min</mi><mo>⁡</mo><mo separator="true">,</mo><mo>+</mo><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(\mathbb{R} \cup \{+\infty\}, \min, +)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathbb">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">∪</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">{</span><span class="mord">+</span><span class="mord">∞</span><span class="mclose">}</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mop">min</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">+</span><span class="mclose">)</span></span></span></span> is a <em>dioid</em>: <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo></mrow><annotation encoding="application/x-tex">\min</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6679em"></span><span class="mop">min</span></span></span></span> plays the role of addition (neutral element <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>+</mo><mi mathvariant="normal">∞</mi></mrow><annotation encoding="application/x-tex">+\infty</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span><span class="mord">∞</span></span></span></span>) and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>+</mo></mrow><annotation encoding="application/x-tex">+</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span></span></span></span> the role of multiplication (neutral element <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span>). Two properties differ from ordinary arithmetic and are the source of many results:</p>
<ul>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo></mrow><annotation encoding="application/x-tex">\min</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6679em"></span><span class="mop">min</span></span></span></span> is <strong>idempotent</strong>: <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>a</mi><mo separator="true">,</mo><mi>a</mi><mo stretchy="false">)</mo><mo>=</mo><mi>a</mi></mrow><annotation encoding="application/x-tex">\min(a, a) = a</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord mathnormal">a</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">a</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">a</span></span></span></span>;</li>
<li class="">there is no inverse for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo></mrow><annotation encoding="application/x-tex">\min</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6679em"></span><span class="mop">min</span></span></span></span>, so equations are solved by <em>inequalities</em> and <em>closures</em> rather than by subtraction.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-min-plus-convolution">3. Min-plus convolution<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#3-min-plus-convolution" class="hash-link" aria-label="Direct link to 3. Min-plus convolution" title="Direct link to 3. Min-plus convolution" translate="no">​</a></h2>
<p>For <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo separator="true">,</mo><mi>g</mi><mo>∈</mo><mi mathvariant="script">F</mi></mrow><annotation encoding="application/x-tex">f, g \in \mathcal{F}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">∈</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathcal" style="margin-right:0.0993em">F</span></span></span></span>, the <strong>min-plus convolution</strong> is</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo stretchy="false">(</mo><mi>f</mi><mo>⊗</mo><mi>g</mi><mo stretchy="false">)</mo><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><munder><mrow><mi>inf</mi><mo>⁡</mo></mrow><mrow><mn>0</mn><mo>≤</mo><mi>s</mi><mo>≤</mo><mi>t</mi></mrow></munder><mo stretchy="false">{</mo><mtext> </mtext><mi>f</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mo>+</mo><mi>g</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">(f \otimes g)(t) = \inf_{0 \le s \le t} \{\, f(t - s) + g(s) \,\}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">)</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.5623em;vertical-align:-0.8123em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.6944em"><span style="top:-2.3829em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">0</span><span class="mrel mtight">≤</span><span class="mord mathnormal mtight">s</span><span class="mrel mtight">≤</span><span class="mord mathnormal mtight">t</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">in<span style="margin-right:0.0778em">f</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.8123em"><span></span></span></span></span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mord">.</span></span></span></span></span>
<p>Interpretation: to obtain the value at <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span>, split the interval <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">[</mo><mn>0</mn><mo separator="true">,</mo><mi>t</mi><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">[0, t]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">[</span><span class="mord">0</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span><span class="mclose">]</span></span></span></span> into two parts and take the cheapest split. The operation has the following properties, all of which are used later.</p>
<table><thead><tr><th>Property</th><th>Statement</th></tr></thead><tbody><tr><td>Closure</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi><mo>∈</mo><mi mathvariant="script">F</mi></mrow><annotation encoding="application/x-tex">f \otimes g \in \mathcal{F}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.7335em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">∈</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathcal" style="margin-right:0.0993em">F</span></span></span></span></td></tr><tr><td>Associativity</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mi>f</mi><mo>⊗</mo><mi>g</mi><mo stretchy="false">)</mo><mo>⊗</mo><mi>h</mi><mo>=</mo><mi>f</mi><mo>⊗</mo><mo stretchy="false">(</mo><mi>g</mi><mo>⊗</mo><mi>h</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(f \otimes g) \otimes h = f \otimes (g \otimes h)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">h</span><span class="mclose">)</span></span></span></span></td></tr><tr><td>Commutativity</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi><mo>=</mo><mi>g</mi><mo>⊗</mo><mi>f</mi></mrow><annotation encoding="application/x-tex">f \otimes g = g \otimes f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span></td></tr><tr><td>Distributivity over <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo></mrow><annotation encoding="application/x-tex">\min</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6679em"></span><span class="mop">min</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>f</mi><mo separator="true">,</mo><mi>g</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mo>⊗</mo><mi>h</mi><mo>=</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>f</mi><mo>⊗</mo><mi>h</mi><mo separator="true">,</mo><mtext> </mtext><mi>g</mi><mo>⊗</mo><mi>h</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(\min(f, g)) \otimes h = \min(f \otimes h,\, g \otimes h)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mop">min</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">))</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal">h</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">h</span><span class="mclose">)</span></span></span></span></td></tr><tr><td>Neutral element</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><msub><mi>δ</mi><mn>0</mn></msub><mo>=</mo><mi>f</mi></mrow><annotation encoding="application/x-tex">f \otimes \delta_0 = f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span>, where <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>δ</mi><mn>0</mn></msub><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">\delta_0(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>δ</mi><mn>0</mn></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mo>+</mo><mi mathvariant="normal">∞</mi></mrow><annotation encoding="application/x-tex">\delta_0(t) = +\infty</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span><span class="mord">∞</span></span></span></span> for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi><mo>&gt;</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">t &gt; 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6542em;vertical-align:-0.0391em"></span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">&gt;</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span></td></tr><tr><td>Isotonicity</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>≤</mo><msup><mi>f</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup></mrow><annotation encoding="application/x-tex">f \le f'</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9463em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7519em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">′</span></span></span></span></span></span></span></span></span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>g</mi><mo>≤</mo><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup></mrow><annotation encoding="application/x-tex">g \le g'</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8304em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9463em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7519em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">′</span></span></span></span></span></span></span></span></span></span></span></span> imply <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi><mo>≤</mo><msup><mi>f</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>⊗</mo><msup><mi>g</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup></mrow><annotation encoding="application/x-tex">f \otimes g \le f' \otimes g'</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8304em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9463em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7519em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">′</span></span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.9463em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7519em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">′</span></span></span></span></span></span></span></span></span></span></span></span></td></tr><tr><td>Upper bound</td><td>if <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mi>g</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">f(0) = g(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span> then <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi><mo>≤</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>f</mi><mo separator="true">,</mo><mi>g</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">f \otimes g \le \min(f, g)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8304em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">)</span></span></span></span></td></tr></tbody></table>
<p>Two closed forms cover most practical computations:</p>
<ul>
<li class=""><strong>Concave functions.</strong> If <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi></mrow><annotation encoding="application/x-tex">f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>g</mi></mrow><annotation encoding="application/x-tex">g</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span></span></span></span> are concave with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mi>g</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">f(0) = g(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span>, then <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi><mo>=</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>f</mi><mo separator="true">,</mo><mi>g</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">f \otimes g = \min(f, g)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">)</span></span></span></span>.</li>
<li class=""><strong>Convex piecewise-linear functions.</strong> If <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi></mrow><annotation encoding="application/x-tex">f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>g</mi></mrow><annotation encoding="application/x-tex">g</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span></span></span></span> are convex and piecewise linear, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>⊗</mo><mi>g</mi></mrow><annotation encoding="application/x-tex">f \otimes g</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span></span></span></span> is obtained by concatenating their linear segments in order of increasing slope.</li>
</ul>
<p>The second rule gives the most frequently used identity of the theory: for rate-latency functions <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mrow><mi>R</mi><mo separator="true">,</mo><mi>T</mi></mrow></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>R</mi><mtext> </mtext><mo stretchy="false">[</mo><mi>t</mi><mo>−</mo><mi>T</mi><msup><mo stretchy="false">]</mo><mo>+</mo></msup></mrow><annotation encoding="application/x-tex">\beta_{R,T}(t) = R\,[t - T]^+</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.0361em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mopen">[</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.0213em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mclose"><span class="mclose">]</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7713em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span></span></span></span>,</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>β</mi><mrow><msub><mi>R</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>T</mi><mn>1</mn></msub></mrow></msub><mo>⊗</mo><msub><mi>β</mi><mrow><msub><mi>R</mi><mn>2</mn></msub><mo separator="true">,</mo><msub><mi>T</mi><mn>2</mn></msub></mrow></msub><mo>=</mo><msub><mi>β</mi><mrow><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><msub><mi>R</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>R</mi><mn>2</mn></msub><mo stretchy="false">)</mo><mo separator="true">,</mo><mtext> </mtext><msub><mi>T</mi><mn>1</mn></msub><mo>+</mo><msub><mi>T</mi><mn>2</mn></msub></mrow></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta_{R_1,T_1} \otimes \beta_{R_2,T_2} = \beta_{\min(R_1,R_2),\, T_1 + T_2}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.0496em;vertical-align:-0.3552em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.5198em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mop mtight"><span class="mtight">m</span><span class="mtight">i</span><span class="mtight">n</span></span><span class="mopen mtight">(</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mclose mtight">)</span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mbin mtight">+</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3552em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-min-plus-deconvolution">4. Min-plus deconvolution<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#4-min-plus-deconvolution" class="hash-link" aria-label="Direct link to 4. Min-plus deconvolution" title="Direct link to 4. Min-plus deconvolution" translate="no">​</a></h2>
<p>The dual operation is the <strong>min-plus deconvolution</strong></p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo stretchy="false">(</mo><mi>f</mi><mo>⊘</mo><mi>g</mi><mo stretchy="false">)</mo><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><munder><mrow><mi>sup</mi><mo>⁡</mo></mrow><mrow><mi>u</mi><mo>≥</mo><mn>0</mn></mrow></munder><mo stretchy="false">{</mo><mtext> </mtext><mi>f</mi><mo stretchy="false">(</mo><mi>t</mi><mo>+</mo><mi>u</mi><mo stretchy="false">)</mo><mo>−</mo><mi>g</mi><mo stretchy="false">(</mo><mi>u</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">(f \oslash g)(t) = \sup_{u \ge 0} \{\, f(t + u) - g(u) \,\}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊘</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mclose">)</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.7567em;vertical-align:-1.0067em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.4306em"><span style="top:-2.1885em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">u</span><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">sup</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.0067em"><span></span></span></span></span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">u</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mopen">(</span><span class="mord mathnormal">u</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mord">.</span></span></span></span></span>
<p>It is not the inverse of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>⊗</mo></mrow><annotation encoding="application/x-tex">\otimes</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">⊗</span></span></span></span>, but it satisfies the <em>duality</em> (residuation) property</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>f</mi><mo>⊘</mo><mi>g</mi><mo>≤</mo><mi>h</mi><mtext>  </mtext><mo>⟺</mo><mtext>  </mtext><mi>f</mi><mo>≤</mo><mi>h</mi><mo>⊗</mo><mi>g</mi><mo separator="true">,</mo></mrow><annotation encoding="application/x-tex">f \oslash g \le h \iff f \le h \otimes g,</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊘</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8304em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7184em;vertical-align:-0.024em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">⟺</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="mpunct">,</span></span></span></span></span>
<p>which is the min-plus analogue of solving <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>≤</mo><mi>h</mi><mo>×</mo><mi>g</mi></mrow><annotation encoding="application/x-tex">f \le h \times g</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">g</span></span></span></span> for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi></mrow><annotation encoding="application/x-tex">h</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span></span></span></span>. Deconvolution is used in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">the fundamental bounds post</a> to compute the arrival curve of a flow <em>after</em> it has crossed a server.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-sub-additive-closure">5. Sub-additive closure<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#5-sub-additive-closure" class="hash-link" aria-label="Direct link to 5. Sub-additive closure" title="Direct link to 5. Sub-additive closure" translate="no">​</a></h2>
<p>A function <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi></mrow><annotation encoding="application/x-tex">f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span> is <strong>sub-additive</strong> if <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo stretchy="false">(</mo><mi>s</mi><mo>+</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>f</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>+</mo><mi>f</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">f(s + t) \le f(s) + f(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span> for all <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi><mo separator="true">,</mo><mi>t</mi></mrow><annotation encoding="application/x-tex">s, t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8095em;vertical-align:-0.1944em"></span><span class="mord mathnormal">s</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span></span></span></span>. The sub-additive closure of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi></mrow><annotation encoding="application/x-tex">f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span> is</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mover accent="true"><mi>f</mi><mo stretchy="true">‾</mo></mover><mo>=</mo><munder><mrow><mi>inf</mi><mo>⁡</mo></mrow><mrow><mi>n</mi><mo>≥</mo><mn>0</mn></mrow></munder><msup><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo></mrow></msup><mo separator="true">,</mo><mspace width="2em"></mspace><msup><mi>f</mi><mrow><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo></mrow></msup><mo>=</mo><msub><mi>δ</mi><mn>0</mn></msub><mo separator="true">,</mo><mtext>  </mtext><msup><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo></mrow></msup><mo>=</mo><mi>f</mi><mo>⊗</mo><msup><mi>f</mi><mrow><mo stretchy="false">(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo stretchy="false">)</mo></mrow></msup><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\overline{f} = \inf_{n \ge 0} f^{(n)}, \qquad f^{(0)} = \delta_0,\; f^{(n)} = f \otimes f^{(n-1)}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.0889em;vertical-align:-0.1944em"></span><span class="mord overline"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.8944em"><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span><span style="top:-3.8144em"><span class="pstrut" style="height:3em"></span><span class="overline-line" style="border-bottom-width:0.04em"></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.1944em"><span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.7503em;vertical-align:-0.8123em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.6944em"><span style="top:-2.3829em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">n</span><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">in<span style="margin-right:0.0778em">f</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.8123em"><span></span></span></span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.938em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">(</span><span class="mord mathnormal mtight">n</span><span class="mclose mtight">)</span></span></span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.938em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">(</span><span class="mord mtight">0</span><span class="mclose mtight">)</span></span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.1324em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.938em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">(</span><span class="mord mathnormal mtight">n</span><span class="mclose mtight">)</span></span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.1324em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1076em">f</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.938em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">(</span><span class="mord mathnormal mtight">n</span><span class="mbin mtight">−</span><span class="mord mtight">1</span><span class="mclose mtight">)</span></span></span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>It is the largest sub-additive function below <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi></mrow><annotation encoding="application/x-tex">f</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.1076em">f</span></span></span></span> (and below <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>δ</mi><mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\delta_0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>). Sub-additive closures appear naturally in the study of arrival curves: any arrival curve can be replaced by its sub-additive closure without loss of information, as shown in the next post.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-summary">6. Summary<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#6-summary" class="hash-link" aria-label="Direct link to 6. Summary" title="Direct link to 6. Summary" translate="no">​</a></h2>
<table><thead><tr><th>Object</th><th>Conventional systems</th><th>Network calculus</th></tr></thead><tbody><tr><td>Signal</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>x</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">x(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">x</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span></td><td>Cumulative function <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R(t)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span></span></span></span></td></tr><tr><td>"Addition"</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>+</mo></mrow><annotation encoding="application/x-tex">+</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>min</mi><mo>⁡</mo></mrow><annotation encoding="application/x-tex">\min</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6679em"></span><span class="mop">min</span></span></span></span></td></tr><tr><td>"Multiplication"</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>×</mo></mrow><annotation encoding="application/x-tex">\times</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">×</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>+</mo></mrow><annotation encoding="application/x-tex">+</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span></span></span></span></td></tr><tr><td>System law</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>y</mi><mo>=</mo><mi>h</mi><mo>∗</mo><mi>x</mi></mrow><annotation encoding="application/x-tex">y = h * x</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0359em">y</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">∗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">x</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo>≥</mo><mi>R</mi><mo>⊗</mo><mi>β</mi></mrow><annotation encoding="application/x-tex">R^* \ge R \otimes \beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8247em;vertical-align:-0.136em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span></td></tr><tr><td>Impulse</td><td>Dirac <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>δ</mi></mrow><annotation encoding="application/x-tex">\delta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0379em">δ</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>δ</mi><mn>0</mn></msub></mrow><annotation encoding="application/x-tex">\delta_0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> (zero at 0, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>+</mo><mi mathvariant="normal">∞</mi></mrow><annotation encoding="application/x-tex">+\infty</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">+</span><span class="mord">∞</span></span></span></span> elsewhere)</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>An Introduction to Network Calculus</em>, LCA2, EPFL. <a href="https://www.youtube.com/watch?v=ABQ327BTc_o" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 3. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus</em>, Wiley-ISTE, 2018.</li>
<li class="">C.-S. Chang, <em>Performance Guarantees in Communication Networks</em>, Springer, 2000.</li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Book</category>
            <category>Foundations</category>
            <category>Network calculus</category>
        </item>
        <item>
            <title><![CDATA[Arrival curves: describing what a flow may send]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/arrival-curves</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/arrival-curves</guid>
            <pubDate>Thu, 01 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Definition of arrival curves, token buckets, staircase curves for periodic TSN streams, good arrival curves and greedy shapers.]]></description>
            <content:encoded><![CDATA[<p>An arrival curve is the traffic <em>contract</em> of a flow: an upper bound on how much data the flow may send in any time window. It is the first of the two envelopes on which <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> is built.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>A wide-sense increasing function <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span> is an <strong>arrival curve</strong> for a flow with cumulative function <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span> if</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><mi>R</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>α</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mspace width="2em"></mspace><mtext>for&nbsp;all&nbsp;</mtext><mn>0</mn><mo>≤</mo><mi>s</mi><mo>≤</mo><mi>t</mi><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">R(t) - R(s) \le \alpha(t - s) \qquad \text{for all } 0 \le s \le t.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:2em"></span><span class="mord text"><span class="mord">for&nbsp;all&nbsp;</span></span><span class="mord">0</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span><span class="mord">.</span></span></span></span></span>
<p>Equivalently, in min-plus notation,</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>R</mi><mo>≤</mo><mi>R</mi><mo>⊗</mo><mi>α</mi><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">R \le R \otimes \alpha.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8193em;vertical-align:-0.136em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mord">.</span></span></span></span></span>
<p>The definition constrains <em>every</em> interval, not only intervals starting at time zero. It therefore bounds both the long-term rate and the short-term burstiness of the flow.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-standard-families">2. Standard families<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#2-standard-families" class="hash-link" aria-label="Direct link to 2. Standard families" title="Direct link to 2. Standard families" translate="no">​</a></h2>
<p><strong><a href="https://en.wikipedia.org/wiki/Token_bucket" target="_blank" rel="noopener noreferrer" class="">Token bucket</a> (<a href="https://en.wikipedia.org/wiki/Leaky_bucket" target="_blank" rel="noopener noreferrer" class="">leaky bucket</a>).</strong> The affine function</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mi>b</mi></mrow></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mrow><mo fence="true">{</mo><mtable rowspacing="0.36em" columnalign="left left" columnspacing="1em"><mtr><mtd><mstyle scriptlevel="0" displaystyle="false"><mn>0</mn></mstyle></mtd><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mi>t</mi><mo>=</mo><mn>0</mn></mrow></mstyle></mtd></mtr><mtr><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mi>b</mi><mo>+</mo><mi>r</mi><mtext> </mtext><mi>t</mi></mrow></mstyle></mtd><mtd><mstyle scriptlevel="0" displaystyle="false"><mrow><mi>t</mi><mo>&gt;</mo><mn>0</mn></mrow></mstyle></mtd></mtr></mtable></mrow></mrow><annotation encoding="application/x-tex">\gamma_{r,b}(t) = \begin{cases} 0 &amp; t = 0 \\ b + r\,t &amp; t &gt; 0 \end{cases}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.0361em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight">b</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:3em;vertical-align:-1.25em"></span><span class="minner"><span class="mopen delimcenter" style="top:0em"><span class="delimsizing size4">{</span></span><span class="mord"><span class="mtable"><span class="col-align-l"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.69em"><span style="top:-3.69em"><span class="pstrut" style="height:3.008em"></span><span class="mord"><span class="mord">0</span></span></span><span style="top:-2.25em"><span class="pstrut" style="height:3.008em"></span><span class="mord"><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.19em"><span></span></span></span></span></span><span class="arraycolsep" style="width:1em"></span><span class="col-align-l"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.69em"><span style="top:-3.69em"><span class="pstrut" style="height:3.008em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mord">0</span></span></span><span style="top:-2.25em"><span class="pstrut" style="height:3.008em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">&gt;</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mord">0</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.19em"><span></span></span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span></span></span></span></span>
<p>states that the flow never sends more than <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span></span></span></span> bits instantaneously (the <em>burst</em>) and has a long-term rate at most <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi></mrow><annotation encoding="application/x-tex">r</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span></span></span></span>. A token bucket with rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi></mrow><annotation encoding="application/x-tex">r</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span></span></span></span> and depth <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span></span></span></span> is the classical device that enforces it, and <a href="https://1.ieee802.org/tsn/802-1qci/" target="_blank" rel="noopener noreferrer" class="">802.1Qci</a> policers in <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> implement this kind of contract.</p>
<p><strong>Peak rate.</strong> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>λ</mi><mi>C</mi></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>C</mi><mtext> </mtext><mi>t</mi></mrow><annotation encoding="application/x-tex">\lambda_C(t) = C\,t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal">λ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span></span></span></span> constrains a flow that cannot exceed the line rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span>. Combining it with a token bucket gives <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo>=</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><msub><mi>λ</mi><mi>C</mi></msub><mo separator="true">,</mo><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mi>b</mi></mrow></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\alpha = \min(\lambda_C, \gamma_{r,b})</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.0361em;vertical-align:-0.2861em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal">λ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight">b</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>, which is concave.</p>
<p><strong>Staircase.</strong> A strictly periodic stream with period <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>P</mi></mrow><annotation encoding="application/x-tex">P</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">P</span></span></span></span> and maximum frame size <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>L</mi></mrow><annotation encoding="application/x-tex">L</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal">L</span></span></span></span>, as typical of time-triggered TSN traffic, admits</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>α</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>L</mi><mrow><mo fence="true">⌈</mo><mfrac><mi>t</mi><mi>P</mi></mfrac><mo fence="true">⌉</mo></mrow><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\alpha(t) = L \left\lceil \frac{t}{P} \right\rceil.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.4em;vertical-align:-0.95em"></span><span class="mord mathnormal">L</span><span class="mspace" style="margin-right:0.1667em"></span><span class="minner"><span class="mopen delimcenter" style="top:0em"><span class="delimsizing size3">⌈</span></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.2921em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">P</span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">t</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.686em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mclose delimcenter" style="top:0em"><span class="delimsizing size3">⌉</span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">.</span></span></span></span></span>
<p>If the release instants may deviate by up to a <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">jitter</a> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>J</mi></mrow><annotation encoding="application/x-tex">J</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0962em">J</span></span></span></span>, the curve becomes <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>L</mi><mo stretchy="false">⌈</mo><mo stretchy="false">(</mo><mi>t</mi><mo>+</mo><mi>J</mi><mo stretchy="false">)</mo><mi mathvariant="normal">/</mi><mi>P</mi><mo stretchy="false">⌉</mo></mrow><annotation encoding="application/x-tex">L \lceil (t + J)/P \rceil</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">L</span><span class="mopen">⌈(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0962em">J</span><span class="mclose">)</span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.1389em">P</span><span class="mclose">⌉</span></span></span></span>. A staircase is upper-bounded by the token bucket <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>γ</mi><mrow><mi>L</mi><mi mathvariant="normal">/</mi><mi>P</mi><mo separator="true">,</mo><mtext> </mtext><mi>L</mi></mrow></msub></mrow><annotation encoding="application/x-tex">\gamma_{L/P,\,L}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7858em;vertical-align:-0.3552em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.5198em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">L</span><span class="mord mtight">/</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">P</span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mathnormal mtight">L</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3552em"><span></span></span></span></span></span></span></span></span></span> (or <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>γ</mi><mrow><mi>L</mi><mi mathvariant="normal">/</mi><mi>P</mi><mo separator="true">,</mo><mtext> </mtext><mi>L</mi><mo stretchy="false">(</mo><mn>1</mn><mo>+</mo><mi>J</mi><mi mathvariant="normal">/</mi><mi>P</mi><mo stretchy="false">)</mo></mrow></msub></mrow><annotation encoding="application/x-tex">\gamma_{L/P,\,L(1 + J/P)}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7858em;vertical-align:-0.3552em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.5198em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">L</span><span class="mord mtight">/</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">P</span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mathnormal mtight">L</span><span class="mopen mtight">(</span><span class="mord mtight">1</span><span class="mbin mtight">+</span><span class="mord mathnormal mtight" style="margin-right:0.0962em">J</span><span class="mord mtight">/</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">P</span><span class="mclose mtight">)</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3552em"><span></span></span></span></span></span></span></span></span></span> with jitter); analyses frequently use the token bucket because it keeps closed forms simple, at the cost of some pessimism.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-good-arrival-curves">3. Good arrival curves<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#3-good-arrival-curves" class="hash-link" aria-label="Direct link to 3. Good arrival curves" title="Direct link to 3. Good arrival curves" translate="no">​</a></h2>
<p>Not every arrival curve is informative. If <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span> is an arrival curve for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>, then its sub-additive closure <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mi>α</mi><mo stretchy="true">‾</mo></mover></mrow><annotation encoding="application/x-tex">\overline{\alpha}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6306em"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6306em"><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span><span style="top:-3.5506em"><span class="pstrut" style="height:3em"></span><span class="overline-line" style="border-bottom-width:0.04em"></span></span></span></span></span></span></span></span></span> is also one. Moreover, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mover accent="true"><mi>α</mi><mo stretchy="true">‾</mo></mover><mo>≤</mo><mi>α</mi></mrow><annotation encoding="application/x-tex">\overline{\alpha} \le \alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord overline"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6306em"><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span><span style="top:-3.5506em"><span class="pstrut" style="height:3em"></span><span class="overline-line" style="border-bottom-width:0.04em"></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span>, so no information is lost. One may therefore restrict attention to <strong>good</strong> arrival curves, i.e. sub-additive functions with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">\alpha(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span>. All concave functions with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo stretchy="false">(</mo><mn>0</mn><mo stretchy="false">)</mo><mo>=</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">\alpha(0) = 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord">0</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span>, in particular token buckets, are good.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-greedy-shapers">4. Greedy shapers<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#4-greedy-shapers" class="hash-link" aria-label="Direct link to 4. Greedy shapers" title="Direct link to 4. Greedy shapers" translate="no">​</a></h2>
<p>A <strong>greedy shaper</strong> with shaping curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>σ</mi></mrow><annotation encoding="application/x-tex">\sigma</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span></span></span></span> (assumed good) delays bits as little as necessary so that its output has arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>σ</mi></mrow><annotation encoding="application/x-tex">\sigma</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span></span></span></span>. Its output is</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo>=</mo><mi>R</mi><mo>⊗</mo><mi>σ</mi><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">R^* = R \otimes \sigma.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7387em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span><span class="mord">.</span></span></span></span></span>
<p>Two properties make shapers attractive in network design:</p>
<ol>
<li class=""><strong>Shapers preserve arrival curves.</strong> If the input has arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span>, the output has arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo>⊗</mo><mi>σ</mi></mrow><annotation encoding="application/x-tex">\alpha \otimes \sigma</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span></span></span></span>, and in particular still satisfies <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span>.</li>
<li class=""><strong>Re-shaping is for free.</strong> If a flow is already constrained by <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>σ</mi></mrow><annotation encoding="application/x-tex">\sigma</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span></span></span></span> at the entrance of a network, inserting a greedy shaper with the same curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>σ</mi></mrow><annotation encoding="application/x-tex">\sigma</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">σ</span></span></span></span> after any sub-network does not increase the end-to-end delay <em>bound</em>. The shaper removes the burstiness accumulated inside the network without costing anything in the worst case.</li>
</ol>
<p>The second property is the theoretical basis of the Asynchronous Traffic Shaper (<a href="https://1.ieee802.org/tsn/802-1qcr/" target="_blank" rel="noopener noreferrer" class="">802.1Qcr</a>), whose <em>interleaved</em> regulators extend it to aggregates of flows (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn">the TSN shapers post</a>).</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-worked-example">5. Worked example<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#5-worked-example" class="hash-link" aria-label="Direct link to 5. Worked example" title="Direct link to 5. Worked example" translate="no">​</a></h2>
<p>Consider a control stream that emits one 1500-byte frame (<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>L</mi><mo>=</mo><mn>12</mn><mtext> </mtext><mn>000</mn></mrow><annotation encoding="application/x-tex">L = 12\,000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal">L</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span></span></span></span> bits) every <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>P</mi><mo>=</mo><mn>1</mn></mrow><annotation encoding="application/x-tex">P = 1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">P</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">1</span></span></span></span> ms. Its staircase arrival curve is <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>12</mn><mtext> </mtext><mn>000</mn><mo stretchy="false">⌈</mo><mi>t</mi><mi mathvariant="normal">/</mi><msup><mn>10</mn><mrow><mo>−</mo><mn>3</mn></mrow></msup><mo stretchy="false">⌉</mo></mrow><annotation encoding="application/x-tex">12\,000 \lceil t / 10^{-3} \rceil</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.0641em;vertical-align:-0.25em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span><span class="mopen">⌈</span><span class="mord mathnormal">t</span><span class="mord">/1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">3</span></span></span></span></span></span></span></span></span><span class="mclose">⌉</span></span></span></span> bits, upper-bounded by the token bucket</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mi>b</mi></mrow></msub><mspace width="1em"></mspace><mtext>with</mtext><mspace width="1em"></mspace><mi>r</mi><mo>=</mo><mfrac><mrow><mn>12</mn><mtext> </mtext><mn>000</mn></mrow><msup><mn>10</mn><mrow><mo>−</mo><mn>3</mn></mrow></msup></mfrac><mo>=</mo><mn>12</mn><mtext>&nbsp;Mbit/s</mtext><mo separator="true">,</mo><mspace width="2em"></mspace><mi>b</mi><mo>=</mo><mn>12</mn><mtext> </mtext><mn>000</mn><mtext>&nbsp;bits</mtext><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\gamma_{r,b} \quad\text{with}\quad r = \frac{12\,000}{10^{-3}} = 12 \text{ Mbit/s}, \qquad b = 12\,000 \text{ bits}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight">b</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:1em"></span><span class="mord text"><span class="mord">with</span></span><span class="mspace" style="margin-right:1em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.0074em;vertical-align:-0.686em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3214em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7401em"><span style="top:-2.989em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">3</span></span></span></span></span></span></span></span></span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.686em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord">12</span><span class="mord text"><span class="mord">&nbsp;Mbit/s</span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span><span class="mord text"><span class="mord">&nbsp;bits</span></span><span class="mord">.</span></span></span></span></span>
<p>This pair <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mi>b</mi><mo separator="true">,</mo><mi>r</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(b, r)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal">b</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mclose">)</span></span></span></span> is the input of every bound derived in the rest of the series.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>An Introduction to Network Calculus</em>, LCA2, EPFL. <a href="https://www.youtube.com/watch?v=ABQ327BTc_o" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
<li class=""><em>Network Calculus: Guaranteed performance analysis in networks</em>, LINCS seminar. <a href="https://www.youtube.com/watch?v=1funUBUL2II" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 1. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">R. L. Cruz, "A calculus for network delay, Part I: Network elements in isolation," <em>IEEE Transactions on Information Theory</em>, 37(1), 1991.</li>
<li class="">J.-Y. Le Boudec, "A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators," <em>IEEE/ACM Transactions on Networking</em>, 26(6), 2018.</li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Article</category>
            <category>Book</category>
            <category>Foundations</category>
            <category>Network calculus</category>
        </item>
        <item>
            <title><![CDATA[Service curves: describing what a server guarantees]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/service-curves</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/service-curves</guid>
            <pubDate>Fri, 02 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Min-plus and strict service curves, rate-latency servers, and the service offered by a Time-Aware Shaper window.]]></description>
            <content:encoded><![CDATA[<p>The arrival curve bounds the demand; the <strong>service curve</strong> bounds the supply. It abstracts a scheduler, a link or a whole <a href="https://en.wikipedia.org/wiki/Network_switch" target="_blank" rel="noopener noreferrer" class="">switch</a> into a single function that lower-bounds the service it delivers.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-min-plus-service-curve">1. Min-plus service curve<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#1-min-plus-service-curve" class="hash-link" aria-label="Direct link to 1. Min-plus service curve" title="Direct link to 1. Min-plus service curve" translate="no">​</a></h2>
<p>A system with input <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span> and output <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup></mrow><annotation encoding="application/x-tex">R^*</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6887em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span></span></span></span> offers a (min-plus) <strong>service curve</strong> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> if</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo>≥</mo><mi>R</mi><mo>⊗</mo><mi>β</mi><mo separator="true">,</mo><mspace width="2em"></mspace><mtext>i.e.</mtext><mspace width="2em"></mspace><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≥</mo><munder><mrow><mi>inf</mi><mo>⁡</mo></mrow><mrow><mn>0</mn><mo>≤</mo><mi>s</mi><mo>≤</mo><mi>t</mi></mrow></munder><mo stretchy="false">{</mo><mtext> </mtext><mi>R</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>+</mo><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">R^* \ge R \otimes \beta, \qquad \text{i.e.} \qquad R^*(t) \ge \inf_{0 \le s \le t} \{\, R(s) + \beta(t - s) \,\}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8747em;vertical-align:-0.136em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord text"><span class="mord">i.e.</span></span><span class="mspace" style="margin-right:2em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.5623em;vertical-align:-0.8123em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.6944em"><span style="top:-2.3829em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">0</span><span class="mrel mtight">≤</span><span class="mord mathnormal mtight">s</span><span class="mrel mtight">≤</span><span class="mord mathnormal mtight">t</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">in<span style="margin-right:0.0778em">f</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.8123em"><span></span></span></span></span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mord">.</span></span></span></span></span>
<p>Read operationally: for every <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span> there is some instant <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi><mo>≤</mo><mi>t</mi></mrow><annotation encoding="application/x-tex">s \le t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span> such that the system has delivered at least <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\beta(t - s)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span></span></span></span> bits since <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi></mrow><annotation encoding="application/x-tex">s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">s</span></span></span></span> on top of everything that arrived before <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi></mrow><annotation encoding="application/x-tex">s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">s</span></span></span></span>. The definition mirrors the impulse response of linear systems: an ideal pipe with <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span> has service curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>δ</mi><mi>T</mi></msub></mrow><annotation encoding="application/x-tex">\delta_T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0379em">δ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0379em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>, a constant-rate link of rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span> has <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>λ</mi><mi>C</mi></msub></mrow><annotation encoding="application/x-tex">\lambda_C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal">λ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-strict-service-curve">2. Strict service curve<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#2-strict-service-curve" class="hash-link" aria-label="Direct link to 2. Strict service curve" title="Direct link to 2. Strict service curve" translate="no">​</a></h2>
<p>A system offers a <strong>strict service curve</strong> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> if, during any <em>backlogged period</em> of duration <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>u</mi></mrow><annotation encoding="application/x-tex">u</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">u</span></span></span></span> (an interval in which the system is never empty), the output is at least <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi><mo stretchy="false">(</mo><mi>u</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">\beta(u)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">u</span><span class="mclose">)</span></span></span></span>.</p>
<p>Every strict service curve is a min-plus service curve; the converse is false. The distinction matters because several results, in particular blind multiplexing in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">the multiplexing post</a>, require the strict version. Schedulers that serve as soon as they are backlogged, possibly after a bounded interruption, are naturally described by strict service curves.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-rate-latency-servers">3. Rate-latency servers<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#3-rate-latency-servers" class="hash-link" aria-label="Direct link to 3. Rate-latency servers" title="Direct link to 3. Rate-latency servers" translate="no">​</a></h2>
<p>The workhorse of the theory is the <strong>rate-latency</strong> function</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>β</mi><mrow><mi>R</mi><mo separator="true">,</mo><mi>T</mi></mrow></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mi>R</mi><mtext> </mtext><mo stretchy="false">[</mo><mi>t</mi><mo>−</mo><mi>T</mi><msup><mo stretchy="false">]</mo><mo>+</mo></msup><mo>=</mo><mi>max</mi><mo>⁡</mo><mo stretchy="false">(</mo><mn>0</mn><mo separator="true">,</mo><mtext> </mtext><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>T</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta_{R,T}(t) = R\,[t - T]^+ = \max(0,\, R(t - T)).</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.0361em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mopen">[</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.0713em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mclose"><span class="mclose">]</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8213em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">max</span><span class="mopen">(</span><span class="mord">0</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mclose">))</span><span class="mord">.</span></span></span></span></span>
<p>It models a server that, after a worst-case start-up latency <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span>, serves at rate at least <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>. Many real schedulers fall into this class, for example:</p>
<table><thead><tr><th>System</th><th>Rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span></th><th>Latency <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span></th></tr></thead><tbody><tr><td>Link of rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span> with processing delay <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>t</mi><mrow><mi>p</mi><mi>r</mi><mi>o</mi><mi>c</mi></mrow></msub></mrow><annotation encoding="application/x-tex">t_{proc}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9012em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">p</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mord mathnormal mtight">oc</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>t</mi><mrow><mi>p</mi><mi>r</mi><mi>o</mi><mi>c</mi></mrow></msub></mrow><annotation encoding="application/x-tex">t_{proc}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9012em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">p</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mord mathnormal mtight">oc</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span></td></tr><tr><td>Non-preemptive link, highest priority, max lower-priority frame <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub></mrow><annotation encoding="application/x-tex">L_{lo}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub><mi mathvariant="normal">/</mi><mi>C</mi></mrow><annotation encoding="application/x-tex">L_{lo}/C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span></td></tr><tr><td><a href="https://en.wikipedia.org/wiki/Generalized_processor_sharing" target="_blank" rel="noopener noreferrer" class="">Generalised Processor Sharing</a> with weight <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>ϕ</mi><mi>i</mi></msub></mrow><annotation encoding="application/x-tex">\phi_i</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal">ϕ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3117em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>ϕ</mi><mi>i</mi></msub><mi>C</mi><mi mathvariant="normal">/</mi><msub><mo>∑</mo><mi>j</mi></msub><msub><mi>ϕ</mi><mi>j</mi></msub></mrow><annotation encoding="application/x-tex">\phi_i C / \sum_j \phi_j</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.1858em;vertical-align:-0.4358em"></span><span class="mord"><span class="mord mathnormal">ϕ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3117em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord">/</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mop"><span class="mop op-symbol small-op" style="position:relative;top:0em">∑</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.162em"><span style="top:-2.4003em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0572em">j</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.4358em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal">ϕ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3117em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0572em">j</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>0</mn></mrow><annotation encoding="application/x-tex">0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span></td></tr></tbody></table>
<p>Rate-latency functions are convex, so by the concatenation rule of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra">the min-plus algebra post</a> a tandem of rate-latency servers is again rate-latency.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-example-a-time-aware-shaper-window">4. Example: a Time-Aware Shaper window<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#4-example-a-time-aware-shaper-window" class="hash-link" aria-label="Direct link to 4. Example: a Time-Aware Shaper window" title="Direct link to 4. Example: a Time-Aware Shaper window" translate="no">​</a></h2>
<p>Consider an egress queue controlled by an <a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">802.1Qbv</a> gate that is open for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>w</mi></mrow><annotation encoding="application/x-tex">w</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span></span></span></span> time units in every cycle of length <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>c</mi></mrow><annotation encoding="application/x-tex">c</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">c</span></span></span></span>, on a link of rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span>. Assume, for simplicity, that no other queue transmits during this window and ignore the guard band that prevents frames from overrunning the window.</p>
<p>In the worst case, the queue becomes backlogged just as its gate closes. It then waits <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>c</mi><mo>−</mo><mi>w</mi></mrow><annotation encoding="application/x-tex">c - w</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord mathnormal">c</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span></span></span></span>, is served at rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span> for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>w</mi></mrow><annotation encoding="application/x-tex">w</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span></span></span></span>, waits again, and so on. The resulting cumulative service is a staircase whose lower corners lie on the line of slope <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi><mi>w</mi><mi mathvariant="normal">/</mi><mi>c</mi></mrow><annotation encoding="application/x-tex">Cw/c</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord mathnormal" style="margin-right:0.0269em">w</span><span class="mord">/</span><span class="mord mathnormal">c</span></span></span></span> passing through <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mi>c</mi><mo>−</mo><mi>w</mi><mo separator="true">,</mo><mtext> </mtext><mn>0</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(c - w,\, 0)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal">c</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">0</span><span class="mclose">)</span></span></span></span>. Hence the queue receives the strict rate-latency service curve</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mfrac><mrow><mi>C</mi><mi>w</mi></mrow><mi>c</mi></mfrac><mtext> </mtext><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">[</mo><mtext> </mtext><mi>t</mi><mo>−</mo><mo stretchy="false">(</mo><mi>c</mi><mo>−</mo><mi>w</mi><mo stretchy="false">)</mo><mtext> </mtext><msup><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">]</mo><mo>+</mo></msup><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta(t) = \frac{C w}{c}\, \bigl[\, t - (c - w) \,\bigr]^+ .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.0463em;vertical-align:-0.686em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3603em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">c</span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord mathnormal" style="margin-right:0.0269em">w</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.686em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mopen"><span class="delimsizing size1">[</span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal">c</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.3612em;vertical-align:-0.35em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose"><span class="mclose"><span class="delimsizing size1">]</span></span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:1.0112em"><span style="top:-3.3029em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>The rate is the reserved share of the link; the latency is the longest closed interval. Accounting for the guard band and for non-preemptive blocking increases the latency and slightly decreases the effective window.</p>
<div class="theme-admonition theme-admonition-tip admonition_U78o alert alert--success"><div class="admonitionHeading_hpf8"><span class="admonitionIcon_bCJT"><svg viewBox="0 0 12 16"><path fill-rule="evenodd" d="M6.5 0C3.48 0 1 2.19 1 5c0 .92.55 2.25 1 3 1.34 2.25 1.78 2.78 2 4v1h5v-1c.22-1.22.66-1.75 2-4 .45-.75 1-2.08 1-3 0-2.81-2.48-5-5.5-5zm3.64 7.48c-.25.44-.47.8-.67 1.11-.86 1.41-1.25 2.06-1.45 3.23-.02.05-.02.11-.02.17H5c0-.06 0-.13-.02-.17-.2-1.17-.59-1.83-1.45-3.23-.2-.31-.42-.67-.67-1.11C2.44 6.78 2 5.65 2 5c0-2.2 2.02-4 4.5-4 1.22 0 2.36.42 3.22 1.19C10.55 2.94 11 3.94 11 5c0 .66-.44 1.78-.86 2.48zM4 14h5c-.23 1.14-1.3 2-2.5 2s-2.27-.86-2.5-2z"></path></svg></span>Modelling choice</div><div class="admonitionContent_PHbT"><p>The rate-latency bound discards the staircase structure and is therefore pessimistic for traffic that is <em>synchronised</em> with the gate schedule. Time-triggered <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> analyses often exploit that synchronisation explicitly; <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> remains the method of choice for traffic that is not synchronised, and for the residual service left to lower-priority classes.</p></div></div>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-service-curves-are-a-contract-not-a-description">5. Service curves are a contract, not a description<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#5-service-curves-are-a-contract-not-a-description" class="hash-link" aria-label="Direct link to 5. Service curves are a contract, not a description" title="Direct link to 5. Service curves are a contract, not a description" translate="no">​</a></h2>
<p>A service curve is a guarantee that the system <em>at least</em> provides, not an exact model. This has two consequences that recur in the rest of the series.</p>
<ol>
<li class=""><strong>Composability.</strong> Any lower bound of a service curve is still a service curve, so one may always simplify a complex curve to a rate-latency one and keep sound (if looser) bounds.</li>
<li class=""><strong>Robustness.</strong> Bounds derived from service curves remain valid under any implementation that honours the curve, which is what a certificate needs.</li>
</ol>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/service-curves#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 1. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus</em>, Wiley-ISTE, 2018.</li>
<li class="">IEEE Std 802.1Qbv-2015, <em>Enhancements for Scheduled Traffic</em>, now incorporated in IEEE Std 802.1Q.</li>
</ol>]]></content:encoded>
            <category>Book</category>
            <category>Foundations</category>
            <category>Network calculus</category>
            <category>TAS</category>
        </item>
        <item>
            <title><![CDATA[The three fundamental bounds: delay, backlog and output]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds</guid>
            <pubDate>Sat, 03 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Horizontal and vertical deviations, the output arrival curve, and closed forms for a token-bucket flow crossing a rate-latency server.]]></description>
            <content:encoded><![CDATA[<p>With an arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span> for the input and a service curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> for the system, <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> yields three bounds. They are the core results of the theory; everything that follows in this series composes them.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-statements">1. Statements<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#1-statements" class="hash-link" aria-label="Direct link to 1. Statements" title="Direct link to 1. Statements" translate="no">​</a></h2>
<p>Let a flow with arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span> cross a system offering service curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span>.</p>
<p><strong>Backlog bound.</strong> For all <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span>,</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>v</mi><mo stretchy="false">(</mo><mi>α</mi><mo separator="true">,</mo><mi>β</mi><mo stretchy="false">)</mo><mo>=</mo><munder><mrow><mi>sup</mi><mo>⁡</mo></mrow><mrow><mi>s</mi><mo>≥</mo><mn>0</mn></mrow></munder><mo stretchy="false">{</mo><mtext> </mtext><mi>α</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>−</mo><mi>β</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">R(t) - R^*(t) \le v(\alpha, \beta) = \sup_{s \ge 0} \{\, \alpha(s) - \beta(s) \,\}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">v</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.7567em;vertical-align:-1.0067em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.4306em"><span style="top:-2.1885em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">s</span><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">sup</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.0067em"><span></span></span></span></span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mord">.</span></span></span></span></span>
<p><strong>Delay bound.</strong> For all <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span>, the virtual delay satisfies</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>d</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>h</mi><mo stretchy="false">(</mo><mi>α</mi><mo separator="true">,</mo><mi>β</mi><mo stretchy="false">)</mo><mo>=</mo><munder><mrow><mi>sup</mi><mo>⁡</mo></mrow><mrow><mi>s</mi><mo>≥</mo><mn>0</mn></mrow></munder><mo fence="true" stretchy="true" minsize="1.8em" maxsize="1.8em">{</mo><mi>inf</mi><mo>⁡</mo><mo stretchy="false">{</mo><mtext> </mtext><mi>τ</mi><mo>≥</mo><mn>0</mn><mo>:</mo><mi>α</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>β</mi><mo stretchy="false">(</mo><mi>s</mi><mo>+</mo><mi>τ</mi><mo stretchy="false">)</mo><mtext> </mtext><mo stretchy="false">}</mo><mo fence="true" stretchy="true" minsize="1.8em" maxsize="1.8em">}</mo><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">d(t) \le h(\alpha, \beta) = \sup_{s \ge 0} \Bigl\{ \inf \{\, \tau \ge 0 : \alpha(s) \le \beta(s + \tau) \,\} \Bigr\}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">d</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">h</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.1567em;vertical-align:-1.0067em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.4306em"><span style="top:-2.1885em;margin-left:0em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">s</span><span class="mrel mtight">≥</span><span class="mord mtight">0</span></span></span></span><span style="top:-3em"><span class="pstrut" style="height:3em"></span><span><span class="mop">sup</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.0067em"><span></span></span></span></span></span><span class="mopen"><span class="delimsizing size2">{</span></span><span class="mop">in<span style="margin-right:0.0778em">f</span></span><span class="mopen">{</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.1132em">τ</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">:</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.8em;vertical-align:-0.65em"></span><span class="mord mathnormal" style="margin-right:0.1132em">τ</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose">}</span><span class="mclose"><span class="delimsizing size2">}</span></span><span class="mord">.</span></span></span></span></span>
<p><strong>Output arrival curve.</strong> The output flow <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup></mrow><annotation encoding="application/x-tex">R^*</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6887em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span></span></span></span> has arrival curve</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msup><mi>α</mi><mo>∗</mo></msup><mo>=</mo><mi>α</mi><mo>⊘</mo><mi>β</mi><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\alpha^* = \alpha \oslash \beta .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7387em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊘</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mord">.</span></span></span></span></span>
<p><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>v</mi></mrow><annotation encoding="application/x-tex">v</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">v</span></span></span></span> is the <em>vertical deviation</em> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi></mrow><annotation encoding="application/x-tex">h</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span></span></span></span> the <em>horizontal deviation</em> between the two curves. For a FIFO system the virtual delay is the actual delay of every bit, so <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi><mo stretchy="false">(</mo><mi>α</mi><mo separator="true">,</mo><mi>β</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">h(\alpha,\beta)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">h</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mclose">)</span></span></span></span> bounds the delay of every frame of the flow.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-proof-sketch-of-the-backlog-bound">2. Proof sketch of the backlog bound<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#2-proof-sketch-of-the-backlog-bound" class="hash-link" aria-label="Direct link to 2. Proof sketch of the backlog bound" title="Direct link to 2. Proof sketch of the backlog bound" translate="no">​</a></h2>
<p>Fix <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>t</mi></mrow><annotation encoding="application/x-tex">t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span>. By the service curve property there exists <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi><mo>≤</mo><mi>t</mi></mrow><annotation encoding="application/x-tex">s \le t</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6151em"></span><span class="mord mathnormal">t</span></span></span></span> such that <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≥</mo><mi>R</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>+</mo><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R^*(t) \ge R(s) + \beta(t - s)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span></span></span></span>. Hence</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><mi>R</mi><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>−</mo><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>α</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mo>−</mo><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>s</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>v</mi><mo stretchy="false">(</mo><mi>α</mi><mo separator="true">,</mo><mi>β</mi><mo stretchy="false">)</mo><mo separator="true">,</mo></mrow><annotation encoding="application/x-tex">R(t) - R^*(t) \le R(t) - R(s) - \beta(t - s) \le \alpha(t - s) - \beta(t - s) \le v(\alpha, \beta),</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0359em">v</span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mclose">)</span><span class="mpunct">,</span></span></span></span></span>
<p>where the second inequality uses the arrival curve property. The delay bound follows from a similar argument; the output bound follows from <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><msup><mi>R</mi><mo>∗</mo></msup><mo stretchy="false">(</mo><mi>s</mi><mo stretchy="false">)</mo><mo>≤</mo><mi>R</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><mi>R</mi><mo stretchy="false">(</mo><mi>s</mi><mo>−</mo><mi>u</mi><mo stretchy="false">)</mo><mo>−</mo><mi>β</mi><mo stretchy="false">(</mo><mi>u</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R^*(t) - R^*(s) \le R(t) - R(s - u) - \beta(u)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mopen">(</span><span class="mord mathnormal">s</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">u</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">u</span><span class="mclose">)</span></span></span></span> for a suitable <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>u</mi></mrow><annotation encoding="application/x-tex">u</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">u</span></span></span></span> and the duality property of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>⊘</mo></mrow><annotation encoding="application/x-tex">\oslash</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord">⊘</span></span></span></span>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-closed-forms-token-bucket-through-a-rate-latency-server">3. Closed forms: token bucket through a rate-latency server<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#3-closed-forms-token-bucket-through-a-rate-latency-server" class="hash-link" aria-label="Direct link to 3. Closed forms: token bucket through a rate-latency server" title="Direct link to 3. Closed forms: token bucket through a rate-latency server" translate="no">​</a></h2>
<p>Take <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi><mo>=</mo><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mi>b</mi></mrow></msub></mrow><annotation encoding="application/x-tex">\alpha = \gamma_{r,b}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7167em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight">b</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi><mo>=</mo><msub><mi>β</mi><mrow><mi>R</mi><mo separator="true">,</mo><mi>T</mi></mrow></msub></mrow><annotation encoding="application/x-tex">\beta = \beta_{R,T}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span> with the stability condition <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>≤</mo><mi>R</mi></mrow><annotation encoding="application/x-tex">r \le R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>. The three bounds become</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>D</mi><mo>=</mo><mi>T</mi><mo>+</mo><mfrac><mi>b</mi><mi>R</mi></mfrac><mo separator="true">,</mo><mspace width="2em"></mspace><mi>B</mi><mo>=</mo><mi>b</mi><mo>+</mo><mi>r</mi><mtext> </mtext><mi>T</mi><mo separator="true">,</mo><mspace width="2em"></mspace><msup><mi>α</mi><mo>∗</mo></msup><mo>=</mo><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mtext>  </mtext><mi>b</mi><mo>+</mo><mi>r</mi><mi>T</mi></mrow></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">D = T + \frac{b}{R}, \qquad B = b + r\,T, \qquad \alpha^* = \gamma_{r,\; b + r T}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">D</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:2.0574em;vertical-align:-0.686em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3714em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">b</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.686em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.9331em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7387em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7167em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.3253em"></span><span class="mord mathnormal mtight">b</span><span class="mbin mtight">+</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<figure class="nc-figure"><svg viewBox="0 0 600 390" width="600" role="img" aria-label="Token-bucket arrival curve and rate-latency service curve with delay and backlog bounds"><defs><marker id="nc-arrow" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><line x1="60" y1="340" x2="575" y2="340" stroke="var(--ifm-font-color-base)" stroke-width="1.2"></line><line x1="60" y1="340" x2="60" y2="25" stroke="var(--ifm-font-color-base)" stroke-width="1.2"></line><text x="580" y="345" font-size="15" fill="var(--ifm-font-color-base)">t</text><text x="40" y="22" font-size="15" fill="var(--ifm-font-color-base)">bits</text><line x1="60" y1="250" x2="560" y2="50" stroke="var(--nc-arrival)" stroke-width="2.5"></line><circle cx="60" cy="250" r="3.5" fill="var(--nc-arrival)"></circle><text x="470" y="68" font-size="15" fill="var(--nc-arrival)">α(t) = b + r·t</text><polyline points="60,340 160,340 360,40" fill="none" stroke="var(--nc-service)" stroke-width="2.5"></polyline><text x="372" y="48" font-size="15" fill="var(--nc-service)">β(t) = R·[t − T]⁺</text><line x1="62" y1="250" x2="218" y2="250" stroke="var(--nc-bound)" stroke-width="1.5" stroke-dasharray="5 4" marker-start="url(#nc-arrow)" marker-end="url(#nc-arrow)"></line><text x="96" y="242" font-size="14" fill="var(--ifm-font-color-base)">D = T + b/R</text><line x1="160" y1="212" x2="160" y2="338" stroke="var(--nc-bound)" stroke-width="1.5" stroke-dasharray="5 4" marker-start="url(#nc-arrow)" marker-end="url(#nc-arrow)"></line><text x="168" y="300" font-size="14" fill="var(--ifm-font-color-base)">B = b + r·T</text><text x="155" y="360" font-size="14" fill="var(--ifm-font-color-base)">T</text><text x="44" y="255" font-size="14" fill="var(--ifm-font-color-base)">b</text><text x="50" y="360" font-size="14" fill="var(--ifm-font-color-base)">0</text></svg><figcaption>Figure 1. Delay and backlog bounds as the horizontal and vertical deviations between an arrival curve α and a service curve β (case r ≤ R).</figcaption></figure>
<p>Each formula has a direct reading.</p>
<ul>
<li class=""><strong>Delay.</strong> A burst of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span></span></span></span> bits arrives just as the server starts its worst-case <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span>; it is then drained at rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi></mrow><annotation encoding="application/x-tex">R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>.</li>
<li class=""><strong>Backlog.</strong> During the latency <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span> nothing leaves, while the burst <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span></span></span></span> and a further <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mi>T</mi></mrow><annotation encoding="application/x-tex">rT</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span> bits may arrive.</li>
<li class=""><strong>Output burst.</strong> The long-term rate is unchanged, but the burst grows by <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mi>T</mi></mrow><annotation encoding="application/x-tex">rT</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span>: data held back during the latency may leave back-to-back. This <em>burstiness increase</em> is what makes multi-hop analysis non-trivial.</li>
</ul>
<p>If <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>&gt;</mo><mi>R</mi></mrow><annotation encoding="application/x-tex">r &gt; R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.5782em;vertical-align:-0.0391em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">&gt;</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span>, both <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>v</mi></mrow><annotation encoding="application/x-tex">v</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0359em">v</span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi></mrow><annotation encoding="application/x-tex">h</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">h</span></span></span></span> are infinite: no finite bound exists, which is the network-calculus statement of instability.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-numerical-example">4. Numerical example<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#4-numerical-example" class="hash-link" aria-label="Direct link to 4. Numerical example" title="Direct link to 4. Numerical example" translate="no">​</a></h2>
<p>Reuse the control stream of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">the arrival curves post</a>, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mo>=</mo><mn>12</mn><mtext> </mtext><mn>000</mn></mrow><annotation encoding="application/x-tex">b = 12\,000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span></span></span></span> bits, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>=</mo><mn>12</mn></mrow><annotation encoding="application/x-tex">r = 12</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span></span></span></span> Mbit/s, and a <a href="https://en.wikipedia.org/wiki/Network_switch" target="_blank" rel="noopener noreferrer" class="">switch</a> port offering <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mrow><mi>R</mi><mo separator="true">,</mo><mi>T</mi></mrow></msub></mrow><annotation encoding="application/x-tex">\beta_{R,T}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span> with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mo>=</mo><mn>100</mn></mrow><annotation encoding="application/x-tex">R = 100</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">100</span></span></span></span> Mbit/s and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi><mo>=</mo><mn>20</mn><mtext>&nbsp;</mtext><mi>μ</mi><mi>s</mi></mrow><annotation encoding="application/x-tex">T = 20\ \mu s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8389em;vertical-align:-0.1944em"></span><span class="mord">20</span><span class="mspace">&nbsp;</span><span class="mord mathnormal">μ</span><span class="mord mathnormal">s</span></span></span></span>.</p>
<table><thead><tr><th>Quantity</th><th>Formula</th><th>Value</th></tr></thead><tbody><tr><td>Delay bound</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi><mo>+</mo><mi>b</mi><mi mathvariant="normal">/</mi><mi>R</mi></mrow><annotation encoding="application/x-tex">T + b/R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">b</span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>20</mn><mo>+</mo><mn>120</mn><mo>=</mo><mn>140</mn><mtext>&nbsp;</mtext><mi>μ</mi><mi>s</mi></mrow><annotation encoding="application/x-tex">20 + 120 = 140\ \mu s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">20</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">120</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8389em;vertical-align:-0.1944em"></span><span class="mord">140</span><span class="mspace">&nbsp;</span><span class="mord mathnormal">μ</span><span class="mord mathnormal">s</span></span></span></span></td></tr><tr><td>Backlog bound</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mo>+</mo><mi>r</mi><mi>T</mi></mrow><annotation encoding="application/x-tex">b + rT</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>12</mn><mtext> </mtext><mn>000</mn><mo>+</mo><mn>240</mn><mo>=</mo><mn>12</mn><mtext> </mtext><mn>240</mn></mrow><annotation encoding="application/x-tex">12\,000 + 240 = 12\,240</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">240</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">240</span></span></span></span> bits</td></tr><tr><td>Output burst</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mo>+</mo><mi>r</mi><mi>T</mi></mrow><annotation encoding="application/x-tex">b + rT</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>12</mn><mtext> </mtext><mn>240</mn></mrow><annotation encoding="application/x-tex">12\,240</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">240</span></span></span></span> bits</td></tr></tbody></table>
<p>The output burst is the input burst of the next hop. The next post shows that propagating it hop by hop is sound but pessimistic, and how to avoid that pessimism.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-tightness">5. Tightness<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#5-tightness" class="hash-link" aria-label="Direct link to 5. Tightness" title="Direct link to 5. Tightness" translate="no">​</a></h2>
<p>For a single node with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>α</mi></mrow><annotation encoding="application/x-tex">\alpha</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0037em">α</span></span></span></span> a good arrival curve and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> a service curve, the bounds are <em>tight</em>: there exist a trajectory and a system that attain them. Tightness is lost when nodes are composed or when flows are aggregated, and recovering it at acceptable computational cost is one of the active research topics of the field.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>Network Calculus: Guaranteed performance analysis in networks</em>, LINCS seminar. <a href="https://www.youtube.com/watch?v=1funUBUL2II" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 1. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus</em>, Wiley-ISTE, 2018.</li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Book</category>
            <category>Network calculus</category>
        </item>
        <item>
            <title><![CDATA[Concatenation and the "pay bursts only once" principle]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once</guid>
            <pubDate>Sun, 04 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[End-to-end service curves by min-plus convolution, and why they give tighter bounds than summing per-hop delays.]]></description>
            <content:encoded><![CDATA[<p>A flow in a <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> network crosses several <a href="https://en.wikipedia.org/wiki/Network_bridge" target="_blank" rel="noopener noreferrer" class="">bridges</a>. There are two ways to bound its end-to-end delay: add the per-hop bounds, or first compose the hops into a single equivalent server. The second is never worse and often much better. This post explains why.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-concatenation-theorem">1. Concatenation theorem<a href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once#1-concatenation-theorem" class="hash-link" aria-label="Direct link to 1. Concatenation theorem" title="Direct link to 1. Concatenation theorem" translate="no">​</a></h2>
<p>If a flow crosses system <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>S</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">S_1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0576em">S</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0576em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> offering service curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">\beta_1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> and then system <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>S</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">S_2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0576em">S</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0576em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> offering <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">\beta_2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>, the concatenation offers the service curve</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>β</mi><mrow><mn>1</mn><mo separator="true">,</mo><mn>2</mn></mrow></msub><mo>=</mo><msub><mi>β</mi><mn>1</mn></msub><mo>⊗</mo><msub><mi>β</mi><mn>2</mn></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta_{1,2} = \beta_1 \otimes \beta_2 .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">1</span><span class="mpunct mtight">,</span><span class="mord mtight">2</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>The proof is a one-line consequence of associativity: <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msubsup><mi>R</mi><mn>2</mn><mo>∗</mo></msubsup><mo>≥</mo><msubsup><mi>R</mi><mn>1</mn><mo>∗</mo></msubsup><mo>⊗</mo><msub><mi>β</mi><mn>2</mn></msub><mo>≥</mo><mo stretchy="false">(</mo><mi>R</mi><mo>⊗</mo><msub><mi>β</mi><mn>1</mn></msub><mo stretchy="false">)</mo><mo>⊗</mo><msub><mi>β</mi><mn>2</mn></msub><mo>=</mo><mi>R</mi><mo>⊗</mo><mo stretchy="false">(</mo><msub><mi>β</mi><mn>1</mn></msub><mo>⊗</mo><msub><mi>β</mi><mn>2</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R_2^* \ge R_1^* \otimes \beta_2 \ge (R \otimes \beta_1) \otimes \beta_2 = R \otimes (\beta_1 \otimes \beta_2)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9368em;vertical-align:-0.2481em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-2.4519em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2481em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.9368em;vertical-align:-0.2481em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.6887em"><span style="top:-2.4519em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">∗</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2481em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7667em;vertical-align:-0.0833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">⊗</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>. The result extends to any number of hops by induction.</p>
<p>For rate-latency servers, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/min-plus-algebra">the min-plus algebra post</a> gives the closed form</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><munderover><mo>⨂</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><msub><mi>β</mi><mrow><msub><mi>R</mi><mi>i</mi></msub><mo separator="true">,</mo><msub><mi>T</mi><mi>i</mi></msub></mrow></msub><mo>=</mo><msub><mi>β</mi><mrow><munder><mrow><mi>min</mi><mo>⁡</mo></mrow><mi>i</mi></munder><msub><mi>R</mi><mi>i</mi></msub><mo separator="true">,</mo><mtext>  </mtext><munder><mo>∑</mo><mi>i</mi></munder><msub><mi>T</mi><mi>i</mi></msub></mrow></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\bigotimes_{i=1}^{n} \beta_{R_i, T_i} = \beta_{\min_i R_i,\; \sum_i T_i}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:2.9291em;vertical-align:-1.2777em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.6514em"><span style="top:-1.8723em;margin-left:0em"><span class="pstrut" style="height:3.05em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">i</span><span class="mrel mtight">=</span><span class="mord mtight">1</span></span></span></span><span style="top:-3.05em"><span class="pstrut" style="height:3.05em"></span><span><span class="mop op-symbol large-op">⨂</span></span></span><span style="top:-4.3em;margin-left:0em"><span class="pstrut" style="height:3.05em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">n</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.2777em"><span></span></span></span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3281em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3281em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.0996em;vertical-align:-0.4052em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.5198em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mop mtight"><span class="mop mtight"><span class="mtight">m</span><span class="mtight">i</span><span class="mtight">n</span></span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3281em"><span style="top:-2.357em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3281em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.3253em"></span><span class="mop mtight"><span class="mop op-symbol small-op mtight" style="position:relative;top:0em">∑</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1496em"><span style="top:-2.1786em;margin-left:0em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3214em"><span></span></span></span></span></span></span><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3281em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mathnormal mtight">i</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.4052em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>The path behaves like a single server whose rate is the bottleneck rate and whose <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> is the sum of the latencies.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-two-ways-to-bound-a-two-hop-path">2. Two ways to bound a two-hop path<a href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once#2-two-ways-to-bound-a-two-hop-path" class="hash-link" aria-label="Direct link to 2. Two ways to bound a two-hop path" title="Direct link to 2. Two ways to bound a two-hop path" translate="no">​</a></h2>
<p>Consider a <a href="https://en.wikipedia.org/wiki/Token_bucket" target="_blank" rel="noopener noreferrer" class="">token-bucket</a> flow <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>γ</mi><mrow><mi>r</mi><mo separator="true">,</mo><mi>b</mi></mrow></msub></mrow><annotation encoding="application/x-tex">\gamma_{r,b}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7167em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight">b</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span> crossing two rate-latency servers <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mrow><msub><mi>R</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>T</mi><mn>1</mn></msub></mrow></msub></mrow><annotation encoding="application/x-tex">\beta_{R_1,T_1}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span> and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>β</mi><mrow><msub><mi>R</mi><mn>2</mn></msub><mo separator="true">,</mo><msub><mi>T</mi><mn>2</mn></msub></mrow></msub></mrow><annotation encoding="application/x-tex">\beta_{R_2,T_2}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9805em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0077em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.1389em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span>, with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>≤</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><msub><mi>R</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>R</mi><mn>2</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">r \le \min(R_1, R_2)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7719em;vertical-align:-0.136em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>.</p>
<p><strong>Additive (hop-by-hop) analysis.</strong> At hop 1 the delay is <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>T</mi><mn>1</mn></msub><mo>+</mo><mi>b</mi><mi mathvariant="normal">/</mi><msub><mi>R</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">T_1 + b/R_1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">b</span><span class="mord">/</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> and the output burst is <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mo>+</mo><mi>r</mi><msub><mi>T</mi><mn>1</mn></msub></mrow><annotation encoding="application/x-tex">b + rT_1</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>. At hop 2 the delay is <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>T</mi><mn>2</mn></msub><mo>+</mo><mo stretchy="false">(</mo><mi>b</mi><mo>+</mo><mi>r</mi><msub><mi>T</mi><mn>1</mn></msub><mo stretchy="false">)</mo><mi mathvariant="normal">/</mi><msub><mi>R</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">T_2 + (b + rT_1)/R_2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span><span class="mord">/</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>. Summing,</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>D</mi><mtext>add</mtext></msub><mo>=</mo><msub><mi>T</mi><mn>1</mn></msub><mo>+</mo><msub><mi>T</mi><mn>2</mn></msub><mo>+</mo><mfrac><mi>b</mi><msub><mi>R</mi><mn>1</mn></msub></mfrac><mo>+</mo><mfrac><mrow><mi>b</mi><mo>+</mo><mi>r</mi><msub><mi>T</mi><mn>1</mn></msub></mrow><msub><mi>R</mi><mn>2</mn></msub></mfrac><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">D_{\text{add}} = T_1 + T_2 + \frac{b}{R_1} + \frac{b + r T_1}{R_2}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0278em">D</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0278em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord text mtight"><span class="mord mtight">add</span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:2.2074em;vertical-align:-0.836em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3714em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">b</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.836em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:2.2074em;vertical-align:-0.836em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3714em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.836em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mord">.</span></span></span></span></span>
<p><strong>Concatenated analysis.</strong> With <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mo>=</mo><mi>min</mi><mo>⁡</mo><mo stretchy="false">(</mo><msub><mi>R</mi><mn>1</mn></msub><mo separator="true">,</mo><msub><mi>R</mi><mn>2</mn></msub><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">R = \min(R_1, R_2)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mop">min</span><span class="mopen">(</span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span></span></span></span>,</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>D</mi><mtext>conc</mtext></msub><mo>=</mo><msub><mi>T</mi><mn>1</mn></msub><mo>+</mo><msub><mi>T</mi><mn>2</mn></msub><mo>+</mo><mfrac><mi>b</mi><mi>R</mi></mfrac><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">D_{\text{conc}} = T_1 + T_2 + \frac{b}{R}.</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0278em">D</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:-0.0278em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord text mtight"><span class="mord mtight">conc</span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.1389em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:2.0574em;vertical-align:-0.686em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3714em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal">b</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.686em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mord">.</span></span></span></span></span>
<p>The additive bound pays the burst <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi></mrow><annotation encoding="application/x-tex">b</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span></span></span></span> at <em>every</em> hop, and additionally pays the burst <em>increase</em> created by upstream latencies. The concatenated bound pays the burst once, at the bottleneck. This is the <strong>pay bursts only once</strong> (PBOO) principle.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-numerical-example">3. Numerical example<a href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once#3-numerical-example" class="hash-link" aria-label="Direct link to 3. Numerical example" title="Direct link to 3. Numerical example" translate="no">​</a></h2>
<p>Take two identical hops with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>R</mi><mo>=</mo><mn>100</mn></mrow><annotation encoding="application/x-tex">R = 100</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">100</span></span></span></span> Mbit/s and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi><mo>=</mo><mn>20</mn><mtext>&nbsp;</mtext><mi>μ</mi><mi>s</mi></mrow><annotation encoding="application/x-tex">T = 20\ \mu s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.8389em;vertical-align:-0.1944em"></span><span class="mord">20</span><span class="mspace">&nbsp;</span><span class="mord mathnormal">μ</span><span class="mord mathnormal">s</span></span></span></span>, and the flow <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mo>=</mo><mn>12</mn><mtext> </mtext><mn>000</mn></mrow><annotation encoding="application/x-tex">b = 12\,000</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">000</span></span></span></span> bits, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>r</mi><mo>=</mo><mn>12</mn></mrow><annotation encoding="application/x-tex">r = 12</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">12</span></span></span></span> Mbit/s from the previous posts.</p>
<table><thead><tr><th>Method</th><th>Formula</th><th>Bound</th></tr></thead><tbody><tr><td>Additive</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">(</mo><mn>20</mn><mo>+</mo><mn>120</mn><mo stretchy="false">)</mo><mo>+</mo><mo stretchy="false">(</mo><mn>20</mn><mo>+</mo><mn>122.4</mn><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">(20 + 120) + (20 + 122.4)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord">20</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord">120</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord">20</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord">122.4</span><span class="mclose">)</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>282.4</mn><mtext>&nbsp;</mtext><mi>μ</mi><mi>s</mi></mrow><annotation encoding="application/x-tex">282.4\ \mu s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8389em;vertical-align:-0.1944em"></span><span class="mord">282.4</span><span class="mspace">&nbsp;</span><span class="mord mathnormal">μ</span><span class="mord mathnormal">s</span></span></span></span></td></tr><tr><td>Concatenated</td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>40</mn><mo>+</mo><mn>120</mn></mrow><annotation encoding="application/x-tex">40 + 120</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">40</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">120</span></span></span></span></td><td><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>160</mn><mtext>&nbsp;</mtext><mi>μ</mi><mi>s</mi></mrow><annotation encoding="application/x-tex">160\ \mu s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8389em;vertical-align:-0.1944em"></span><span class="mord">160</span><span class="mspace">&nbsp;</span><span class="mord mathnormal">μ</span><span class="mord mathnormal">s</span></span></span></span></td></tr></tbody></table>
<p>The concatenated bound is about 43 % smaller. The gap grows linearly with the number of hops: with <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">n</span></span></span></span> identical hops, the additive bound grows like <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mtext> </mtext><mi>b</mi><mi mathvariant="normal">/</mi><mi>R</mi></mrow><annotation encoding="application/x-tex">n\,b/R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal">b</span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span> whereas the concatenated bound keeps a single <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>b</mi><mi mathvariant="normal">/</mi><mi>R</mi></mrow><annotation encoding="application/x-tex">b/R</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal">b</span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.0077em">R</span></span></span></span> term.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-why-this-matters-for-tsn">4. Why this matters for TSN<a href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once#4-why-this-matters-for-tsn" class="hash-link" aria-label="Direct link to 4. Why this matters for TSN" title="Direct link to 4. Why this matters for TSN" translate="no">​</a></h2>
<p>PBOO is the reason per-flow, path-based analyses can be much tighter than per-node analyses. It is not free, however.</p>
<ul>
<li class="">It requires a <em>per-flow</em> service curve at each hop. When flows share a queue, one must first derive the service left to the flow of interest, the <strong>residual service curve</strong>, which is the subject of the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">next post</a>.</li>
<li class="">For aggregate scheduling, a related principle, <strong>pay multiplexing only once</strong> (PMOO), avoids paying the interference of a cross flow at every hop it shares with the flow of interest. PMOO is established for blind multiplexing; FIFO multiplexing requires different techniques.</li>
</ul>
<p>The trade-off between per-node analyses (simple, incremental, fast) and path-based analyses (tighter, more expensive) recurs in the discussion of online <a href="https://en.wikipedia.org/wiki/Admission_control" target="_blank" rel="noopener noreferrer" class="">admission control</a> in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn">the reconfiguration post</a>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/concatenation-pay-bursts-only-once#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 1. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">J. B. Schmitt, F. A. Zdarsky, I. Martinovic, "Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once," MMB 2008.</li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus</em>, Wiley-ISTE, 2018.</li>
</ol>]]></content:encoded>
            <category>Article</category>
            <category>Book</category>
            <category>Network calculus</category>
        </item>
        <item>
            <title><![CDATA[Aggregate multiplexing and residual service]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service</guid>
            <pubDate>Mon, 05 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Blind, FIFO and non-preemptive static-priority multiplexing; residual service curves; Total Flow Analysis versus path-based analyses.]]></description>
            <content:encoded><![CDATA[<p>In a real <a href="https://en.wikipedia.org/wiki/Network_switch" target="_blank" rel="noopener noreferrer" class="">switch</a>, 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 <strong>residual service curve</strong>, and its form depends on the multiplexing policy.</p>
<!-- -->
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-blind-multiplexing">1. Blind multiplexing<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#1-blind-multiplexing" class="hash-link" aria-label="Direct link to 1. Blind multiplexing" title="Direct link to 1. Blind multiplexing" translate="no">​</a></h2>
<p>Under <em>blind</em> (arbitrary) multiplexing nothing is assumed about the order in which the server picks bits from different flows. Let a server offer a <strong>strict</strong> service curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> to the aggregate of flows 1 and 2, and let flow 2 have arrival curve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>α</mi><mn>2</mn></msub></mrow><annotation encoding="application/x-tex">\alpha_2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.5806em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0037em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>. Then flow 1 receives the service curve</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>β</mi><mn>1</mn></msub><mo>=</mo><mo stretchy="false">[</mo><mi>β</mi><mo>−</mo><msub><mi>α</mi><mn>2</mn></msub><msup><mo stretchy="false">]</mo><mo>+</mo></msup><mo separator="true">,</mo></mrow><annotation encoding="application/x-tex">\beta_1 = [\beta - \alpha_2]^+ ,</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">[</span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.0713em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0037em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose"><span class="mclose">]</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8213em"><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mpunct">,</span></span></span></span></span>
<p>provided this function is wide-sense increasing (otherwise one takes its largest increasing lower bound). The strictness of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>β</mi></mrow><annotation encoding="application/x-tex">\beta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em"></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span></span></span></span> is essential: the result is false for general min-plus service curves.</p>
<p>For a rate-latency server and a <a href="https://en.wikipedia.org/wiki/Token_bucket" target="_blank" rel="noopener noreferrer" class="">token-bucket</a> cross flow, the residual service is again rate-latency:</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">[</mo><msub><mi>β</mi><mrow><mi>C</mi><mo separator="true">,</mo><mi>T</mi></mrow></msub><mo>−</mo><msub><mi>γ</mi><mrow><msub><mi>r</mi><mn>2</mn></msub><mo separator="true">,</mo><msub><mi>b</mi><mn>2</mn></msub></mrow></msub><msup><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">]</mo><mo>+</mo></msup><mo>=</mo><msub><mi>β</mi><mrow><mtext> </mtext><mi>C</mi><mo>−</mo><msub><mi>r</mi><mn>2</mn></msub><mo separator="true">,</mo><mtext>  </mtext><mfrac><mrow><mi>C</mi><mi>T</mi><mo>+</mo><msub><mi>b</mi><mn>2</mn></msub></mrow><mrow><mi>C</mi><mo>−</mo><msub><mi>r</mi><mn>2</mn></msub></mrow></mfrac></mrow></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\bigl[\beta_{C,T} - \gamma_{r_2,b_2}\bigr]^+ = \beta_{\,C - r_2,\; \frac{C T + b_2}{C - r_2}} .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.2em;vertical-align:-0.35em"></span><span class="mopen"><span class="delimsizing size1">[</span></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span><span class="mpunct mtight">,</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.3612em;vertical-align:-0.35em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0556em">γ</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0556em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0278em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mord mtight"><span class="mord mathnormal mtight">b</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:0em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mclose"><span class="mclose"><span class="delimsizing size1">]</span></span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:1.0112em"><span style="top:-3.3029em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.4637em;vertical-align:-0.7693em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.6213em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mspace mtight" style="margin-right:0.1952em"></span><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span><span class="mbin mtight">−</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3173em"><span style="top:-2.357em;margin-left:-0.0278em;margin-right:0.0714em"><span class="pstrut" style="height:2.5em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.143em"><span></span></span></span></span></span></span><span class="mpunct mtight">,</span><span class="mspace mtight" style="margin-right:0.3253em"></span><span class="mord mtight"><span class="mopen nulldelimiter sizing reset-size3 size6"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.0336em"><span style="top:-2.656em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span><span class="mbin mtight">−</span><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.3448em;margin-left:-0.0278em;margin-right:0.1em"><span class="pstrut" style="height:2.6444em"></span><span class="mord mtight">2</span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2996em"><span></span></span></span></span></span></span></span></span></span><span style="top:-3.2255em"><span class="pstrut" style="height:3em"></span><span class="frac-line mtight" style="border-bottom-width:0.049em"></span></span><span style="top:-3.5375em"><span class="pstrut" style="height:3em"></span><span class="sizing reset-size3 size1 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0715em">C</span><span class="mord mathnormal mtight" style="margin-right:0.1389em">T</span><span class="mbin mtight">+</span><span class="mord mtight"><span class="mord mathnormal mtight">b</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.3448em;margin-left:0em;margin-right:0.1em"><span class="pstrut" style="height:2.6444em"></span><span class="mord mtight">2</span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2996em"><span></span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.558em"><span></span></span></span></span></span><span class="mclose nulldelimiter sizing reset-size3 size6"></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.7693em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>The residual rate is what the cross flow leaves on average; the residual <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> includes the time needed to serve the cross flow's burst and its backlog accumulated during <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>T</mi></mrow><annotation encoding="application/x-tex">T</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.1389em">T</span></span></span></span>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-fifo-multiplexing">2. FIFO multiplexing<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#2-fifo-multiplexing" class="hash-link" aria-label="Direct link to 2. FIFO multiplexing" title="Direct link to 2. FIFO multiplexing" translate="no">​</a></h2>
<p>Under FIFO, bits are served in arrival order regardless of the flow. This is more information than blind multiplexing, and it yields a <em>family</em> of residual service curves indexed by <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>θ</mi><mo>≥</mo><mn>0</mn></mrow><annotation encoding="application/x-tex">\theta \ge 0</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8304em;vertical-align:-0.136em"></span><span class="mord mathnormal" style="margin-right:0.0278em">θ</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≥</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6444em"></span><span class="mord">0</span></span></span></span>:</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msubsup><mi>β</mi><mn>1</mn><mi>θ</mi></msubsup><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">[</mo><mi>β</mi><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>−</mo><msub><mi>α</mi><mn>2</mn></msub><mo stretchy="false">(</mo><mi>t</mi><mo>−</mo><mi>θ</mi><mo stretchy="false">)</mo><msup><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">]</mo><mo>+</mo></msup><msub><mn mathvariant="bold">1</mn><mrow><mo stretchy="false">{</mo><mi>t</mi><mo>&gt;</mo><mi>θ</mi><mo stretchy="false">}</mo></mrow></msub><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta_1^{\theta}(t) = \bigl[\beta(t) - \alpha_2(t - \theta)\bigr]^+ \mathbf{1}_{\{t &gt; \theta\}} .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1.1491em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.8991em"><span style="top:-2.453em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span><span style="top:-3.113em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0278em">θ</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.247em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.2em;vertical-align:-0.35em"></span><span class="mopen"><span class="delimsizing size1">[</span></span><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0037em">α</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em"><span style="top:-2.55em;margin-left:-0.0037em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.3664em;vertical-align:-0.3552em"></span><span class="mord mathnormal" style="margin-right:0.0278em">θ</span><span class="mclose">)</span><span class="mclose"><span class="mclose"><span class="delimsizing size1">]</span></span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:1.0112em"><span style="top:-3.3029em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mord"><span class="mord mathbf">1</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3448em"><span style="top:-2.5198em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">{</span><span class="mord mathnormal mtight">t</span><span class="mrel mtight">&gt;</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">θ</span><span class="mclose mtight">}</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3552em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>Each member is a valid service curve for flow 1; choosing <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>θ</mi></mrow><annotation encoding="application/x-tex">\theta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0278em">θ</span></span></span></span> well gives bounds tighter than blind multiplexing. Optimising <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>θ</mi></mrow><annotation encoding="application/x-tex">\theta</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0278em">θ</span></span></span></span> across all hops of a path is what makes exact FIFO analysis computationally hard and motivates linear-programming approaches.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-non-preemptive-static-priority">3. Non-preemptive static priority<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#3-non-preemptive-static-priority" class="hash-link" aria-label="Direct link to 3. Non-preemptive static priority" title="Direct link to 3. Non-preemptive static priority" translate="no">​</a></h2>
<p><a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> egress ports have up to eight traffic classes served by strict priority, and a frame being transmitted is not interrupted (preemption under <a href="https://standards.ieee.org/ieee/802.1Qbu/5464/" target="_blank" rel="noopener noreferrer" class="">802.1Qbu</a>/802.3br is optional). Consider class <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0315em">k</span></span></span></span> at a port of rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi></mrow><annotation encoding="application/x-tex">C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span>, and let</p>
<ul>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>B</mi><mi>H</mi></msub><mo separator="true">,</mo><msub><mi>R</mi><mi>H</mi></msub></mrow><annotation encoding="application/x-tex">B_H, R_H</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8778em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> be the aggregate burst and rate of all higher-priority classes,</li>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub></mrow><annotation encoding="application/x-tex">L_{lo}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> be the largest frame of any lower-priority class,</li>
<li class=""><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>B</mi><mi>k</mi></msub></mrow><annotation encoding="application/x-tex">B_k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> be the aggregate burst of class <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0315em">k</span></span></span></span>.</li>
</ul>
<p>The class-<span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0315em">k</span></span></span></span> aggregate is blocked by at most one lower-priority frame and is otherwise served whenever no higher-priority traffic is waiting. It therefore receives the strict rate-latency service curve</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>β</mi><mi>k</mi></msub><mo stretchy="false">(</mo><mi>t</mi><mo stretchy="false">)</mo><mo>=</mo><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">[</mo><mtext> </mtext><mi>C</mi><mi>t</mi><mo>−</mo><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub><mo>−</mo><msub><mi>B</mi><mi>H</mi></msub><mo>−</mo><msub><mi>R</mi><mi>H</mi></msub><mi>t</mi><mtext> </mtext><msup><mo fence="true" stretchy="true" minsize="1.2em" maxsize="1.2em">]</mo><mo>+</mo></msup><mo>=</mo><mo stretchy="false">(</mo><mi>C</mi><mo>−</mo><msub><mi>R</mi><mi>H</mi></msub><mo stretchy="false">)</mo><msup><mrow><mo fence="true">[</mo><mi>t</mi><mo>−</mo><mfrac><mrow><msub><mi>B</mi><mi>H</mi></msub><mo>+</mo><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub></mrow><mrow><mi>C</mi><mo>−</mo><msub><mi>R</mi><mi>H</mi></msub></mrow></mfrac><mo fence="true">]</mo></mrow><mo>+</mo></msup><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">\beta_k(t) = \bigl[\,C t - L_{lo} - B_H - R_H t\,\bigr]^+ = (C - R_H)\left[t - \frac{B_H + L_{lo}}{C - R_H}\right]^+ .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0528em">β</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0528em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mopen">(</span><span class="mord mathnormal">t</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1.2em;vertical-align:-0.35em"></span><span class="mopen"><span class="delimsizing size1">[</span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:1.3612em;vertical-align:-0.35em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mclose"><span class="mclose"><span class="delimsizing size1">]</span></span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:1.0112em"><span style="top:-3.3029em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mopen">(</span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:2.5613em;vertical-align:-0.95em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mclose">)</span><span class="mspace" style="margin-right:0.1667em"></span><span class="minner"><span class="minner"><span class="mopen delimcenter" style="top:0em"><span class="delimsizing size3">[</span></span><span class="mord mathnormal">t</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3603em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.836em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mclose delimcenter" style="top:0em"><span class="delimsizing size3">]</span></span></span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:1.6112em"><span style="top:-3.9029em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mbin mtight">+</span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord">.</span></span></span></span></span>
<p>Since frames inside a class are served FIFO, the delay bound of the class aggregate, plus a processing delay <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>t</mi><mrow><mi>p</mi><mi>r</mi><mi>o</mi><mi>c</mi></mrow></msub></mrow><annotation encoding="application/x-tex">t_{proc}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.9012em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">p</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mord mathnormal mtight">oc</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span></span></span></span>, bounds the delay of every frame of class <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0315em">k</span></span></span></span>:</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>d</mi><mi>k</mi></msub><mo>=</mo><mfrac><mrow><msub><mi>B</mi><mi>H</mi></msub><mo>+</mo><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub><mo>+</mo><msub><mi>B</mi><mi>k</mi></msub></mrow><mrow><mi>C</mi><mo>−</mo><msub><mi>R</mi><mi>H</mi></msub></mrow></mfrac><mo>+</mo><msub><mi>t</mi><mrow><mi>p</mi><mi>r</mi><mi>o</mi><mi>c</mi></mrow></msub><mo separator="true">,</mo><mspace width="2em"></mspace><msub><mi>R</mi><mi>H</mi></msub><mo>+</mo><msub><mi>R</mi><mi>k</mi></msub><mo>≤</mo><mi>C</mi><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">d_k = \frac{B_H + L_{lo} + B_k}{C - R_H} + t_{proc}, \qquad R_H + R_k \le C .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal">d</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.1963em;vertical-align:-0.836em"></span><span class="mord"><span class="mopen nulldelimiter"></span><span class="mfrac"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.3603em"><span style="top:-2.314em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span><span style="top:-3.23em"><span class="pstrut" style="height:3em"></span><span class="frac-line" style="border-bottom-width:0.04em"></span></span><span style="top:-3.677em"><span class="pstrut" style="height:3em"></span><span class="mord"><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0502em">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.836em"><span></span></span></span></span></span><span class="mclose nulldelimiter"></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.9694em;vertical-align:-0.2861em"></span><span class="mord"><span class="mord mathnormal">t</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">p</span><span class="mord mathnormal mtight" style="margin-right:0.0278em">r</span><span class="mord mathnormal mtight">oc</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.2861em"><span></span></span></span></span></span></span><span class="mpunct">,</span><span class="mspace" style="margin-right:2em"></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord">.</span></span></span></span></span>
<p>This is the per-hop formula used in the companion admission-control repository [4]. The stability condition <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>R</mi><mi>H</mi></msub><mo>+</mo><msub><mi>R</mi><mi>k</mi></msub><mo>≤</mo><mi>C</mi></mrow><annotation encoding="application/x-tex">R_H + R_k \le C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3283em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0813em">H</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0077em">R</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:-0.0077em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span> must hold at every port.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-from-one-node-to-a-network">4. From one node to a network<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#4-from-one-node-to-a-network" class="hash-link" aria-label="Direct link to 4. From one node to a network" title="Direct link to 4. From one node to a network" translate="no">​</a></h2>
<p>Two families of methods extend these results to a network of switches.</p>
<p><strong>Total Flow Analysis (TFA).</strong> At each port, bound the delay of each class aggregate with the formula above. Propagate the bursts downstream with the output-burst rule of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">the fundamental bounds post</a>, <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mi>b</mi><mo mathvariant="normal" lspace="0em" rspace="0em">′</mo></msup><mo>=</mo><mi>b</mi><mo>+</mo><mi>r</mi><mtext> </mtext><msub><mi>d</mi><mi>k</mi></msub></mrow><annotation encoding="application/x-tex">b' = b + r\,d_k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7519em"></span><span class="mord"><span class="mord mathnormal">b</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.7519em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">′</span></span></span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.0833em"></span><span class="mord mathnormal">b</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8444em;vertical-align:-0.15em"></span><span class="mord mathnormal" style="margin-right:0.0278em">r</span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal">d</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>, and sum the per-hop bounds along each path:</p>
<span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>D</mi><mo>=</mo><munder><mo>∑</mo><mrow><mi>h</mi><mo>∈</mo><mi mathvariant="script">P</mi></mrow></munder><msubsup><mi>d</mi><mi>k</mi><mrow><mo stretchy="false">(</mo><mi>h</mi><mo stretchy="false">)</mo></mrow></msubsup><mi mathvariant="normal">.</mi></mrow><annotation encoding="application/x-tex">D = \sum_{h \in \mathcal{P}} d_k^{(h)} .</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em"></span><span class="mord mathnormal" style="margin-right:0.0278em">D</span><span class="mspace" style="margin-right:0.2778em"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em"></span></span><span class="base"><span class="strut" style="height:2.3795em;vertical-align:-1.3295em"></span><span class="mop op-limits"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.05em"><span style="top:-1.8479em;margin-left:0em"><span class="pstrut" style="height:3.05em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">h</span><span class="mrel mtight">∈</span><span class="mord mathcal mtight" style="margin-right:0.0822em">P</span></span></span></span><span style="top:-3.05em"><span class="pstrut" style="height:3.05em"></span><span><span class="mop op-symbol large-op">∑</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:1.3295em"><span></span></span></span></span></span><span class="mspace" style="margin-right:0.1667em"></span><span class="mord"><span class="mord mathnormal">d</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:1.0448em"><span style="top:-2.3987em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight" style="margin-right:0.0315em">k</span></span></span><span style="top:-3.2198em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mopen mtight">(</span><span class="mord mathnormal mtight">h</span><span class="mclose mtight">)</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.3013em"><span></span></span></span></span></span></span><span class="mord">.</span></span></span></span></span>
<p>TFA is simple, scales well, and is easy to update incrementally when a flow is added, because only the ports on the new flow's path, and those downstream of them, are affected. Its weakness is that it pays bursts at every hop.</p>
<p><strong>Path-based analyses.</strong> Separated Flow Analysis (SFA) computes a residual service curve per hop and concatenates them, gaining PBOO. PMOO-style and linear-programming analyses go further by accounting for each cross flow only once. They are tighter but more expensive, and less naturally incremental.</p>
<p><strong>Cyclic dependencies.</strong> When routes form cycles, the bursts entering a port depend on delays that depend on those same bursts. TFA then becomes a fixed-point problem; a finite bound exists only under sufficiently low load, and solving it requires iteration.</p>
<table><thead><tr><th>Method</th><th>Tightness</th><th>Cost</th><th>Incremental update</th></tr></thead><tbody><tr><td>TFA</td><td>Lowest</td><td>Low</td><td>Natural</td></tr><tr><td>SFA</td><td>Better (PBOO)</td><td>Moderate</td><td>Possible</td></tr><tr><td>PMOO / LP-based</td><td>Best</td><td>High</td><td>Difficult</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>Network Calculus: Guaranteed performance analysis in networks</em>, LINCS seminar. <a href="https://www.youtube.com/watch?v=1funUBUL2II" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J.-Y. Le Boudec, P. Thiran, <em>Network Calculus</em>, LNCS 2050, Springer, 2001, Chapter 6. <a href="https://leboudec.github.io/netcal/" target="_blank" rel="noopener noreferrer" class="">Online edition</a></li>
<li class="">A. Bouillard, M. Boyer, E. Le Corronc, <em>Deterministic Network Calculus</em>, Wiley-ISTE, 2018.</li>
<li class="">A. Bouillard, <em>panco: Performance Analysis with Network Calculus and Optimization</em>, 2022. <a href="https://github.com/anne-bou/panco" target="_blank" rel="noopener noreferrer" class="">GitHub</a></li>
<li class="">CNAM-ECE, <em>Certified Admission Control for TSN</em>. <a href="https://github.com/CNAM-ECE/network-calculus" target="_blank" rel="noopener noreferrer" class="">GitHub</a></li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Book</category>
            <category>Network calculus</category>
            <category>TSN</category>
        </item>
        <item>
            <title><![CDATA[Network calculus for TSN shapers]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn</guid>
            <pubDate>Tue, 06 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How the Time-Aware Shaper, Credit-Based Shaper, Asynchronous Traffic Shaper, policing and redundancy are modelled with arrival and service curves, and which tools implement the analyses.]]></description>
            <content:encoded><![CDATA[<p>The previous posts developed a general theory. This post maps each <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> mechanism onto the objects of that theory: which mechanisms create <em>service curves</em>, which enforce <em>arrival curves</em>, and which modify burstiness along a path.</p>
<!-- -->
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->4<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-ATS"><td><a href="https://1.ieee802.org/tsn/802-1qcr/"><b>ATS</b></a></td><td>Asynchronous Traffic Shaping</td><td>IEEE 802.1Qcr: per-stream token-bucket shaping at every hop using local clocks only.</td></tr><tr id="abbr-AVB"><td><a href="https://www.ieee802.org/1/pages/avbridges.html"><b>AVB</b></a></td><td>Audio Video Bridging</td><td>The predecessor of TSN: gPTP, the credit-based shaper and stream reservation, combined for audio and video (profile: IEEE 802.1BA).</td></tr><tr id="abbr-CBS"><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/"><b>CBS</b></a></td><td>Credit-Based Shaper</td><td>The IEEE 802.1Qav shaper that limits a traffic class to its reserved rate (idleSlope) with a per-queue credit. In MEF bandwidth profiles, CBS instead means Committed Burst Size.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-a-mapping-table">1. A mapping table<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#1-a-mapping-table" class="hash-link" aria-label="Direct link to 1. A mapping table" title="Direct link to 1. A mapping table" translate="no">​</a></h2>
<table><thead><tr><th>Mechanism</th><th>Standard</th><th>Network calculus object</th><th>Effect on analysis</th></tr></thead><tbody><tr><td>Strict priority, non-preemptive</td><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">802.1Q</a></td><td>Residual service curve per class</td><td>Blocking term <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>L</mi><mrow><mi>l</mi><mi>o</mi></mrow></msub><mi mathvariant="normal">/</mi><mi>C</mi></mrow><annotation encoding="application/x-tex">L_{lo}/C</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3361em"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight" style="margin-right:0.0197em">l</span><span class="mord mathnormal mtight">o</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span><span class="mord">/</span><span class="mord mathnormal" style="margin-right:0.0715em">C</span></span></span></span> (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">the multiplexing post</a>)</td></tr><tr><td>Time-Aware Shaper</td><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">802.1Qbv</a></td><td>Periodic service curve per gated queue</td><td>Rate <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>C</mi><mi>w</mi><mi mathvariant="normal">/</mi><mi>c</mi></mrow><annotation encoding="application/x-tex">Cw/c</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em"></span><span class="mord mathnormal" style="margin-right:0.0715em">C</span><span class="mord mathnormal" style="margin-right:0.0269em">w</span><span class="mord">/</span><span class="mord mathnormal">c</span></span></span></span>, <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> up to <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>c</mi><mo>−</mo><mi>w</mi></mrow><annotation encoding="application/x-tex">c - w</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em"></span><span class="mord mathnormal">c</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal" style="margin-right:0.0269em">w</span></span></span></span> (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/service-curves">the service curves post</a>)</td></tr><tr><td>Credit-Based Shaper</td><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/" target="_blank" rel="noopener noreferrer" class="">802.1Qav</a></td><td>Rate-latency service curve per <a href="https://www.ieee802.org/1/pages/avbridges.html" target="_blank" rel="noopener noreferrer" class="">AVB</a> class</td><td>Rate set by the idle slope</td></tr><tr><td>Asynchronous Traffic Shaper</td><td><a href="https://1.ieee802.org/tsn/802-1qcr/" target="_blank" rel="noopener noreferrer" class="">802.1Qcr</a></td><td>Interleaved regulator (shaper)</td><td>Resets burstiness at each hop</td></tr><tr><td>Per-Stream Filtering and <a href="https://en.wikipedia.org/wiki/Traffic_policing_(communications)" target="_blank" rel="noopener noreferrer" class="">Policing</a></td><td><a href="https://1.ieee802.org/tsn/802-1qci/" target="_blank" rel="noopener noreferrer" class="">802.1Qci</a></td><td>Enforced arrival curve</td><td>Makes the input contract hold</td></tr><tr><td>Frame Replication and Elimination</td><td><a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a></td><td>Merge of redundant paths</td><td>Can increase burstiness</td></tr><tr><td>Time synchronisation</td><td><a href="https://1.ieee802.org/tsn/802-1as-2020/" target="_blank" rel="noopener noreferrer" class="">802.1AS</a></td><td>Bounded clock error</td><td>Enters as a <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">jitter</a> term</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-time-aware-shaper">2. Time-Aware Shaper<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#2-time-aware-shaper" class="hash-link" aria-label="Direct link to 2. Time-Aware Shaper" title="Direct link to 2. Time-Aware Shaper" translate="no">​</a></h2>
<p>For flows that are <em>scheduled</em>, i.e. whose emission times are synchronised with the gate control lists, the delay is determined by the schedule itself and <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> is not needed for them. It becomes necessary in three situations:</p>
<ol>
<li class="">for traffic that shares the scheduled port but is not itself scheduled, which receives the <em>residual</em> of the gate schedule;</li>
<li class="">for scheduled traffic whose emission is not perfectly aligned, for instance because of clock error or application jitter;</li>
<li class="">when one wants a schedule-independent guarantee that survives a modification of the schedule, a question central to reconfiguration (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn">the reconfiguration post</a>).</li>
</ol>
<p>In each case, the gate schedule of a queue translates into a periodic strict service curve, which can be lower-bounded by a rate-latency curve as derived in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/service-curves">the service curves post</a>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-credit-based-shaper">3. Credit-Based Shaper<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#3-credit-based-shaper" class="hash-link" aria-label="Direct link to 3. Credit-Based Shaper" title="Direct link to 3. Credit-Based Shaper" translate="no">​</a></h2>
<p>The Credit-Based Shaper of AVB limits each class to a configured <em>idle slope</em>. Its network calculus model gives each shaped class a rate-latency service curve whose rate is the idle slope and whose latency accounts for the interference of other classes. The shaper also bounds the <em>output</em> burstiness of the class, which keeps per-hop bursts from growing without limit. Zhao, Pop, Zheng and Li derived timing analyses for AVB traffic in TSN networks with this approach [3]; Mohammadpour et al. combined CBS with ATS [4].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-asynchronous-traffic-shaper">4. Asynchronous Traffic Shaper<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#4-asynchronous-traffic-shaper" class="hash-link" aria-label="Direct link to 4. Asynchronous Traffic Shaper" title="Direct link to 4. Asynchronous Traffic Shaper" translate="no">​</a></h2>
<p>ATS (802.1Qcr) places <em>interleaved regulators</em> at each hop. An interleaved regulator processes the frames of several flows in a single FIFO queue and releases the head frame only when that frame's own flow is conformant with its arrival curve. Le Boudec proved that an interleaved regulator placed after a FIFO system does not increase the worst-case delay of that system: the "shaping for free" property of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">the arrival curves post</a> extends to interleaved regulators [5]. In consequence, the arrival curve of every flow is restored to its initial value at every hop, which eliminates burst propagation and breaks the cyclic dependencies discussed in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">the multiplexing post</a>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-policing-and-redundancy">5. Policing and redundancy<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#5-policing-and-redundancy" class="hash-link" aria-label="Direct link to 5. Policing and redundancy" title="Direct link to 5. Policing and redundancy" translate="no">​</a></h2>
<p>Every network calculus bound is conditional on its arrival curves. <strong>802.1Qci</strong> policers make the conditions hold in the field by discarding or marking frames that violate their declared contract; without them, a single misbehaving talker can invalidate the guarantees of every other flow.</p>
<p><strong>802.1CB</strong> replicates frames over disjoint paths and eliminates duplicates near the destination. The elimination function outputs the first copy of each frame, so the merged stream can be burstier than either path's output when the paths have different delays. Thomas, Mifdaoui and Le Boudec analysed this effect and showed that it must be accounted for, for instance by re-shaping after elimination [6].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-tools">6. Tools<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#6-tools" class="hash-link" aria-label="Direct link to 6. Tools" title="Direct link to 6. Tools" translate="no">​</a></h2>
<table><thead><tr><th>Tool</th><th>Scope</th><th>Link</th></tr></thead><tbody><tr><td>DiscoDNC</td><td>Java library; TFA, SFA, PMOO and tandem analyses for feed-forward networks</td><td><a href="https://github.com/NetCal/DNC" target="_blank" rel="noopener noreferrer" class="">NetCal/DNC</a></td></tr><tr><td>panco</td><td>Python; TFA, SFA and linear-programming analyses for FIFO networks</td><td><a href="https://github.com/anne-bou/panco" target="_blank" rel="noopener noreferrer" class="">anne-bou/panco</a></td></tr><tr><td>Nancy</td><td>C# library for min-plus operations on piecewise-affine curves</td><td><a href="https://github.com/rzippo/nancy" target="_blank" rel="noopener noreferrer" class="">rzippo/nancy</a></td></tr><tr><td>tsnkit</td><td>Python; implementations and benchmarks of 802.1Qbv scheduling algorithms</td><td><a href="https://github.com/ChuanyuXue/tsnkit" target="_blank" rel="noopener noreferrer" class="">ChuanyuXue/tsnkit</a></td></tr></tbody></table>
<p>Cross-checking an analysis against an independent tool is a cheap form of validation. The companion repository on certified <a href="https://en.wikipedia.org/wiki/Admission_control" target="_blank" rel="noopener noreferrer" class="">admission control</a> compares its TFA bounds against panco and reports a relative difference of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2.5</mn><mo>×</mo><msup><mn>10</mn><mrow><mo>−</mo><mn>16</mn></mrow></msup></mrow><annotation encoding="application/x-tex">2.5 \times 10^{-16}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">2.5</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">16</span></span></span></span></span></span></span></span></span></span></span></span> per hop [7].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>Networks and Calculus</em>, Prof. Jean-Yves Le Boudec, EPFL. <a href="https://www.youtube.com/watch?v=NpoqqPM4LYA" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
<li class=""><em>Network Calculus: Guaranteed performance analysis in networks</em>, LINCS seminar. <a href="https://www.youtube.com/watch?v=1funUBUL2II" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">IEEE Std 802.1Q, <em>Bridges and Bridged Networks</em> (incorporating 802.1Qav, 802.1Qbv, 802.1Qci and 802.1Qcr).</li>
<li class="">IEEE Std 802.1CB, <em>Frame Replication and Elimination for Reliability</em>.</li>
<li class="">L. Zhao, P. Pop, Z. Zheng, Q. Li, "Timing Analysis of AVB Traffic in TSN Networks Using Network Calculus," IEEE RTAS 2018.</li>
<li class="">E. Mohammadpour, E. Stai, M. Mohiuddin, J.-Y. Le Boudec, "Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping," ITC 30, 2018.</li>
<li class="">J.-Y. Le Boudec, "A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators," <em>IEEE/ACM Transactions on Networking</em>, 26(6), 2018.</li>
<li class="">L. Thomas, A. Mifdaoui, J.-Y. Le Boudec, "Worst-Case Delay Bounds in Time-Sensitive Networks With Packet Replication and Elimination," <em>IEEE/ACM Transactions on Networking</em>, 2022.</li>
<li class="">CNAM-ECE, <em>Certified Admission Control for TSN</em>. <a href="https://github.com/CNAM-ECE/network-calculus" target="_blank" rel="noopener noreferrer" class="">GitHub</a></li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Article</category>
            <category>Network calculus</category>
            <category>TSN</category>
            <category>TAS</category>
        </item>
        <item>
            <title><![CDATA[Dynamic reconfiguration of TSN: where network calculus fits]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn</guid>
            <pubDate>Wed, 07 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[A reading of two recent approaches to TSN reconfiguration, SDN-based path migration and resilient Time-Aware Shaper schedules, and the role of network calculus as a certificate.]]></description>
            <content:encoded><![CDATA[<p>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 <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> is the natural tool to <em>certify</em> a reconfiguration, whatever method proposes it.</p>
<!-- -->
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->3<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-SDN"><td><a href="https://www.rfc-editor.org/rfc/rfc7426"><b>SDN</b></a></td><td>Software-Defined Networking</td><td>An architecture that separates the control plane, run by a logically centralised controller, from the data plane of the network elements (RFC 7426).</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-why-reconfigure">1. Why reconfigure?<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#1-why-reconfigure" class="hash-link" aria-label="Direct link to 1. Why reconfigure?" title="Direct link to 1. Why reconfigure?" translate="no">​</a></h2>
<p>Three situations force a <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> configuration to change after deployment:</p>
<ol>
<li class=""><strong>New flows.</strong> A production cell is extended and new streams request admission.</li>
<li class=""><strong>Resource fragmentation.</strong> Flows admitted early occupy paths and windows that later prevent better placements.</li>
<li class=""><strong>Faults.</strong> A link or <a href="https://en.wikipedia.org/wiki/Network_bridge" target="_blank" rel="noopener noreferrer" class="">bridge</a> fails permanently and the flows that crossed it must be rerouted.</li>
</ol>
<p>In each case two problems arise: <em>finding</em> a new configuration (routes, priorities, gate schedules), and <em>verifying</em> that it, and the transition towards it, preserve every deadline.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-sdn-based-dynamic-path-reconfiguration">2. SDN-based dynamic path reconfiguration<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#2-sdn-based-dynamic-path-reconfiguration" class="hash-link" aria-label="Direct link to 2. SDN-based dynamic path reconfiguration" title="Direct link to 2. SDN-based dynamic path reconfiguration" translate="no">​</a></h2>
<p>Sertbaş Bülbül, Ergenç and Fischer address problems 1 and 2 with a centralised <a href="https://www.rfc-editor.org/rfc/rfc7426" target="_blank" rel="noopener noreferrer" class="">SDN controller</a> [1, 2]. A talker advertises the requirements of a new flow; a path computation element in the controller computes a route, possibly migrating existing flows to free capacity, and installs forwarding rules before confirming the reservation to the talker. This is close to the fully centralised configuration model of <a href="https://1.ieee802.org/tsn/802-1qcc/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qcc</a>.</p>
<p>The path computation is formulated as a mixed-integer linear program, the <strong>time-sensitive optimal routing</strong> (TSOR) problem. Binary variables assign demands to paths; continuous variables <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>g</mi><mrow><mi>e</mi><mi>s</mi></mrow></msub></mrow><annotation encoding="application/x-tex">g_{es}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">es</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span> give the fraction of time the gate of class <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>s</mi></mrow><annotation encoding="application/x-tex">s</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">s</span></span></span></span> is open on link <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>e</mi></mrow><annotation encoding="application/x-tex">e</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em"></span><span class="mord mathnormal">e</span></span></span></span>. The end-to-end <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a> of a path is modelled as a sum over its links of a base delay plus a queueing term proportional to <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>1</mn><mo>−</mo><msub><mi>g</mi><mrow><mi>e</mi><mi>s</mi></mrow></msub></mrow><annotation encoding="application/x-tex">1 - g_{es}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">1</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.0359em">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathnormal mtight">es</span></span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em"><span></span></span></span></span></span></span></span></span></span>. Four strategies differ in how much of the existing assignment may change:</p>
<table><thead><tr><th>Strategy</th><th>Reconfiguration policy</th><th>Acceptance ratio</th><th>Delayed-frame ratio</th><th>Configuration time</th></tr></thead><tbody><tr><td>TSOR</td><td>Existing flows never moved</td><td>49.2 %</td><td>5.83 %</td><td>17 µs</td></tr><tr><td>TSOR-P</td><td>Full re-optimisation every <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>k</mi></mrow><annotation encoding="application/x-tex">k</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em"></span><span class="mord mathnormal" style="margin-right:0.0315em">k</span></span></span></span> requests</td><td>51.18 %</td><td>4.94 %</td><td>63.7 µs</td></tr><tr><td>TSOR-T</td><td>Re-optimisation when a quality threshold is exceeded</td><td>51.93 %</td><td>4.47 %</td><td>137.4 µs</td></tr><tr><td>TSOR-U</td><td>Full re-optimisation at every request</td><td>52.81 %</td><td>5.41 %</td><td>189 µs</td></tr></tbody></table>
<p><em>Values from the OMNeT++ evaluation on the Integra topology reported in [2]. Configuration time excludes MILP solving, which the authors report at about 7.3 s for 100 flows from scratch versus about 4 ms for incremental TSOR.</em></p>
<p>Two observations are relevant here.</p>
<ul>
<li class="">Periodic or threshold-triggered reconfiguration accepts more flows than never reconfiguring, at a moderate configuration cost.</li>
<li class="">The <strong>delayed-frame ratio is non-zero for every strategy.</strong> The latency constraint in TSOR is a linear surrogate, not a worst-case bound, so a configuration accepted by the optimiser can still produce frames that miss their deadline. This is precisely the gap a network calculus certificate closes.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-a-resilient-time-aware-shaper-configuration">3. A resilient Time-Aware Shaper configuration<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#3-a-resilient-time-aware-shaper-configuration" class="hash-link" aria-label="Direct link to 3. A resilient Time-Aware Shaper configuration" title="Direct link to 3. A resilient Time-Aware Shaper configuration" translate="no">​</a></h2>
<p>Boyer (ONERA) and Henia (Thales) address problem 3, permanent link faults, for networks scheduled with the Time-Aware Shaper [3]. Their observation is that finding a new route is easy, whereas allocating real-time resources on that route is hard, especially within a short reaction time. They also argue for <em>incremental</em> reconfiguration: the windows of flows unaffected by the fault should not move, because applications are synchronised with the network schedule.</p>
<p>Their scheme, <strong>WPEx</strong>, combines three ideas:</p>
<ol>
<li class=""><strong>Window precedence exclusion.</strong> A sending window and a receiving window never overlap, so all frames are enqueued before the window opens. This makes the schedule immune to frame losses.</li>
<li class=""><strong>Window enlargement.</strong> Windows are made as large as possible, leaving slack that can later host rescue flows.</li>
<li class=""><strong>Protective gating.</strong> Lower-priority gates are closed only at the <em>start</em> of protected windows, so unused window time returns to lower-priority traffic.</li>
</ol>
<p>An initial WPEx-compatible schedule is computed with a constraint solver (IBM CPLEX) and post-processed (windows spread over the hyper-period, enlarged, and empty windows added on lightly loaded links). On a fault, the resources of broken flows are freed and each one is tried on candidate rescue paths by inserting its frame into existing windows; the rescue computation takes under one second, and <strong>no gate control list needs to be updated</strong>, which removes the coherency problem of changing schedules on several bridges at once.</p>
<p>The slides report the share of class-6 and class-7 flows that obtain a rescue schedule, given that a rescue path exists:</p>
<table><thead><tr><th>Post-processing</th><th>Single fault, class 6</th><th>Single fault, class 7</th><th>Double fault, class 6</th><th>Double fault, class 7</th></tr></thead><tbody><tr><td>CPLEX only</td><td>0.00 %</td><td>0.00 %</td><td>0.00 %</td><td>0.00 %</td></tr><tr><td>Enlarge</td><td>12.20 %</td><td>9.09 %</td><td>25.68 %</td><td>9.17 %</td></tr><tr><td>Add windows</td><td>19.51 %</td><td>9.09 %</td><td>22.04 %</td><td>8.97 %</td></tr><tr><td>Enlarge then add</td><td>31.71 %</td><td>33.33 %</td><td>43.38 %</td><td>30.48 %</td></tr><tr><td>Add then enlarge</td><td>43.90 %</td><td>24.24 %</td><td>48.15 %</td><td>23.94 %</td></tr></tbody></table>
<p><em>Table transcribed from the slide deck [3]; the authors state that performance is still under evaluation.</em></p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-synthesis-separating-the-proposer-from-the-verifier">4. Synthesis: separating the proposer from the verifier<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#4-synthesis-separating-the-proposer-from-the-verifier" class="hash-link" aria-label="Direct link to 4. Synthesis: separating the proposer from the verifier" title="Direct link to 4. Synthesis: separating the proposer from the verifier" translate="no">​</a></h2>
<p>The two contributions solve different problems with different tools: an MILP over paths and gate fractions, and a constraint-solved schedule with built-in slack. They share a structure: a <em>proposer</em> produces a candidate configuration quickly, and the network adopts it. Neither proposer, by itself, delivers a worst-case delay bound for the resulting configuration.</p>
<p>This suggests an architecture in which any proposer, whether an MILP, a heuristic, a constraint solver or a learned policy, is followed by a <strong>certified admission gate</strong>:</p>
<ol>
<li class="">The proposer suggests a change: a new flow, a migrated path, a rescue schedule.</li>
<li class="">The gate computes network calculus bounds for every flow affected by the change, using the arrival and service curves of the previous posts.</li>
<li class="">The change is committed only if every affected flow still meets its deadline; the gate emits a certificate (the curves and bounds) that an independent checker can verify.</li>
</ol>
<p>The companion repository [4] implements such a gate with incremental Total Flow Analysis under non-preemptive static priority. Its bounds agree with panco to within <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2.9</mn><mo>×</mo><msup><mn>10</mn><mrow><mo>−</mo><mn>6</mn></mrow></msup></mrow><annotation encoding="application/x-tex">2.9 \times 10^{-6}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em"></span><span class="mord">2.9</span><span class="mspace" style="margin-right:0.2222em"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em"></span></span><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">6</span></span></span></span></span></span></span></span></span></span></span></span> relative difference end to end, and an incremental update is about twice as fast as a full re-analysis, with median admission times of a few milliseconds in single-threaded Python.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-open-questions">5. Open questions<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#5-open-questions" class="hash-link" aria-label="Direct link to 5. Open questions" title="Direct link to 5. Open questions" translate="no">​</a></h2>
<ul>
<li class=""><strong>Transient states.</strong> A certificate for the old and the new configuration does not cover the <em>transition</em>, during which bridges may apply updates at different instants. WPEx avoids the issue by not changing gate control lists; path migration must address it explicitly.</li>
<li class=""><strong>Tightness versus speed.</strong> TFA is fast and incremental but pessimistic; tighter path-based analyses are costlier and harder to update incrementally (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">the multiplexing post</a>). Which analysis suits online admission is an empirical question.</li>
<li class=""><strong>Faults and redundancy.</strong> Rescue flows and <a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a> redundancy change burstiness along merged paths (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn">the TSN shapers post</a>); certificates must account for this.</li>
<li class=""><strong>Model validity.</strong> A certificate holds only as far as the network model does. Clock error, processing <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">jitter</a> and <a href="https://en.wikipedia.org/wiki/Traffic_policing_(communications)" target="_blank" rel="noopener noreferrer" class="">policing</a> configuration must be included in the model for the guarantee to transfer to the physical network.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<ul>
<li class=""><em>Networks and Calculus</em>, Prof. Jean-Yves Le Boudec, EPFL. <a href="https://www.youtube.com/watch?v=NpoqqPM4LYA" target="_blank" rel="noopener noreferrer" class="">YouTube</a>.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">N. Sertbaş Bülbül, D. Ergenç, M. Fischer, "Towards SDN-based Dynamic Path Reconfiguration for Time Sensitive Networking," IEEE/IFIP NOMS 2022. <a href="https://ieeexplore.ieee.org/document/9789890" target="_blank" rel="noopener noreferrer" class="">IEEE Xplore</a></li>
<li class="">N. Sertbaş Bülbül, D. Ergenç, M. Fischer, "Evaluating Dynamic Path Reconfiguration for Time Sensitive Networks," extended abstract, Würzburg Workshop WueWoWAS 2022. <a href="https://opus.bibliothek.uni-wuerzburg.de/files/28074/Sertbas_Buelbuel_et_al_Dynamic_Path_Reconfiguration_WueWoWas22_1570808763.pdf" target="_blank" rel="noopener noreferrer" class="">PDF</a></li>
<li class="">M. Boyer, R. Henia, "Designing a Resilient Time-Aware Shaper Configuration for TSN," Ethernet &amp; IP @ Automotive Technology Day, Toulouse, October 2025. <a href="https://standards.ieee.org/wp-content/uploads/2025/10/D1_09_Marc-Boyer-TSN-reconfiguration.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">CNAM-ECE, <em>Certified Admission Control for TSN</em>. <a href="https://github.com/CNAM-ECE/network-calculus" target="_blank" rel="noopener noreferrer" class="">GitHub</a></li>
<li class="">TSF Technology, "Migration vers TSN : guide pratique." <a href="https://tsf-technology.com/fr/ressources/guides-techniques/migration-tsn-guide-pratique" target="_blank" rel="noopener noreferrer" class="">Link</a></li>
</ol>]]></content:encoded>
            <category>YouTube</category>
            <category>Article</category>
            <category>Presentation</category>
            <category>Guide</category>
            <category>TSN</category>
            <category>SDN</category>
            <category>TAS</category>
            <category>Reconfiguration</category>
        </item>
        <item>
            <title><![CDATA[Deterministic networking in OSI 7-layer Architecture]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/deterministic-networking</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/deterministic-networking</guid>
            <pubDate>Mon, 16 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[What a deterministic service is, what it requires from a network, and how IEEE 802.1 TSN and IETF DetNet divide the work between Layer 2 and Layer 3.]]></description>
            <content:encoded><![CDATA[<p>"Deterministic networking" names a goal before it names a technology: a packet network that delivers selected flows within a bounded <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a>, 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.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 348" width="720" role="img" aria-label="The seven OSI layers, with IETF DetNet at the network layer, IEEE 802.1 TSN at the data link layer, and network calculus as the analysis applied to both"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><text x="95" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">OSI layer</text><text x="375" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Deterministic extension</text><text x="650" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Guarantee</text><g><g><rect x="20" y="34" width="150" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="95" y="53" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Application (L7)</text></g><path d="M170,53 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="78" width="150" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="95" y="97" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Presentation (L6)</text></g><path d="M170,97 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="122" width="150" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="95" y="141" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Session (L5)</text></g><path d="M170,141 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="166" width="150" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="95" y="185" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Transport (L4)</text></g><path d="M170,185 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="210" width="150" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="95" y="229" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Network (L3)</text></g><path d="M170,229 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="254" width="150" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="95" y="273" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Data link (L2)</text></g><path d="M170,273 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><g><rect x="20" y="298" width="150" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="95" y="317" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Physical (L1)</text></g><path d="M170,317 H230" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path></g><g><rect x="230" y="34" width="290" height="170" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="375" y="103.4" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">End-to-end functions (L4–L7)</text><text x="375" y="119" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">applications and transport protocols</text><text x="375" y="134.60000000000002" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">see a network with bounded latency</text></g><g><rect x="230" y="210" width="290" height="38" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="375" y="221.85" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IETF DetNet</text><text x="375" y="236.15" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">routed segments: IP, MPLS</text></g><g><rect x="230" y="254" width="290" height="38" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="375" y="265.85" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.1 TSN</text><text x="375" y="280.15000000000003" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">bridged segments: IEEE 802.1Q</text></g><g><rect x="230" y="298" width="290" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="375" y="317" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.3 Ethernet, IEEE 802.11, …</text></g><g><rect x="590" y="210" width="120" height="82" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="650" y="236.7" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Network calculus</text><text x="650" y="251" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">worst-case delay</text><text x="650" y="265.3" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">and backlog bounds</text></g><path d="M520,229 H590" fill="none" stroke="var(--nc-bound)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-muted)"></path><path d="M520,273 H590" fill="none" stroke="var(--nc-bound)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-muted)"></path></svg><figcaption>Figure 1. Deterministic networking extends the existing stack at two layers, where network calculus is the analysis applied to the configured result.<span class="nc-figure-source">Source: <!-- -->Inspiration from the IEEE 802 / OSI placement in J. Farkas,<!-- --> <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">IEEE 802.1 TSN TG Overview</a> (slide 4, 2018), and the scope stated in the <a href="https://datatracker.ietf.org/wg/detnet/about/">IETF DetNet charter</a>.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->29<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-AVB"><td><a href="https://www.ieee802.org/1/pages/avbridges.html"><b>AVB</b></a></td><td>Audio Video Bridging</td><td>The predecessor of TSN: gPTP, the credit-based shaper and stream reservation, combined for audio and video (profile: IEEE 802.1BA).</td></tr><tr id="abbr-CBS"><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/"><b>CBS</b></a></td><td>Credit-Based Shaper</td><td>The IEEE 802.1Qav shaper that limits a traffic class to its reserved rate (idleSlope) with a per-queue credit. In MEF bandwidth profiles, CBS instead means Committed Burst Size.</td></tr><tr id="abbr-CNC"><td><a href="https://1.ieee802.org/tsn/802-1qcc/"><b>CNC</b></a></td><td>Centralized Network Configuration</td><td>The 802.1Qcc entity that computes paths, schedules and reservations for the whole network and configures the bridges.</td></tr><tr id="abbr-CQF"><td><a href="https://1.ieee802.org/tsn/802-1qch/"><b>CQF</b></a></td><td>Cyclic Queuing and Forwarding</td><td>IEEE 802.1Qch: two queues per class alternate every cycle, so a frame advances one hop per cycle.</td></tr><tr id="abbr-DetNet"><td><a href="https://www.rfc-editor.org/rfc/rfc8655"><b>DetNet</b></a></td><td>Deterministic Networking</td><td>The IETF architecture and working group for bounded-latency, low-loss flows over IP and MPLS (RFC 8655).</td></tr><tr id="abbr-DiffServ"><td><a href="https://www.rfc-editor.org/rfc/rfc2475"><b>DiffServ</b></a></td><td>Differentiated Services</td><td>The IETF per-class QoS model, in which packets are marked at the edge and treated per class in the core (RFC 2475).</td></tr><tr id="abbr-DSCP"><td><a href="https://www.rfc-editor.org/rfc/rfc2474"><b>DSCP</b></a></td><td>Differentiated Services Code Point</td><td>The 6-bit field in the IP header that selects a DiffServ class (RFC 2474).</td></tr><tr id="abbr-FRER"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>FRER</b></a></td><td>Frame Replication and Elimination for Reliability</td><td>IEEE 802.1CB: frames are numbered, sent over disjoint paths, and duplicates are removed.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IETF"><td><a href="https://www.ietf.org/"><b>IETF</b></a></td><td>Internet Engineering Task Force</td><td>The body that develops Internet standards, published as RFCs.</td></tr><tr id="abbr-IntServ"><td><a href="https://www.rfc-editor.org/rfc/rfc1633"><b>IntServ</b></a></td><td>Integrated Services</td><td>The IETF per-flow QoS model with reservations in every router (RFC 1633).</td></tr><tr id="abbr-IP"><td><a href="https://www.rfc-editor.org/rfc/rfc791"><b>IP</b></a></td><td>Internet Protocol</td><td>The network-layer protocol of the Internet (IPv4, RFC 791; IPv6, RFC 8200).</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-IT"><td><b>IT</b></td><td>Information Technology</td><td>Computing and networking for information processing, such as office, business and cloud systems.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MPLS"><td><a href="https://www.rfc-editor.org/rfc/rfc3031"><b>MPLS</b></a></td><td>Multiprotocol Label Switching</td><td>Forwarding of packets on short labels along label-switched paths (RFC 3031).</td></tr><tr id="abbr-MPLSTE"><td><a href="https://www.rfc-editor.org/rfc/rfc2702"><b>MPLS-TE</b></a></td><td>MPLS Traffic Engineering</td><td>Use of MPLS paths with reserved bandwidth to steer traffic (RFC 2702).</td></tr><tr id="abbr-OSI"><td><b>OSI</b></td><td>Open Systems Interconnection</td><td>The seven-layer reference model for communication protocols (ISO/IEC 7498-1).</td></tr><tr id="abbr-QoS"><td><b>QoS</b></td><td>Quality of Service</td><td>The treatment a network gives to a flow or class, in terms of bandwidth, delay, jitter and loss.</td></tr><tr id="abbr-RFC"><td><a href="https://www.rfc-editor.org/"><b>RFC</b></a></td><td>Request for Comments</td><td>The document series in which IETF standards and related documents are published.</td></tr><tr id="abbr-RSVP"><td><a href="https://www.rfc-editor.org/rfc/rfc2205"><b>RSVP</b></a></td><td>Resource Reservation Protocol</td><td>The IntServ signalling protocol that reserves resources per flow (RFC 2205).</td></tr><tr id="abbr-RSVPTE"><td><a href="https://www.rfc-editor.org/rfc/rfc3209"><b>RSVP-TE</b></a></td><td>Resource Reservation Protocol – Traffic Engineering</td><td>The signalling protocol that sets up MPLS paths with bandwidth reservations (RFC 3209).</td></tr><tr id="abbr-SDN"><td><a href="https://www.rfc-editor.org/rfc/rfc7426"><b>SDN</b></a></td><td>Software-Defined Networking</td><td>An architecture that separates the control plane, run by a logically centralised controller, from the data plane of the network elements (RFC 7426).</td></tr><tr id="abbr-TAS"><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/"><b>TAS</b></a></td><td>Time-Aware Shaper</td><td>IEEE 802.1Qbv scheduled traffic: a gate per queue, opened and closed by a repeating gate control list.</td></tr><tr id="abbr-TCP"><td><a href="https://www.rfc-editor.org/rfc/rfc9293"><b>TCP</b></a></td><td>Transmission Control Protocol</td><td>A reliable, connection-oriented transport protocol with congestion control (RFC 9293).</td></tr><tr id="abbr-TEAS"><td><a href="https://datatracker.ietf.org/wg/teas/about/"><b>TEAS</b></a></td><td>Traffic Engineering Architecture and Signaling</td><td>The IETF working group responsible for MPLS-TE and RSVP-TE.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-UDP"><td><a href="https://www.rfc-editor.org/rfc/rfc768"><b>UDP</b></a></td><td>User Datagram Protocol</td><td>A connectionless transport protocol without congestion control (RFC 768).</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-ieee802-osi.png" alt="OSI reference model with IEEE 802 covering the data link and physical layers and IEEE 802.1 at the top of the data link layer" loading="lazy" style="max-width:min(100%, 300px)"><figcaption>Figure 1b. The original placement of IEEE 802 in the OSI reference model: IEEE 802 covers the physical and data link layers, with IEEE 802.1 at the top of the data link layer.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 4<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>A <strong>deterministic network</strong> carries, on shared packet infrastructure, flows whose end-to-end latency is bounded, whose <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">delay variation</a> is low, and whose loss is extremely low, while ordinary <a href="https://en.wikipedia.org/wiki/Best-effort_delivery" target="_blank" rel="noopener noreferrer" class="">best-effort</a> traffic continues to use the same links. The <a href="https://www.ietf.org/" target="_blank" rel="noopener noreferrer" class="">IETF</a> Deterministic Networking (<a href="https://www.rfc-editor.org/rfc/rfc8655" target="_blank" rel="noopener noreferrer" class="">DetNet</a>) working group describes its subject as deterministic data paths that run over Layer 2 bridged segments and Layer 3 routed segments and that can bound latency, loss, delay variation and reordering, with high reliability [1].</p>
<p>Nothing above the network layer changes. As Figure 1 shows, the extension happens at two existing layers:</p>
<ul>
<li class="">at <strong>Layer 2</strong>, the <a href="https://1.ieee802.org/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1</a> <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Time-Sensitive Networking</a> (TSN) task group extends bridged <a href="https://standards.ieee.org/ieee/802.3/10422/" target="_blank" rel="noopener noreferrer" class="">Ethernet</a> (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group">the IEEE 802.1 post</a> and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">the TSN toolbox post</a>);</li>
<li class="">at <strong>Layer 3</strong>, the IETF DetNet working group extends routed <a href="https://www.rfc-editor.org/rfc/rfc791" target="_blank" rel="noopener noreferrer" class="">IP</a> and <a href="https://www.rfc-editor.org/rfc/rfc3031" target="_blank" rel="noopener noreferrer" class="">MPLS</a> networks (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ietf-detnet">the IETF DetNet post</a>).</li>
</ul>
<p>The two groups collaborate on a common architecture, so that a routed deterministic path can cross bridged deterministic segments [1]. <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">Network calculus</a>, the subject of the next group of posts, is one of the common tool to successfully take the analysis that proves the bound once the network is configured in the industrial applications.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-deterministic-versus-traditional-service">2. Deterministic versus traditional service<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#2-deterministic-versus-traditional-service" class="hash-link" aria-label="Direct link to 2. Deterministic versus traditional service" title="Direct link to 2. Deterministic versus traditional service" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-deterministic-service.png" alt="Latency and loss distributions of a traditional and of a deterministic service" loading="lazy"><figcaption>Figure 2. Traditional versus deterministic service: buffers allocated against loss probability, end-to-end latency, and latency variation. A traditional service (left) has a good average and a long tail; a deterministic service (right) has no tail beyond the bound.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 4<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>A traditional packet service is engineered for a good average. Its latency distribution has a long tail, and the only ways to shorten the tail are to drop late packets or to over-provision. A deterministic service is specified differently [2]:</p>
<ul>
<li class="">packet loss is caused at most by equipment failure, never by <a href="https://en.wikipedia.org/wiki/Network_congestion" target="_blank" rel="noopener noreferrer" class="">congestion</a> ("zero congestion loss");</li>
<li class="">latency is bounded, so the distribution has no tail beyond the application's requirement;</li>
<li class="">the aim is the right packet at the right time, not the fastest packet on average.</li>
</ul>
<p>The reason standard equipment cannot offer this is that queuing in <a href="https://en.wikipedia.org/wiki/Network_switch" target="_blank" rel="noopener noreferrer" class="">switches</a> and <a href="https://en.wikipedia.org/wiki/Router_(computing)" target="_blank" rel="noopener noreferrer" class="">routers</a> is not controlled per flow: a burst from one source delays every other flow sharing the queue. Larger buffers reduce loss but lengthen the delay, which is the wrong trade for a <a href="https://en.wikipedia.org/wiki/Control_loop" target="_blank" rel="noopener noreferrer" class="">control loop</a> [3].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-what-a-deterministic-flow-requires">3. What a deterministic flow requires<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#3-what-a-deterministic-flow-requires" class="hash-link" aria-label="Direct link to 3. What a deterministic flow requires" title="Direct link to 3. What a deterministic flow requires" translate="no">​</a></h2>
<p>The DetNet problem statement, as summarised in [3], gives five requirements. They apply equally at Layer 2 and Layer 3.</p>
<table><thead><tr><th>Requirement</th><th>Meaning</th></tr></thead><tbody><tr><td>Time synchronisation</td><td>Every node(routers/switches) shares a time base, with an accuracy between nanoseconds and microseconds</td></tr><tr><td>Deterministic flows</td><td><a href="https://en.wikipedia.org/wiki/Unicast" target="_blank" rel="noopener noreferrer" class="">Unicast</a> or <a href="https://en.wikipedia.org/wiki/Multicast" target="_blank" rel="noopener noreferrer" class="">multicast</a>, with guaranteed minimum and maximum end-to-end latency(tighten jiter depending on its requirements), and loss ratio of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mn>10</mn><mrow><mo>−</mo><mn>9</mn></mrow></msup></mrow><annotation encoding="application/x-tex">10^{-9}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">9</span></span></span></span></span></span></span></span></span></span></span></span> to <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mn>10</mn><mrow><mo>−</mo><mn>12</mn></mrow></msup></mrow><annotation encoding="application/x-tex">10^{-12}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">12</span></span></span></span></span></span></span></span></span></span></span></span> on wired Ethernet and <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mn>10</mn><mrow><mo>−</mo><mn>5</mn></mrow></msup></mrow><annotation encoding="application/x-tex">10^{-5}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141em"></span><span class="mord">1</span><span class="mord"><span class="mord">0</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em"><span style="top:-3.063em;margin-right:0.05em"><span class="pstrut" style="height:2.7em"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mtight">−</span><span class="mord mtight">5</span></span></span></span></span></span></span></span></span></span></span></span> for mesh network, no throttling and no congestion feedback</td></tr><tr><td>Per-node scheduling</td><td>Each node schedules, shapes, limits and controls its transmissions (over-provisioning not required)</td></tr><tr><td>Protection</td><td>A misbehaving node or flow cannot degrade the others, even under high load</td></tr><tr><td>Reservation</td><td>Resources are reserved in every node that carries the flow</td></tr></tbody></table>
<p>Two points matter for the rest of this series. First, the source must declare a traffic contract: either a fixed transmission schedule, or a maximum bandwidth and a maximum packet size. That contract is exactly what an <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">arrival curve</a> formalises. Second, "no congestion feedback" means the guarantee cannot rely on sources slowing down, meanwhile it has to hold by construction.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-three-techniques">4. Three techniques<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#4-three-techniques" class="hash-link" aria-label="Direct link to 4. Three techniques" title="Direct link to 4. Three techniques" translate="no">​</a></h2>
<p>The DetNet architecture groups the mechanisms into three techniques, which can be used separately or together [4].</p>
<table><thead><tr><th>Technique</th><th>What it does</th><th>What it protects against</th></tr></thead><tbody><tr><td>Resource allocation</td><td>Reserves buffer space and link bandwidth for a flow, or an aggregate of flows, at each hop based on predefined max transmission rate and packet size. <a href="https://en.wikipedia.org/wiki/Traffic_policing_(communications)" target="_blank" rel="noopener noreferrer" class="">Traffic policing</a> and shaping functions at ingress ports limit data rates to mitigate packet out of scheduled time (next node additional buffer)</td><td>Loss caused by contention with unbounded end-to-end latency. Precise packet timestamps and sub-microsecond synchronization across network nodes enable low-latency, jitter-free communication, which is critical for audiovisual quality and deterministic industrial control applications</td></tr><tr><td>Service protection</td><td>Sends copies of each packet over several paths (sequence number &amp; timestamp to transport protocol) and removes duplicates with reordering packets, or adds redundancy &amp; error correction by packet encoding (multi-trans packet unit)</td><td>Loss caused by equipment or media failure, bandwidth constraint assurance &amp; delay equalization in failure recovery</td></tr><tr><td>Explicit routes</td><td>Fixes the path in advance, so that it does not change at once when the topology changes</td><td>Interruptions while routing or bridging protocols reconverge</td></tr></tbody></table>
<p>Resource allocation only works for a flow that is limited at the source in a specified packet size and rate [4]. Explicit routes can be installed with <a href="https://www.rfc-editor.org/rfc/rfc3209" target="_blank" rel="noopener noreferrer" class="">RSVP-TE</a>, <a href="https://www.rfc-editor.org/rfc/rfc8402" target="_blank" rel="noopener noreferrer" class="">Segment Routing</a>, <a href="https://www.rfc-editor.org/rfc/rfc1195" target="_blank" rel="noopener noreferrer" class="">IS-IS</a> or a centralised <a href="https://www.rfc-editor.org/rfc/rfc7426" target="_blank" rel="noopener noreferrer" class="">SDN controller</a> [3][4]. In this context, mesh network topology changes can disrupt traffic and cause out-of-order packet delivery (side effect). Meanwhile, real-time networks often use redundant ring topologies, increasing hop count and latency. DetNet instead uses predefined, stable routes to avoid immediate reconfiguration and interruptions caused by routing or bridging convergence.</p>
<figure class="nc-figure"><svg viewBox="0 0 720 210" width="720" role="img" aria-label="A flow replicated over two disjoint paths and merged again with duplicate elimination"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="10" y="83" width="100" height="44" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="60" y="105" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">End system</text></g><g><rect x="160" y="83" width="110" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="215" y="96.55" font-size="13" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay node</text><text x="215" y="113.45" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">replicate</text></g><g><rect x="310" y="20" width="100" height="40" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="40" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">path 1</text></g><g><rect x="310" y="150" width="100" height="40" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="170" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">path 2</text></g><g><rect x="450" y="83" width="110" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="505" y="96.55" font-size="13" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay node</text><text x="505" y="113.45" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">eliminate</text></g><g><rect x="610" y="83" width="100" height="44" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="660" y="105" font-size="13" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">End system</text></g><path d="M110,105 H160" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><path d="M215,83 V40 H310" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path><path d="M215,127 V170 H310" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path><path d="M410,40 H505 V83" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path><path d="M410,170 H505 V127" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path><path d="M560,105 H610" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="135" y="92" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">3 2 1</text><text x="262" y="28" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">3 2 1</text><text x="262" y="182" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">3 2 1</text><text x="585" y="92" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">3 2 1</text><text x="360" y="98" font-size="11.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">one copy per path:</text><text x="360" y="114" font-size="11.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">one failure, no loss</text></svg><figcaption>Figure 3. Service protection by packet replication and elimination: packets carry a sequence number, travel over disjoint paths, and duplicates are discarded before delivery.<span class="nc-figure-source">Source: <!-- -->simplified from N. Finn, P. Thubert, B. Varga, J. Farkas,<!-- --> <a href="https://www.rfc-editor.org/rfc/rfc8655" target="_blank" rel="noopener noreferrer" class="">RFC 8655</a>,<!-- --> <em>Deterministic Networking Architecture</em>, October 2019, Figure 1.</span></figcaption></figure>
<p>When the paths have different lengths, the merging node needs extra buffering to remove duplicates and restore the order [3]. This matters for analysis: a merged flow is burstier than either copy, a point taken up again in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/network-calculus-for-tsn">the TSN shapers post</a>.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-who-does-what">5. Who does what<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#5-who-does-what" class="hash-link" aria-label="Direct link to 5. Who does what" title="Direct link to 5. Who does what" translate="no">​</a></h2>
<table><thead><tr><th></th><th>IEEE 802.1 TSN</th><th>IETF DetNet</th></tr></thead><tbody><tr><td>Layer</td><td>2, bridged networks</td><td>3, routed networks</td></tr><tr><td>Data plane</td><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Q</a> <a href="https://en.wikipedia.org/wiki/Network_bridge" target="_blank" rel="noopener noreferrer" class="">bridges</a> over <a href="https://www.ieee802.org/" target="_blank" rel="noopener noreferrer" class="">IEEE 802</a> media</td><td>IP and MPLS, and Layer 2 encapsulations carried over them</td></tr><tr><td>Scope</td><td>IEEE 802 networks</td><td>Networks under a single administrative control, such as campus networks and private WANs</td></tr><tr><td>Flow terminology</td><td>Talker, Listener, Stream</td><td>Source, destination, flow</td></tr><tr><td>Queuing mechanisms</td><td>Defined here: shapers, gates, preemption</td><td>Reused from the sub-network; DetNet focuses on the data path</td></tr></tbody></table>
<p>The terminology row follows the mapping given in the DetNet architecture [4]; the scope row follows the DetNet charter, which explicitly excludes solutions for large groups of domains such as the Internet [1].</p>
<h3 class="anchor anchorTargetStickyNavbar_bCYu" id="traffic-engineering-from-a-detnet-flow-to-tsn-settings">Traffic engineering: from a DetNet flow to TSN settings<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#traffic-engineering-from-a-detnet-flow-to-tsn-settings" class="hash-link" aria-label="Direct link to Traffic engineering: from a DetNet flow to TSN settings" title="Direct link to Traffic engineering: from a DetNet flow to TSN settings" translate="no">​</a></h3>
<p>The two efforts meet where a routed DetNet path crosses a bridged TSN segment. What connects them is <a href="https://en.wikipedia.org/wiki/Traffic_engineering_(telecommunications)" target="_blank" rel="noopener noreferrer" class="">traffic engineering</a>, and its protocols come from the IETF. The <a href="https://datatracker.ietf.org/wg/teas/about/" target="_blank" rel="noopener noreferrer" class="">Traffic Engineering Architecture and Signaling (TEAS)</a> working group maintains <a href="https://www.rfc-editor.org/rfc/rfc2702" target="_blank" rel="noopener noreferrer" class="">MPLS-TE</a> <a href="https://en.wikipedia.org/wiki/Label-switched_path" target="_blank" rel="noopener noreferrer" class="">label-switched paths</a> and <a href="https://www.rfc-editor.org/rfc/rfc3209" target="_blank" rel="noopener noreferrer" class="">RSVP-TE</a> signalling [3]. These protocols take the specification of a DetNet flow and turn it into settings of the TSN mechanisms along the bridged segment [3]:</p>
<table><thead><tr><th>TSN mechanism configured</th><th>What it does for the DetNet flow</th><th>Standard</th></tr></thead><tbody><tr><td>Credit-based shaper</td><td>Limits the flow's class to its reserved rate and spreads its frames evenly</td><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qav</a>, see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/credit-based-shaper">the CBS post</a></td></tr><tr><td>Scheduled traffic</td><td>Opens and closes transmission gates on a timetable that repeats every cycle</td><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qbv</a>, see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/time-aware-shaper">the TAS post</a></td></tr><tr><td>Cyclic queuing and forwarding</td><td>Alternates two or three buffers in synchronised cycles, so each hop takes a fixed time</td><td><a href="https://1.ieee802.org/tsn/802-1qch/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qch</a>, see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/cyclic-queuing-and-forwarding">the CQF post</a></td></tr><tr><td>Frame preemption</td><td>Lets urgent frames interrupt a long frame already on the wire</td><td><a href="https://standards.ieee.org/ieee/802.1Qbu/5464/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qbu</a> and <a href="https://www.ieee802.org/3/br/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.3br</a>, see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qbu-frame-preemption">the preemption post</a></td></tr><tr><td>Frame replication and elimination</td><td>Sends copies over disjoint paths and removes the duplicates</td><td><a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1CB</a>, see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">the FRER post</a></td></tr></tbody></table>
<h3 class="anchor anchorTargetStickyNavbar_bCYu" id="matching-a-detnet-flow-to-a-tsn-stream">Matching a DetNet flow to a TSN stream<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#matching-a-detnet-flow-to-a-tsn-stream" class="hash-link" aria-label="Direct link to Matching a DetNet flow to a TSN stream" title="Direct link to Matching a DetNet flow to a TSN stream" translate="no">​</a></h3>
<p>The interworking itself is defined in <a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1CB</a>. Its stream identification functions, in particular <em>active destination MAC and <a href="https://en.wikipedia.org/wiki/VLAN" target="_blank" rel="noopener noreferrer" class="">VLAN</a> stream identification</em>, are how a TSN sub-network makes its capabilities known to DetNet flows [3]. When a DetNet flow enters the bridged segment, the edge bridge recognises it from three header fields: the destination <a href="https://en.wikipedia.org/wiki/MAC_address" target="_blank" rel="noopener noreferrer" class="">MAC address</a>, the <a href="https://en.wikipedia.org/wiki/VLAN" target="_blank" rel="noopener noreferrer" class="">VLAN</a> ID and the priority. It then maps the flow to a TSN stream identifier and to the <a href="https://en.wikipedia.org/wiki/Quality_of_service" target="_blank" rel="noopener noreferrer" class="">quality-of-service</a> requirements of the talkers and listeners in the <a href="https://www.ieee802.org/1/pages/avbridges.html" target="_blank" rel="noopener noreferrer" class="">AVB</a>/<a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">TSN</a> sub-network [3].</p>
<table><thead><tr><th><a href="https://www.rfc-editor.org/rfc/rfc8655" target="_blank" rel="noopener noreferrer" class="">DetNet</a> side (Layer 3)</th><th>TSN side (Layer 2)</th></tr></thead><tbody><tr><td>DetNet flow</td><td>Stream, with a stream identifier</td></tr><tr><td>Source and destination</td><td>Talker and listeners</td></tr><tr><td>Flow specification</td><td>QoS requirements of the talker and listeners</td></tr><tr><td>Flow recognised by its IP or MPLS header</td><td>Stream recognised by destination MAC address, VLAN ID and priority (<a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a> stream identification)</td></tr></tbody></table>
<p>Once matched, the flow is handled by the TSN mechanisms of the table above for the whole bridged segment. It leaves the segment as the same DetNet flow it was when it entered.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-what-each-layer-provides">6. What each layer provides<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#6-what-each-layer-provides" class="hash-link" aria-label="Direct link to 6. What each layer provides" title="Direct link to 6. What each layer provides" translate="no">​</a></h2>
<figure class="nc-figure"><svg viewBox="0 0 720 466" width="720" role="img" aria-label="The seven OSI layers with the function each provides in a deterministic path: end-to-end functions in Layers 4 to 7, DetNet at Layer 3, a mapping of DetNet flows to TSN streams, TSN at Layer 2, Ethernet at Layer 1, a common time base under every layer, and an SDN controller configuring Layers 3 and 2"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><text x="77" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">OSI layer</text><text x="355" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Function in a deterministic path</text><text x="652" y="16" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control</text><g><g><rect x="10" y="36" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="55" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Application (L7)</text></g><path d="M145,55 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="36" width="340" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="355" y="48.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Application services</text><text x="355" y="61.824999999999996" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">control loops, audio and video, OPC UA</text></g></g><g><g><rect x="10" y="82" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="101" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Presentation (L6)</text></g><path d="M145,101 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="82" width="340" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="355" y="94.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Data representation</text><text x="355" y="107.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">encoding, compression, encryption</text></g></g><g><g><rect x="10" y="128" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="147" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Session (L5)</text></g><path d="M145,147 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="128" width="340" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="355" y="140.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Dialogue control</text><text x="355" y="153.82500000000002" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">open, synchronise and close sessions</text></g></g><g><g><rect x="10" y="174" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="193" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Transport (L4)</text></g><path d="M145,193 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="174" width="340" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="355" y="186.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">End-to-end transport</text><text x="355" y="199.82500000000002" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">UDP or TCP; no congestion feedback on DetNet flows</text></g></g><g><g><rect x="10" y="220" width="135" height="52" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="246" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Network (L3)</text></g><path d="M145,246 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="220" width="340" height="52" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="355" y="232.35" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IETF DetNet over IP and MPLS</text><text x="355" y="246" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">service sub-layer: replication, elimination, ordering</text><text x="355" y="259.65" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding sub-layer: resources, explicit routes</text></g></g><g><g><rect x="10" y="280" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="77.5" y="299" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">L3 → L2</text></g><path d="M145,299 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="280" width="340" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="355" y="292.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">DetNet flow → TSN stream</text><text x="355" y="305.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">matched on destination MAC, VLAN ID and priority (802.1CB)</text></g></g><g><g><rect x="10" y="326" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="345" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Data link (L2)</text></g><path d="M145,345 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="326" width="340" height="38" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="355" y="338.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.1 TSN bridges</text><text x="355" y="351.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">policing, shaping, gates, preemption, FRER, reservation</text></g></g><g><g><rect x="10" y="372" width="135" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="77.5" y="391" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Physical (L1)</text></g><path d="M145,391 H185" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4"></path><g><rect x="185" y="372" width="340" height="38" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="355" y="384.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.3 Ethernet, IEEE 802.11, …</text><text x="355" y="397.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC Merge sublayer for preemption (802.3br)</text></g></g><g><rect x="10" y="422" width="515" height="32" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="267.5" y="438" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time at every node: gPTP (802.1AS), a profile of IEEE 1588 PTP</text></g><g><rect x="595" y="220" width="115" height="144" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="652.5" y="257.875" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SDN controller</text><text x="652.5" y="271.525" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit routes</text><text x="652.5" y="285.175" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">resource</text><text x="652.5" y="298.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">reservation</text><text x="652.5" y="312.475" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IntServ + DiffServ</text><text x="652.5" y="326.125" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TSN: the CNC</text></g><path d="M595,246 H527" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-arrival)"></path><path d="M595,345 H527" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-arrival)"></path></svg><figcaption>Figure 4. What each layer contributes to a deterministic path. A software-defined controller configures both the routed (DetNet) and the bridged (TSN) segments, and every node shares one time base.<span class="nc-figure-source">Source: <!-- -->own drawing, after the operation and traffic-engineering sections of the<!-- --> <a href="https://en.wikipedia.org/wiki/Deterministic_Networking">Wikipedia article on DetNet</a>, the sub-layers of <a href="https://www.rfc-editor.org/rfc/rfc8655">RFC 8655</a>, and J. Farkas,<!-- --> <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">IEEE 802.1 TSN TG Overview</a> (2018).</span></figcaption></figure>
<p>Figure 1 placed the two efforts in the stack. Figure 4 goes one step further and shows what each layer contributes, and where the control logic sits.</p>
<table><thead><tr><th>OSI layer</th><th>Function in the deterministic path</th></tr></thead><tbody><tr><td>Application (L7)</td><td>Application services: control loops, audio and video, industrial protocols such as <a href="https://opcfoundation.org/about/opc-technologies/opc-ua/" target="_blank" rel="noopener noreferrer" class="">OPC UA</a>. They receive bounded latency and very low loss without changing.</td></tr><tr><td>Presentation (L6)</td><td>Data representation: encoding, compression and encryption. Unchanged by DetNet and TSN.</td></tr><tr><td>Session (L5)</td><td>Dialogue control: opening, synchronising and closing sessions between applications. Unchanged by DetNet and TSN.</td></tr><tr><td>Transport (L4)</td><td>End-to-end transport, usually <a href="https://www.rfc-editor.org/rfc/rfc768" target="_blank" rel="noopener noreferrer" class="">UDP</a> or <a href="https://www.rfc-editor.org/rfc/rfc9293" target="_blank" rel="noopener noreferrer" class="">TCP</a>. DetNet adds no transport protocol, and its flows need no congestion feedback [3].</td></tr><tr><td>Network (L3)</td><td>Carries DetNet flows over IP or MPLS. The <em>service sub-layer</em> replicates, eliminates and reorders packets; the <em>forwarding sub-layer</em> uses the reserved resources and explicit routes [4]. Policing and shaping at the ingress keep each flow within its declared rate and also protect ordinary <a href="https://en.wikipedia.org/wiki/Information_technology" target="_blank" rel="noopener noreferrer" class="">IT</a> traffic from a misbehaving DetNet source [3].</td></tr><tr><td>L3 → L2</td><td>Where a routed path crosses a bridged segment, each DetNet flow becomes a TSN stream. The bridge recognises it by destination MAC address, VLAN ID and priority, using the stream identification functions of <a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a> [3].</td></tr><tr><td>Data link (L2)</td><td>Provides the queuing, shaping, scheduling, preemption and replication mechanisms that actually bound delay on each hop (see the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">TSN toolbox</a>) [3].</td></tr><tr><td>Physical (L1)</td><td>The physical link. The only change is the MAC Merge sublayer of <a href="https://www.ieee802.org/3/br/" target="_blank" rel="noopener noreferrer" class="">802.3br</a>, which lets urgent frames interrupt long ones (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qbu-frame-preemption">frame preemption</a>).</td></tr><tr><td>Under every layer</td><td>A shared time base at every node, with accuracy from nanoseconds to microseconds [3].</td></tr></tbody></table>
<p>In other words, the TSN algorithms for queuing, shaping and scheduling are not tied to Ethernet. DetNet reuses them at Layer 3 to deliver IP packets with the same guarantees, and hands traffic to TSN hardware where it exists [3]. How traffic-engineering protocols turn a DetNet flow specification into those TSN settings is explained under "Traffic engineering" in section 5.</p>
<h3 class="anchor anchorTargetStickyNavbar_bCYu" id="intserv-and-diffserv-in-osi-layer-3">IntServ and DiffServ in OSI layer 3<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#intserv-and-diffserv-in-osi-layer-3" class="hash-link" aria-label="Direct link to IntServ and DiffServ in OSI layer 3" title="Direct link to IntServ and DiffServ in OSI layer 3" translate="no">​</a></h3>
<p>Before DetNet, the IETF had two models for quality of service in IP networks. DetNet sits between them.</p>
<ul>
<li class=""><strong><a href="https://www.rfc-editor.org/rfc/rfc1633" target="_blank" rel="noopener noreferrer" class="">Integrated Services</a> (IntServ)</strong>, from 1994, reserves resources <strong>per flow</strong> in every router along the path. Reservations are usually signalled with <a href="https://www.rfc-editor.org/rfc/rfc2205" target="_blank" rel="noopener noreferrer" class="">RSVP</a> [5]. Its <em>Guaranteed Service</em> gives a mathematically provable upper bound on queuing delay for a flow described by a <a href="https://en.wikipedia.org/wiki/Token_bucket" target="_blank" rel="noopener noreferrer" class="">token bucket</a> [6]. This is the same kind of bound that <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">network calculus</a> derives. The price is per-flow state in every router, which does not scale to large networks.</li>
<li class=""><strong><a href="https://www.rfc-editor.org/rfc/rfc2475" target="_blank" rel="noopener noreferrer" class="">Differentiated Services</a> (DiffServ)</strong>, from 1998, does not track flows. The edge of the network classifies each packet and marks it with a 6-bit code point in the IP header (<a href="https://www.rfc-editor.org/rfc/rfc2474" target="_blank" rel="noopener noreferrer" class="">DSCP</a>). Core routers then apply one of a few <em>per-hop behaviours</em> to whole classes [7]. DiffServ scales well, but it promises only relative treatment of a class, not a bound for an individual flow, and the service a class receives can differ from one operator to the next [8].</li>
</ul>
<p>A long-standing compromise uses IntServ at the edges, to admit and shape each flow, and DiffServ in the core, to forward aggregates [8][9]. DetNet follows the same pattern. Each flow is admitted and policed individually, while nodes can treat aggregates of flows together. The aggregation analysis of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/aggregate-multiplexing-residual-service">the multiplexing post</a> is what makes this safe.</p>
<h3 class="anchor anchorTargetStickyNavbar_bCYu" id="where-sdn-fits">Where SDN fits<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#where-sdn-fits" class="hash-link" aria-label="Direct link to Where SDN fits" title="Direct link to Where SDN fits" translate="no">​</a></h3>
<p>The Wikipedia article on DetNet describes the Layer 3 part as working through a <strong>software-defined networking layer</strong> that brings IntServ and DiffServ together [3]. In practice, a logically central controller does three jobs that neither IntServ nor DiffServ could do alone:</p>
<ol>
<li class="">it <strong>computes explicit routes</strong>, which do not change immediately when the topology changes, so routing protocols reconverging cause no interruption. RSVP-TE, Segment Routing, IS-IS or MPLS-TE can install the same routes [3];</li>
<li class="">it <strong>reserves resources</strong> per flow at every node, with the knowledge of all other flows that <a href="https://en.wikipedia.org/wiki/Admission_control" target="_blank" rel="noopener noreferrer" class="">admission control</a> needs;</li>
<li class="">it <strong>configures the TSN segments</strong> on the path, through the <a href="https://1.ieee802.org/tsn/802-1qcc/" target="_blank" rel="noopener noreferrer" class="">CNC</a> of <a href="https://1.ieee802.org/tsn/802-1qcc/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Qcc</a>.</li>
</ol>
<p>RFC 8655 places this logic in the <em>controller plane</em> of the DetNet architecture (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ietf-detnet">the IETF DetNet post</a>). <a class="" href="https://cnam-ece.github.io/learning-materials/blog/sdn-and-tsn-configuration">The SDN post</a> shows the same structure on the TSN side.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="7-where-it-is-used">7. Where it is used<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#7-where-it-is-used" class="hash-link" aria-label="Direct link to 7. Where it is used" title="Direct link to 7. Where it is used" translate="no">​</a></h2>
<p>The application areas named by the two groups overlap widely [1][3]: professional and home audio and video, industrial automation and machine-to-machine control, in-vehicle networks, electrical generation and distribution, building automation, and cellular <a href="https://en.wikipedia.org/wiki/Fronthaul" target="_blank" rel="noopener noreferrer" class="">fronthaul</a> and backhaul. A common motivation is to move time-critical applications from dedicated <a href="https://en.wikipedia.org/wiki/Fieldbus" target="_blank" rel="noopener noreferrer" class="">fieldbus</a> networks onto packet networks that also carry ordinary IT traffic [3].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/deterministic-networking#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">IETF, <em>Deterministic Networking (detnet) working group: charter</em>. <a href="https://datatracker.ietf.org/wg/detnet/about/" target="_blank" rel="noopener noreferrer" class="">Datatracker</a></li>
<li class="">J. Farkas, "TSN Basic Concepts," DetNet–TSN workshop, 11 November 2018. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">Wikipedia, "Deterministic Networking." <a href="https://en.wikipedia.org/wiki/Deterministic_Networking" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">N. Finn, P. Thubert, B. Varga, J. Farkas, <em>Deterministic Networking Architecture</em>, RFC 8655, October 2019. <a href="https://www.rfc-editor.org/rfc/rfc8655" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">R. Braden, D. Clark, S. Shenker, <em>Integrated Services in the Internet Architecture: an Overview</em>, RFC 1633, June 1994. <a href="https://www.rfc-editor.org/rfc/rfc1633" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">S. Shenker, C. Partridge, R. Guerin, <em>Specification of Guaranteed Quality of Service</em>, RFC 2212, September 1997. <a href="https://www.rfc-editor.org/rfc/rfc2212" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">S. Blake et al., <em>An Architecture for Differentiated Services</em>, RFC 2475, December 1998. <a href="https://www.rfc-editor.org/rfc/rfc2475" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">I. Behnke, H. Austad, "Real-Time Performance of Industrial IoT Communication Technologies: A Review," arXiv:2311.08852, 2023, Section III-D. <a href="https://arxiv.org/abs/2311.08852" target="_blank" rel="noopener noreferrer" class="">arXiv</a></li>
<li class="">Y. Bernet et al., <em>A Framework for Integrated Services Operation over Diffserv Networks</em>, RFC 2998, November 2000. <a href="https://www.rfc-editor.org/rfc/rfc2998" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>Presentation</category>
            <category>Deterministic networking</category>
            <category>DetNet</category>
            <category>IEEE 802.1</category>
            <category>TSN</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1 standards: base standards, amendments, revisions and families]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions</guid>
            <pubDate>Tue, 17 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How an IEEE 802.1 standard is born from a PAR, changed by amendments and corrigenda, rolled up into a new edition by a revision, and retired. The history of 802.1Q edition by edition, how standards are grouped into families, and how to read and cite them.]]></description>
            <content:encoded><![CDATA[<p>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.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 250" width="720" role="img" aria-label="Life of an IEEE standard: a PAR leads to a new base standard; amendments and corrigenda change it while it is active; a revision rolls them up into a new edition, which supersedes the old one; a standard not revised within 10 years becomes inactive-reserved, and a ballot can make it inactive-withdrawn"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="10" y="20" width="110" height="46" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="65" y="35.85" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PAR</text><text x="65" y="50.150000000000006" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">new project</text></g><path d="M120,43 H160" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><g><rect x="160" y="14" width="170" height="58" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="245" y="29.35" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Base standard, edition N</text><text x="245" y="43" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">capital letters, e.g.</text><text x="245" y="56.650000000000006" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2018</text></g><path d="M330,43 H390" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="360" y="32" font-size="9.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">revision</text><g><rect x="390" y="14" width="170" height="58" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="475" y="29.35" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Base standard, edition N+1</text><text x="475" y="43" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">rolls up all changes,</text><text x="475" y="56.650000000000006" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">e.g. 802.1Q-2022</text></g><path d="M560,43 H590" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><g><rect x="590" y="20" width="120" height="46" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="650" y="30" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">and so on,</text><text x="650" y="43" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">at least every</text><text x="650" y="56" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">10 years</text></g><g><rect x="150" y="115" width="190" height="52" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="245" y="128" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Amendment</text><text x="245" y="141" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">lower-case letters: 802.1Qcc;</text><text x="245" y="154" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">adds or changes content</text></g><g><rect x="150" y="180" width="190" height="52" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="245" y="193" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Corrigendum</text><text x="245" y="206" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">“Cor”: fixes errors only,</text><text x="245" y="219" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">no new content</text></g><path d="M245,115 V72" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)"></path><path d="M340,141 C380,141 400,110 430,72" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-arrival)"></path><path d="M340,206 C390,206 430,130 470,72" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-arrival)"></path><text x="420" y="160" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">merged into the next edition</text><g><rect x="560" y="115" width="150" height="52" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="635" y="128" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Superseded</text><text x="635" y="141" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">replaced by the</text><text x="635" y="154" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">next edition</text></g><g><rect x="560" y="180" width="150" height="52" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="635" y="193" font-size="10" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Inactive</text><text x="635" y="206" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">reserved: not revised in 10 y</text><text x="635" y="219" font-size="10" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">withdrawn: by ballot</text></g><path d="M245,72 C245,95 520,95 600,115" fill="none" stroke="var(--nc-bound)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-muted)"></path><text x="500" y="113" font-size="9.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">edition N</text></svg><figcaption>Figure 1. The life of an IEEE standard. A PAR starts a new base standard. While it is active, amendments add or change content and corrigenda fix errors. A revision rolls them all into a new edition, which supersedes the old one. A standard not revised within 10 years becomes inactive.<span class="nc-figure-source">Source: <!-- -->own drawing, after the<!-- --> <a href="https://standards.ieee.org/faqs/maintenance/">IEEE SA maintenance FAQ</a> and D. Pannell,<!-- --> <a href="https://standards.ieee.org/wp-content/uploads/import/documents/other/eipatd-presentations/2020/D1-05-Pannell-Status-and-Content-of-the-IEEE-TSN-Automotive-Profile.pdf">How IEEE 802.1 Works</a>, 2020, slide 4.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->23<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-ATS"><td><a href="https://1.ieee802.org/tsn/802-1qcr/"><b>ATS</b></a></td><td>Asynchronous Traffic Shaping</td><td>IEEE 802.1Qcr: per-stream token-bucket shaping at every hop using local clocks only.</td></tr><tr id="abbr-CBS"><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/"><b>CBS</b></a></td><td>Credit-Based Shaper</td><td>The IEEE 802.1Qav shaper that limits a traffic class to its reserved rate (idleSlope) with a per-queue credit. In MEF bandwidth profiles, CBS instead means Committed Burst Size.</td></tr><tr id="abbr-Cor"><td><a href="https://standards.ieee.org/faqs/maintenance/"><b>Cor</b></a></td><td>Corrigendum</td><td>A document that only corrects errors or ambiguities in a standard, without adding new material, for example 802.1Q-2014/Cor 1-2015.</td></tr><tr id="abbr-CQF"><td><a href="https://1.ieee802.org/tsn/802-1qch/"><b>CQF</b></a></td><td>Cyclic Queuing and Forwarding</td><td>IEEE 802.1Qch: two queues per class alternate every cycle, so a frame advances one hop per cycle.</td></tr><tr id="abbr-CSD"><td><b>CSD</b></td><td>Criteria for Standards Development</td><td>The IEEE 802 criteria (such as broad market potential and technical feasibility) used to judge whether a PAR should go forward.</td></tr><tr id="abbr-IEC"><td><a href="https://www.iec.ch/"><b>IEC</b></a></td><td>International Electrotechnical Commission</td><td>The international standards body for electrical and electronic technologies; co-owner of IEC/IEEE 60802.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-LMSC"><td><a href="https://www.ieee802.org/"><b>LMSC</b></a></td><td>LAN/MAN Standards Committee</td><td>The IEEE Computer Society standards committee better known as IEEE 802; its working groups include 802.1, 802.3 and 802.11.</td></tr><tr id="abbr-MRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MRP</b></a></td><td>Multiple Registration Protocol</td><td>IEEE 802.1ak, now in 802.1Q: the framework for declaring and registering attributes such as VLANs, multicast addresses and streams.</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-NesCom"><td><b>NesCom</b></td><td>New Standards Committee</td><td>The IEEE SA Standards Board committee that reviews PARs before work may start.</td></tr><tr id="abbr-PAR"><td><a href="https://standards.ieee.org/develop/"><b>PAR</b></a></td><td>Project Authorization Request</td><td>The document that authorises work on a new standard, amendment or revision, stating its scope and purpose; approved by the IEEE SA Standards Board on the recommendation of NesCom.</td></tr><tr id="abbr-PSFP"><td><a href="https://1.ieee802.org/tsn/802-1qci/"><b>PSFP</b></a></td><td>Per-Stream Filtering and Policing</td><td>IEEE 802.1Qci: stream filters, stream gates and flow meters that enforce each stream’s contract at ingress.</td></tr><tr id="abbr-RevCom"><td><b>RevCom</b></td><td>Standards Review Committee</td><td>The IEEE SA Standards Board committee that checks a balloted draft followed due process before it is approved as a standard.</td></tr><tr id="abbr-SASB"><td><b>SASB</b></td><td>IEEE SA Standards Board</td><td>The board that approves PARs and standards and oversees the standards process.</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TAG"><td><b>TAG</b></td><td>Technical Advisory Group</td><td>A group of experts on a topic that crosses working groups; it may write a recommended practice.</td></tr><tr id="abbr-TAS"><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/"><b>TAS</b></a></td><td>Time-Aware Shaper</td><td>IEEE 802.1Qbv scheduled traffic: a gate per queue, opened and closed by a repeating gate control list.</td></tr><tr id="abbr-TG"><td><b>TG</b></td><td>Task Group</td><td>A part of a working group that focuses on one subject, such as the TSN task group of IEEE 802.1.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-WG"><td><b>WG</b></td><td>Working Group</td><td>The group responsible for the standards of one area, such as IEEE 802.1 (higher layer LAN protocols); only its voting members vote in working-group ballots.</td></tr><tr id="abbr-YANG"><td><a href="https://www.rfc-editor.org/rfc/rfc7950"><b>YANG</b></a></td><td>Yet Another Next Generation (data modelling language)</td><td>The language in which network configuration and state are modelled for NETCONF and RESTCONF (RFC 7950).</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition-three-kinds-of-projects">1. Definition: three kinds of projects<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#1-definition-three-kinds-of-projects" class="hash-link" aria-label="Direct link to 1. Definition: three kinds of projects" title="Direct link to 1. Definition: three kinds of projects" translate="no">​</a></h2>
<p>IEEE 802.1 works on three kinds of standards projects [1][2]:</p>
<table><thead><tr><th>Kind</th><th>What it is</th><th>How it is named</th><th>Example</th></tr></thead><tbody><tr><td><strong>Base standard</strong></td><td>A stand-alone document</td><td>Upper-case letters after "802.1" (the rule since about 2003)</td><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">802.1Q</a> (bridging), 802.1AS (timing), 802.1CB (redundancy)</td></tr><tr><td><strong>Amendment</strong></td><td>A change to a base standard; only the amendment's changes are open to ballot comments</td><td>Lower-case letters added to the name of the base standard</td><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">802.1Qbv</a> (scheduled traffic), 802.1ASdm (hot standby), 802.1CBdb (extended stream identification)</td></tr><tr><td><strong>Revision</strong></td><td>A new edition of a base standard; the whole document may be open to comments</td><td>The base name followed by "-Rev" while in progress, then by the year</td><td>802.1Q-Rev, a roll-up; 802.1AS-Rev, in which the entire document was open</td></tr></tbody></table>
<p>Two more conventions complete the picture [1]:</p>
<ul>
<li class="">A <strong>corrigendum</strong> ("Cor") fixes errors or ambiguities only and may not add material, for example 802.1Q-2014/Cor 1-2015.</li>
<li class="">A leading <strong>P</strong> marks a project that is still a draft: P802.1Q is the revision now in progress, 802.1Q-2022 the published edition.</li>
</ul>
<p>When a revision is used only to <strong>roll up</strong> amendments into a new edition, its scope forbids adding features [2]. New functions arrive through amendments; the roll-up gathers them into one document.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-who-writes-them">2. Who writes them<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#2-who-writes-them" class="hash-link" aria-label="Direct link to 2. Who writes them" title="Direct link to 2. Who writes them" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-ieee-sa.png" alt="Organisation chart of the IEEE Standards Association down to the IEEE 802 committee" loading="lazy"><figcaption>Figure 2. Where IEEE 802 sits in the IEEE Standards Association: the Standards Board and its committees (NesCom approves new projects, RevCom approves finished standards) above the standards committees, of which IEEE 802 is one, formed by the Computer Society.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 3<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>IEEE 802, the LAN/MAN Standards Committee, is one of the standards committees of the IEEE Computer Society. Its <strong>working groups</strong> each own an area: 802.1 bridging and architecture, 802.3 Ethernet, 802.11 wireless LANs [1]. Inside a working group, <strong>task groups</strong> focus on one subject, as the TSN task group does for time-sensitive networking [1]. The terms used along the way [1]:</p>
<table><thead><tr><th>Term</th><th>Meaning</th></tr></thead><tbody><tr><td>PAR, Project Authorization Request</td><td>The document that authorises work on a project</td></tr><tr><td>CSD, Criteria for Standards Development</td><td>The basis for deciding whether to forward a PAR</td></tr><tr><td>WG, Working Group</td><td>Responsible for developing the standards of one area</td></tr><tr><td>TG, Task Group (or task force)</td><td>Part of a working group, focused on one subject</td></tr><tr><td>TAG, Technical Advisory Group</td><td>Experts on a topic that crosses working groups; may write a recommended practice</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-from-idea-to-published-standard">3. From idea to published standard<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#3-from-idea-to-published-standard" class="hash-link" aria-label="Direct link to 3. From idea to published standard" title="Direct link to 3. From idea to published standard" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/pannell2020-stages.png" alt="Stages of an IEEE 802.1 standard: new idea, PAR, task group, work group, SA ballots, standard" loading="lazy"><figcaption>Figure 3. The stages of an IEEE 802.1 project, as the 802.1DG editor summarised them.<span class="nc-figure-source">Source: <a href="https://standards.ieee.org/wp-content/uploads/import/documents/other/eipatd-presentations/2020/D1-05-Pannell-Status-and-Content-of-the-IEEE-TSN-Automotive-Profile.pdf">D. Pannell, “Status &amp; Content of the IEEE TSN Auto Profile,” IEEE Ethernet &amp; IP @ Automotive Technology Day, September 2020</a>, <!-- -->slide 6<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-process.png" alt="The standard development process: PAR, NesCom approval, task group ballot, working group ballot and recirculation, sponsor ballot and recirculation, RevCom approval, publication" loading="lazy" style="max-width:min(100%, 560px)"><figcaption>Figure 4. The development process in more detail. Each ballot can repeat (the loops i to m) until no new comments remain; recirculation ballots are open only on the changes since the previous round.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 7<!-- -->;<!-- --> <!-- -->cropped, with the slide footer blanked<!-- -->.</span></figcaption></figure>
<p>The stages, in the words of an 802.1 editor [2]:</p>
<ol>
<li class=""><strong>Ideas and presentations.</strong> Anyone may bring a problem within the scope of 802.1; the proposers must show there is a need and a market.</li>
<li class=""><strong>PAR.</strong> Enough 802.1 voters must support it, and the IEEE approves it (through NesCom).</li>
<li class=""><strong>Task group ballots.</strong> Requirements are collected and solutions worked out. Anyone can comment and vote.</li>
<li class=""><strong>Working group ballots.</strong> The solutions are validated. Anyone can comment and every comment is answered, but only 802.1 voters' votes count.</li>
<li class=""><strong>Standards Association (sponsor) ballots.</strong> The last step, checking that all IEEE procedures were followed. Anyone can join the ballot pool.</li>
<li class=""><strong>Approval and publication</strong>, after RevCom has reviewed the process.</li>
</ol>
<p>At each level a first ballot covers the whole document, and recirculations cover only the changes [3]. Technical decisions need agreement of at least 75 %. The process rests on due process, consensus, openness, balance between interested parties, and a right of appeal [3].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-how-amendments-merge-into-editions">4. How amendments merge into editions<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#4-how-amendments-merge-into-editions" class="hash-link" aria-label="Direct link to 4. How amendments merge into editions" title="Direct link to 4. How amendments merge into editions" translate="no">​</a></h2>
<p>The IEEE 802.1 introduction to newcomers puts it in one sentence: periodically the amendments get merged into a revision of the main standard [1]. 802.1Q shows how this plays out over 25 years.</p>
<figure class="nc-figure"><svg viewBox="0 0 720 548" width="720" role="img" aria-label="Timeline of IEEE 802.1Q editions from 1998 to the 2022 active standard and the revision in progress; for each edition, its key amendments shown as keywords, which the next edition rolled up"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><text x="75" y="12" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Edition</text><text x="420" y="12" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Key amendments, rolled into the next edition</text><g><g><rect x="10" y="28" width="130" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="75" y="44.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-1998</text><text x="75" y="57.824999999999996" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">1998</text></g><g><rect x="160" y="28" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="44.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MSTP</text><text x="204" y="57.175000000000004" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1s</text></g><g><rect x="256" y="28" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="38.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Protocol</text><text x="300" y="51" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">VLANs</text><text x="300" y="63.349999999999994" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1v</text></g><text x="356" y="51" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+1 corrigendum</text><path d="M75,74 V104" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="90" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="106" width="130" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="75" y="122.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2005</text><text x="75" y="135.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2005</text></g><g><rect x="160" y="106" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="116.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Provider</text><text x="204" y="129" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">bridges</text><text x="204" y="141.35" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1ad</text></g><g><rect x="256" y="106" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="122.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MRP</text><text x="300" y="135.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1ak</text></g><g><rect x="352" y="106" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="396" y="122.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PBB</text><text x="396" y="135.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1ah</text></g><g><rect x="448" y="106" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="492" y="122.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS</text><text x="492" y="135.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qav</text></g><g><rect x="544" y="106" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="588" y="122.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP</text><text x="588" y="135.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qat</text></g><text x="644" y="129" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+6 more</text><path d="M75,152 V182" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="168" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="184" width="130" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="75" y="200.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2011</text><text x="75" y="213.82500000000002" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2011</text></g><g><rect x="160" y="184" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="200.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SPB</text><text x="204" y="213.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1aq</text></g><g><rect x="256" y="184" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="200.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ETS</text><text x="300" y="213.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qaz</text></g><g><rect x="352" y="184" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="396" y="200.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PFC</text><text x="396" y="213.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qbb</text></g><g><rect x="448" y="184" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="492" y="200.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">EVB</text><text x="492" y="213.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qbg</text></g><g><rect x="544" y="184" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="588" y="200.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC bridges</text><text x="588" y="213.17499999999998" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1D-2004</text></g><text x="644" y="207" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+5 more</text><path d="M75,230 V260" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="246" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="262" width="130" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="75" y="278.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2014</text><text x="75" y="291.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2014</text></g><g><rect x="160" y="262" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="278.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TAS</text><text x="204" y="291.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qbv</text></g><g><rect x="256" y="262" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="278.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Preemption</text><text x="300" y="291.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qbu</text></g><g><rect x="352" y="262" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="396" y="278.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PCR</text><text x="396" y="291.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qca</text></g><g><rect x="448" y="262" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="492" y="278.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF</text><text x="492" y="291.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qch</text></g><g><rect x="544" y="262" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="588" y="278.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP</text><text x="588" y="291.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qci</text></g><text x="644" y="285" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+3 more</text><path d="M75,308 V338" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="324" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="340" width="130" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="75" y="356.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2018</text><text x="75" y="369.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2018</text></g><g><rect x="160" y="340" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="350.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TSN</text><text x="204" y="363" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">configuration</text><text x="204" y="375.34999999999997" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcc</text></g><g><rect x="256" y="340" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="356.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">YANG</text><text x="300" y="369.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcp</text></g><g><rect x="352" y="340" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="396" y="356.825" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS</text><text x="396" y="369.175" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcr</text></g><text x="452" y="363" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+2 more</text><path d="M75,386 V416" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="402" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="418" width="130" height="46" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="75" y="434.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.1Q-2022</text><text x="75" y="447.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">active</text></g><g><rect x="160" y="418" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="204" y="428.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">YANG for</text><text x="204" y="441" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TSN</text><text x="204" y="453.34999999999997" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcw</text></g><g><rect x="256" y="418" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="300" y="428.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PBB</text><text x="300" y="441" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">attachment</text><text x="300" y="453.34999999999997" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcj</text></g><g><rect x="352" y="418" width="88" height="46" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="396" y="428.65" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Congestion</text><text x="396" y="441" font-size="9.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">isolation</text><text x="396" y="453.34999999999997" font-size="9.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Qcz</text></g><text x="452" y="441" font-size="9.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">+3 more</text><path d="M75,464 V494" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><text x="84" y="480" font-size="9" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">roll-up</text></g><g><g><rect x="10" y="496" width="130" height="46" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect><text x="75" y="512.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">P802.1Q</text><text x="75" y="525.8249999999999" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">revision in progress</text></g><text x="160" y="519" font-size="10" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">the next roll-up: it will supersede 802.1Q-2022 and absorb its amendments</text></g></svg><figcaption>Figure 5. The editions of IEEE 802.1Q. For each edition, the key amendments approved against it (keyword above, designation below), which the next edition rolled into its text. The IEEE SA page of each edition, linked below, lists all of them.<span class="nc-figure-source">Source: <!-- -->own drawing from the IEEE SA pages of<!-- --> <span><a href="https://standards.ieee.org/ieee/802.1Q/1039/">802.1Q-1998</a>, </span><span><a href="https://standards.ieee.org/ieee/802.1Q/3495/">802.1Q-2005</a>, </span><span><a href="https://standards.ieee.org/ieee/802.1Q/4410/">802.1Q-2011</a>, </span><span><a href="https://standards.ieee.org/ieee/802.1Q/5801/">802.1Q-2014</a>, </span><span><a href="https://standards.ieee.org/ieee/802.1Q/6844/">802.1Q-2018</a>, </span><span><a href="https://standards.ieee.org/ieee/802.1Q/10323/">802.1Q-2022</a> and </span><span><a href="https://standards.ieee.org/ieee/802.1Q/11285/">P802.1Q</a></span>, which list every amendment and corrigendum of each edition.</span></figcaption></figure>
<p>Reading the figure:</p>
<ul>
<li class=""><strong>Each TSN mechanism entered 802.1Q twice.</strong> First as an amendment (802.1Qbv-2015, 802.1Qbu-2016, 802.1Qci-2017), then as clauses of the next edition, 802.1Q-2018. A paper citing "802.1Q-2018" for scheduled traffic and one citing "802.1Qbv-2015" mean the same text.</li>
<li class=""><strong>A whole standard can be absorbed.</strong> 802.1Q-2014 superseded not only 802.1Q-2011 but also <strong>802.1D-2004</strong>, the separate standard for MAC bridges, whose content it took over [4].</li>
<li class=""><strong>The cycle never stops.</strong> 802.1Q-2022 is the active edition. It already has six amendments (2023 to 2025) and three amendment projects, and a revision PAR approved on 5 June 2023 will supersede it [4].</li>
</ul>
<p>Other base standards follow the same pattern. <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1as-time-synchronization">802.1AS</a> went from 802.1AS-2011 to 802.1AS-2020, a revision in which the whole document was open, and has since had amendments such as 802.1ASdm (hot standby) and a further revision [2][5]. 802.1CB-2017 was amended by 802.1CBdb-2021 and is being revised [5].</p>
<p>Because 802.1Q gathers so many former amendments, it can be considered many individual standards integrated into a single document. The introduction suggests a reading order [1]:</p>
<ul>
<li class="">clauses 6 to 9 for the general bridge architecture;</li>
<li class="">the clause titled "Principles of …" for an unfamiliar area;</li>
<li class="">clause 5, Conformance, to find the requirements of a given device.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-status-and-maintenance">5. Status and maintenance<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#5-status-and-maintenance" class="hash-link" aria-label="Direct link to 5. Status and maintenance" title="Direct link to 5. Status and maintenance" translate="no">​</a></h2>
<p>Every approved IEEE standard has a <strong>10-year life cycle</strong> [6]:</p>
<table><thead><tr><th>Status</th><th>Meaning</th></tr></thead><tbody><tr><td>Active</td><td>Being maintained</td></tr><tr><td>Superseded</td><td>Replaced by a revised edition, or by a compilation of the standard with all its amendments, corrigenda and errata</td></tr><tr><td>Inactive-reserved</td><td>Removed from active status because no revision was completed within 10 years</td></tr><tr><td>Inactive-withdrawn</td><td>Removed from active status by a ballot of the balloting group</td></tr></tbody></table>
<p>An active standard must go through a revision at least every 10 years to stay active [6]. Amendments and corrigenda change its content but do not reset that clock: only a revision does [6]. This is one reason why base standards such as 802.1Q are revised regularly even when no single amendment requires it.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-how-standards-are-grouped">6. How standards are grouped<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#6-how-standards-are-grouped" class="hash-link" aria-label="Direct link to 6. How standards are grouped" title="Direct link to 6. How standards are grouped" translate="no">​</a></h2>
<p>The word "group" means several things in IEEE 802.1:</p>
<ul>
<li class=""><strong>By working group.</strong> The number after "802." names the working group that owns a standard: 802.1 for bridging and architecture, 802.3 for Ethernet [1]. Frame preemption, for example, needed one standard from each: <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-3br-interspersing-express-traffic">802.3br</a> and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qbu-frame-preemption">802.1Qbu</a>.</li>
<li class=""><strong>By base standard.</strong> A base standard, its amendments and its corrigenda form one family until the next revision merges them. The letters after the base name show the family: 802.1Qcc belongs to 802.1Q, 802.1CBdb to 802.1CB.</li>
<li class=""><strong>By role in TSN.</strong> The TSN task group sorts its documents into three tiers.</li>
</ul>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-grouping.png" alt="TSN standards grouped into profiles, configuration and base technology" loading="lazy"><figcaption>Figure 6. The three tiers of TSN standards and projects: base technology (the tools), configuration (YANG models and configuration protocols), and profiles (selections of tools for one application).<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 9<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<ol>
<li class=""><strong>Base technology:</strong> the tools themselves, for example 802.1AS, 802.1Qbv and 802.1CB.</li>
<li class=""><strong>Configuration:</strong> how the tools are set up, for example 802.1Qcc and the YANG models 802.1Qcp and 802.1Qcw.</li>
<li class=""><strong>Profiles:</strong> documents that select and constrain the tools for one application, for example <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1ba-avb-profile">802.1BA</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1cm-fronthaul-profile">802.1CM</a> and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/iec-ieee-60802-industrial-profile">IEC/IEEE 60802</a>.</li>
</ol>
<p>A profile may make an optional feature mandatory but may not create new features or protocols. A gap found while writing a profile becomes an amendment to a base standard [2]. In the other direction, mechanisms that change how a bridge forwards frames are written as amendments to 802.1Q, while functions also used outside the bridge, such as time synchronisation (802.1AS) or frame replication (802.1CB), are separate base standards.</p>
<p>Some standards are written jointly with another body and carry both logos. IEC/IEEE 60802 is a joint IEC SC65C/WG18 and IEEE 802 project that produces one dual-logo standard [7].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="7-how-to-cite-a-standard">7. How to cite a standard<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#7-how-to-cite-a-standard" class="hash-link" aria-label="Direct link to 7. How to cite a standard" title="Direct link to 7. How to cite a standard" translate="no">​</a></h2>
<ul>
<li class=""><strong>Cite with a year for a specific text:</strong> "IEEE Std 802.1Q-2022". A designation without a year means the latest edition [1].</li>
<li class=""><strong>Cite the amendment for history, the edition for the text:</strong> "introduced by 802.1Qbv-2015, now specified in 802.1Q-2022".</li>
<li class=""><strong>Check the status first.</strong> An IEEE SA page states whether a standard is active, superseded or inactive, and lists its amendments and the edition that superseded it, as used for Figure 5.</li>
<li class=""><strong>Free access.</strong> IEEE 802 standards become free to download through the <a href="https://standards.ieee.org/products-programs/ieee-get-program/" target="_blank" rel="noopener noreferrer" class="">IEEE GET Program</a> some months after publication.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017, slides 10–16. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">D. Pannell, "Status &amp; Content of the IEEE TSN Auto Profile," IEEE Ethernet &amp; IP @ Automotive Technology Day, September 2020, slides 4–6 and 9. <a href="https://standards.ieee.org/wp-content/uploads/import/documents/other/eipatd-presentations/2020/D1-05-Pannell-Status-and-Content-of-the-IEEE-TSN-Automotive-Profile.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "IEEE 802.1 TSN TG Overview," DetNet–TSN workshop, 11 November 2018, slides 3, 5, 7 and 9. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">IEEE SA, pages of IEEE 802.1Q-1998, -2005, -2011, -2014, -2018, -2022 and of the P802.1Q revision project. <a href="https://standards.ieee.org/ieee/802.1Q/5801/" target="_blank" rel="noopener noreferrer" class="">802.1Q-2014</a>, <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">802.1Q-2022</a>, <a href="https://standards.ieee.org/ieee/802.1Q/11285/" target="_blank" rel="noopener noreferrer" class="">P802.1Q</a></li>
<li class="">IEEE 802.1, <em>Time-Sensitive Networking (TSN) Task Group</em>, list of standards and projects. <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
<li class="">IEEE SA, "Maintenance of IEEE Standards FAQs." <a href="https://standards.ieee.org/faqs/maintenance/" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
<li class="">IEEE 802.1, <em>IEC/IEEE 60802 TSN Profile for Industrial Automation</em>, project page. <a href="https://1.ieee802.org/tsn/iec-ieee-60802/" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1: the working group, the TSN task group and how to read the standards]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group</guid>
            <pubDate>Tue, 17 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Where IEEE 802.1 sits in the protocol stack, how the TSN task group grew out of Audio Video Bridging, how its standards are named, grouped and developed, and which ones are published today.]]></description>
            <content:encoded><![CDATA[<p><a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Time-Sensitive Networking</a> is not one standard but the output of one task group inside the <a href="https://1.ieee802.org/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1</a> working group. Reading the TSN literature is much easier once the organisation, the naming rules and the three tiers of documents are clear.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 270" width="720" role="img" aria-label="OSI reference model with IEEE 802 covering the data link and physical layers, IEEE 802.1 on top of the MAC standards, and the TSN task group inside the 802.1 working group"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><text x="90" y="14" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">OSI reference model</text><g><rect x="20" y="28" width="140" height="28" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="90" y="42" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Application</text></g><g><rect x="20" y="61" width="140" height="28" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="90" y="75" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Presentation</text></g><g><rect x="20" y="94" width="140" height="28" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="90" y="108" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Session</text></g><g><rect x="20" y="127" width="140" height="28" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="90" y="141" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Transport</text></g><g><rect x="20" y="160" width="140" height="28" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="90" y="174" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Network</text></g><g><rect x="20" y="193" width="140" height="28" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="90" y="207" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Data link</text></g><g><rect x="20" y="226" width="140" height="28" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="90" y="240" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Physical</text></g><text x="465" y="14" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.1 working group: task groups (2018)</text><g><rect x="230" y="28" width="110" height="40" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="285" y="48" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">TSN TG</text></g><g><rect x="350" y="28" width="110" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="405" y="48" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Security TG</text></g><g><rect x="470" y="28" width="110" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="525" y="48" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Maintenance TG</text></g><g><rect x="590" y="28" width="110" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="645" y="48" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">OmniRAN TG</text></g><path d="M285,68 V150" fill="none" stroke="var(--nc-service)" stroke-width="1.4"></path><path d="M405,68 V150" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path><path d="M525,68 V150" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path><path d="M645,68 V150" fill="none" stroke="var(--nc-bound)" stroke-width="1.4"></path><g><rect x="230" y="150" width="470" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="465" y="164.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">IEEE 802.1</text><text x="465" y="179.79999999999998" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">bridging, architecture, management, security</text></g><g><rect x="230" y="206" width="150" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="305" y="226" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.3 Ethernet</text></g><g><rect x="390" y="206" width="150" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="465" y="226" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.11 Wireless LAN</text></g><g><rect x="550" y="206" width="150" height="40" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="625" y="226" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">802.15 Wireless PAN</text></g><path d="M160,207 C195,207 195,172 230,172" fill="none" stroke="var(--nc-bound)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-muted)"></path><path d="M160,240 C195,240 195,226 230,226" fill="none" stroke="var(--nc-bound)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-muted)"></path><text x="465" y="260" font-size="11" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">media-specific MAC and PHY standards</text></svg><figcaption>Figure 1. IEEE 802 covers the two lowest OSI layers; IEEE 802.1 sits at the top of the link layer, above the media-specific standards, and hosts the TSN task group.<span class="nc-figure-source">Source: <!-- -->own drawing, after J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">IEEE 802.1 TSN TG Overview</a> <!-- -->(2018), slides 4 and 6, and<!-- --> <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf">Introduction to IEEE 802.1</a> (2017), slide 13.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->12<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-AVB"><td><a href="https://www.ieee802.org/1/pages/avbridges.html"><b>AVB</b></a></td><td>Audio Video Bridging</td><td>The predecessor of TSN: gPTP, the credit-based shaper and stream reservation, combined for audio and video (profile: IEEE 802.1BA).</td></tr><tr id="abbr-CBS"><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/"><b>CBS</b></a></td><td>Credit-Based Shaper</td><td>The IEEE 802.1Qav shaper that limits a traffic class to its reserved rate (idleSlope) with a per-queue credit. In MEF bandwidth profiles, CBS instead means Committed Burst Size.</td></tr><tr id="abbr-gPTP"><td><a href="https://1.ieee802.org/tsn/802-1as-2020/"><b>gPTP</b></a></td><td>generalized Precision Time Protocol</td><td>The profile of PTP defined by IEEE 802.1AS, in which every bridge takes part in time distribution.</td></tr><tr id="abbr-IEC"><td><a href="https://www.iec.ch/"><b>IEC</b></a></td><td>International Electrotechnical Commission</td><td>The international standards body for electrical and electronic technologies; co-owner of IEC/IEEE 60802.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-LAN"><td><b>LAN</b></td><td>Local Area Network</td><td>A network covering a limited area, such as a building or a vehicle; IEEE 802 standardises LANs.</td></tr><tr id="abbr-LLDP"><td><a href="https://standards.ieee.org/ieee/802.1AB/6047/"><b>LLDP</b></a></td><td>Link Layer Discovery Protocol</td><td>IEEE 802.1AB: devices advertise their identity and capabilities to their direct neighbours.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-PSFP"><td><a href="https://1.ieee802.org/tsn/802-1qci/"><b>PSFP</b></a></td><td>Per-Stream Filtering and Policing</td><td>IEEE 802.1Qci: stream filters, stream gates and flow meters that enforce each stream’s contract at ingress.</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-YANG"><td><a href="https://www.rfc-editor.org/rfc/rfc7950"><b>YANG</b></a></td><td>Yet Another Next Generation (data modelling language)</td><td>The language in which network configuration and state are modelled for NETCONF and RESTCONF (RFC 7950).</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p><strong><a href="https://www.ieee802.org/" target="_blank" rel="noopener noreferrer" class="">IEEE 802</a></strong>, the LAN/MAN Standards Committee, develops standards for local and metropolitan area networks, mainly for the link and physical layers of the stack. It has been in operation since March 1980 [1].</p>
<p><strong>IEEE 802.1</strong> is the working group responsible for the 802 architecture, for interworking between 802 networks, for security, and for network management and the protocol layers above the MAC [1]. It occupies the top of the link layer [2]: 802.1 <a href="https://en.wikipedia.org/wiki/Network_bridge" target="_blank" rel="noopener noreferrer" class="">bridges</a> forward frames between media defined by other working groups, such as 802.3 (<a href="https://standards.ieee.org/ieee/802.3/10422/" target="_blank" rel="noopener noreferrer" class="">Ethernet</a>), 802.11 (wireless LAN) and 802.15 (wireless personal area networks).</p>
<p>The <strong>TSN task group</strong> is the part of 802.1 chartered to provide deterministic services through IEEE 802 networks, which the group defines as guaranteed packet transport with bounded <a href="https://en.wikipedia.org/wiki/Latency_(engineering)" target="_blank" rel="noopener noreferrer" class="">latency</a>, low packet <a href="https://en.wikipedia.org/wiki/Packet_delay_variation" target="_blank" rel="noopener noreferrer" class="">delay variation</a> and low packet loss [1][3]. Figure 1 shows the consequence: TSN changes nothing below the MAC service and nothing above Layer 2. It amends the bridge.</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-ieee-sa.png" alt="Organisation chart of the IEEE Standards Association down to the IEEE 802 committee" loading="lazy"><figcaption>Figure 1b. Where IEEE 802 sits in the IEEE Standards Association: below the Board of Governors, the Standards Board and its committees, as one of the standards committees of the Computer Society.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 3<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-from-avb-to-tsn">2. From AVB to TSN<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#2-from-avb-to-tsn" class="hash-link" aria-label="Direct link to 2. From AVB to TSN" title="Direct link to 2. From AVB to TSN" translate="no">​</a></h2>
<figure class="nc-figure"><svg viewBox="0 0 720 150" width="720" role="img" aria-label="Timeline: AVB task group started in 2005, renamed TSN task group in 2012, merged with the Interworking task group in 2015"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><path d="M30,40 H700" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path><g><circle cx="110" cy="40" r="6" fill="var(--nc-service)"></circle><text x="110" y="18" font-size="14" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2005</text><text x="110" y="68" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">AVB task group starts:</text><text x="110" y="85" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">professional audio/video,</text><text x="110" y="102" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">consumer, infotainment</text></g><g><circle cx="360" cy="40" r="6" fill="var(--nc-service)"></circle><text x="360" y="18" font-size="14" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2012</text><text x="360" y="68" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">AVB TG renamed TSN TG:</text><text x="360" y="85" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">industrial and automotive</text><text x="360" y="102" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">use cases join</text></g><g><circle cx="610" cy="40" r="6" fill="var(--nc-service)"></circle><text x="610" y="18" font-size="14" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">2015</text><text x="610" y="68" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Interworking TG merged</text><text x="610" y="85" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">into the TSN TG</text></g></svg><figcaption>Figure 2. From Audio Video Bridging to Time-Sensitive Networking.<span class="nc-figure-source">Source: <!-- -->own drawing, dates from J. Farkas,<!-- --> <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf">Introduction to IEEE 802.1</a> (2017), slide 23.</span></figcaption></figure>
<p>The task group began in 2005 as the <a href="https://www.ieee802.org/1/pages/avbridges.html" target="_blank" rel="noopener noreferrer" class="">Audio Video Bridging</a> (AVB) task group, aimed at professional audio and video, consumer electronics and automotive infotainment. When industrial and automotive control became interested in the same features, the name no longer covered the use cases, and the group was renamed TSN in 2012. It absorbed the former Interworking task group in 2015 [2]. The original AVB work itself came out of the IEEE 802.3 Residential Ethernet study group [3].</p>
<p>Four AVB standards are therefore also TSN standards [1][3]:</p>
<table><thead><tr><th>Standard</th><th>Content</th></tr></thead><tbody><tr><td>IEEE Std <a href="https://1.ieee802.org/tsn/802-1as-2020/" target="_blank" rel="noopener noreferrer" class="">802.1AS-2011</a></td><td>Generalised <a href="https://standards.ieee.org/ieee/1588/6825/" target="_blank" rel="noopener noreferrer" class="">Precision Time Protocol</a> (gPTP), a Layer 2 profile of IEEE 1588</td></tr><tr><td>IEEE Std <a href="https://standards.ieee.org/ieee/802.1Qav/4401/" target="_blank" rel="noopener noreferrer" class="">802.1Qav-2009</a></td><td>Forwarding and queuing for time-sensitive streams: the Credit-Based Shaper (CBS)</td></tr><tr><td>IEEE Std <a href="https://standards.ieee.org/ieee/802.1Qat/4050/" target="_blank" rel="noopener noreferrer" class="">802.1Qat-2010</a></td><td>Stream Reservation Protocol (SRP)</td></tr><tr><td>IEEE Std <a href="https://standards.ieee.org/ieee/802.1BA/4396/" target="_blank" rel="noopener noreferrer" class="">802.1BA-2011</a></td><td>AVB systems: the overall architecture and profiles</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-how-to-read-a-designation">3. How to read a designation<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#3-how-to-read-a-designation" class="hash-link" aria-label="Direct link to 3. How to read a designation" title="Direct link to 3. How to read a designation" translate="no">​</a></h2>
<p>The naming rules explain most of what looks arbitrary [1]:</p>
<ul>
<li class=""><strong>Capital letters</strong> mark a stand-alone standard: <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">802.1Q</a>, 802.1AS, <a href="https://1.ieee802.org/tsn/802-1cb/" target="_blank" rel="noopener noreferrer" class="">802.1CB</a>.</li>
<li class=""><strong>Lower-case letters</strong> mark an amendment to a stand-alone standard: <a href="https://standards.ieee.org/ieee/802.1Qbv/6068/" target="_blank" rel="noopener noreferrer" class="">802.1Qbv</a> amends 802.1Q, and 802.1CBcv amends 802.1CB.</li>
<li class="">A leading <strong>P</strong> marks a project that is still in development, not a published standard.</li>
<li class="">Amendments are periodically merged into a <strong>revision</strong> of the base standard. 802.1Qbv and <a href="https://standards.ieee.org/ieee/802.1Qbu/5464/" target="_blank" rel="noopener noreferrer" class="">802.1Qbu</a>, for instance, became part of 802.1Q-2018, so their text now lives in clauses of 802.1Q.</li>
<li class="">A designation <strong>without a year</strong> means the latest revision.</li>
</ul>
<p>How amendments are merged into new editions, and how a standard is maintained and retired, is the subject of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-standards-amendments-revisions">the post on base standards, amendments and revisions</a>.</p>
<p>In practice, 802.1Q is many standards integrated into one document. A useful way into it is to read clauses 6 to 9 for the bridge architecture, then the clause titled "Principles of …" for the feature of interest [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-three-tiers-of-documents">4. Three tiers of documents<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#4-three-tiers-of-documents" class="hash-link" aria-label="Direct link to 4. Three tiers of documents" title="Direct link to 4. Three tiers of documents" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-grouping.png" alt="TSN standards grouped into profiles, configuration and base technology" loading="lazy"><figcaption>Figure 3. Three tiers of TSN standards and projects: base technology, configuration, and profiles. A profile selects and constrains tools from the lower tiers for one application.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 9<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>TSN documents fall into three tiers [1]:</p>
<ol>
<li class=""><strong>Base technology</strong>: the tools themselves, such as time synchronisation, shapers, preemption, <a href="https://en.wikipedia.org/wiki/Traffic_policing_(communications)" target="_blank" rel="noopener noreferrer" class="">policing</a> and redundancy. Each is described in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">the TSN toolbox post</a>.</li>
<li class=""><strong>Configuration</strong>: the models and protocols used to set the tools up, including the TSN configuration models of <a href="https://1.ieee802.org/tsn/802-1qcc/" target="_blank" rel="noopener noreferrer" class="">802.1Qcc</a> and a family of <a href="https://www.rfc-editor.org/rfc/rfc7950" target="_blank" rel="noopener noreferrer" class="">YANG</a> data models.</li>
<li class=""><strong>Profiles</strong>: documents that narrow the choices for one application domain. A profile selects features, options, defaults, protocols and procedures, describes how to build a network for a particular use, and gives configuration guidance where needed. Its purpose is to make interoperability and deployment easier [1].</li>
</ol>
<p>The profile standards listed by the task group today are [3]:</p>
<table><thead><tr><th>Profile</th><th>Domain</th></tr></thead><tbody><tr><td>IEEE Std 802.1BA-2021</td><td>Audio Video Bridging systems</td></tr><tr><td>IEEE Std 802.1CM-2018, amended by 802.1CMde-2020</td><td><a href="https://en.wikipedia.org/wiki/Fronthaul" target="_blank" rel="noopener noreferrer" class="">Fronthaul</a> in cellular networks</td></tr><tr><td><a href="https://1.ieee802.org/tsn/iec-ieee-60802/" target="_blank" rel="noopener noreferrer" class="">IEC/IEEE 60802</a></td><td>Industrial automation (a joint IEC and IEEE 802 project)</td></tr><tr><td>IEEE Std 802.1DG-2025</td><td>Automotive in-vehicle Ethernet</td></tr><tr><td>IEEE 802.1DP-2025 / SAE AS 6675</td><td>Aerospace onboard Ethernet</td></tr></tbody></table>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-profiles.png" alt="IEEE 802 features combined into profiles such as AVB, fronthaul and industrial automation" loading="lazy" style="max-width:min(100%, 460px)"><figcaption>Figure 3b. Profiles as the original slide shows them: a profile picks a subset of the many IEEE 802 features for one application area, such as AVB, fronthaul or industrial automation.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 11<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-how-a-standard-is-made">5. How a standard is made<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#5-how-a-standard-is-made" class="hash-link" aria-label="Direct link to 5. How a standard is made" title="Direct link to 5. How a standard is made" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/overview2018-process.png" alt="The standard development process: PAR, NesCom approval, task group ballot, working group ballot and recirculation, sponsor ballot and recirculation, RevCom approval, publication" loading="lazy" style="max-width:min(100%, 560px)"><figcaption>Figure 4. The path of an IEEE 802.1 project from authorisation to publication. Each ballot can repeat until no new comments remain; recirculation ballots are open only on the changes.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf">J. Farkas, “IEEE 802.1 TSN TG Overview,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 7<!-- -->;<!-- --> <!-- -->cropped, with the slide footer blanked<!-- -->.</span></figcaption></figure>
<p>A project starts with a Project Authorization Request (PAR), judged against the Criteria for Standards Development (CSD). Once the New Standards Committee approves it, the draft passes through three levels of ballot (task group, working group and sponsor) before the Standards Review Committee approves publication [1][2]. Technical decisions need a 75 % majority. The process rests on five principles: due process, consensus, openness, balance between interested parties, and a right of appeal [1].</p>
<p>Two practical consequences for a reader: drafts are restricted to working-group participants while presentations are public [3], which is why slide decks are often the most accessible description of a mechanism; and a "P802.1…" citation in an older paper may refer to something since published under the same letters.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-the-standards-today">6. The standards today<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#6-the-standards-today" class="hash-link" aria-label="Direct link to 6. The standards today" title="Direct link to 6. The standards today" translate="no">​</a></h2>
<p>The task group page lists the following as the base standards for TSN [3]: IEEE Std 802.1Q-2022 (bridges and bridged networks), <a href="https://standards.ieee.org/ieee/802.1AB/6047/" target="_blank" rel="noopener noreferrer" class="">802.1AB-2016</a> (<a href="https://standards.ieee.org/ieee/802.1AB/6047/" target="_blank" rel="noopener noreferrer" class="">LLDP</a>), 802.1AS-2025 (timing and synchronisation), 802.1AX-2020 (<a href="https://en.wikipedia.org/wiki/Link_aggregation" target="_blank" rel="noopener noreferrer" class="">link aggregation</a>), 802.1CB-2017 (frame replication and elimination) and <a href="https://1.ieee802.org/tsn/802-1cs/" target="_blank" rel="noopener noreferrer" class="">802.1CS-2020</a> (link-local registration protocol).</p>
<p>The amendments most often met in the analysis literature are these [3]:</p>
<table><thead><tr><th>Standard</th><th>Title</th><th>Status in 802.1Q</th></tr></thead><tbody><tr><td><a href="https://standards.ieee.org/ieee/802.1Qca/5557/" target="_blank" rel="noopener noreferrer" class="">802.1Qca-2015</a></td><td>Path Control and Reservation</td><td>Rolled into 802.1Q-2018</td></tr><tr><td>802.1Qbv-2015</td><td>Enhancements for Scheduled Traffic</td><td>Rolled into 802.1Q-2018</td></tr><tr><td>802.1Qbu-2016</td><td>Frame Preemption</td><td>Rolled into 802.1Q-2018</td></tr><tr><td><a href="https://1.ieee802.org/tsn/802-1qci/" target="_blank" rel="noopener noreferrer" class="">802.1Qci-2017</a></td><td>Per-Stream Filtering and Policing</td><td>Rolled into 802.1Q-2018</td></tr><tr><td><a href="https://1.ieee802.org/tsn/802-1qch/" target="_blank" rel="noopener noreferrer" class="">802.1Qch-2017</a></td><td>Cyclic Queuing and Forwarding</td><td>Rolled into 802.1Q-2018</td></tr><tr><td>802.1Qcc-2018</td><td>SRP Enhancements and Performance Improvements</td><td>Amends 802.1Q-2018</td></tr><tr><td><a href="https://1.ieee802.org/tsn/802-1qcr/" target="_blank" rel="noopener noreferrer" class="">802.1Qcr-2020</a></td><td>Asynchronous Traffic Shaping</td><td>Amends 802.1Q-2018</td></tr><tr><td><a href="https://standards.ieee.org/ieee/802.1Qcw/7134/" target="_blank" rel="noopener noreferrer" class="">802.1Qcw-2023</a></td><td>YANG for scheduled traffic, preemption and PSFP</td><td>Amends 802.1Q-2022</td></tr><tr><td>802.1Qdj-2024</td><td>Configuration Enhancements for TSN</td><td>Amends 802.1Q-2022</td></tr></tbody></table>
<p>Projects under way at the time of writing include <a href="https://1.ieee802.org/tsn/802-1dd/" target="_blank" rel="noopener noreferrer" class="">P802.1DD</a> (Resource Allocation Protocol), P802.1DU (cut-through forwarding bridges), P802.1Qdq (shaper parameter settings for bursty traffic requiring bounded latency) and P802.1Qee (traffic engineering for bridged networks that include wireless technologies) [3].</p>
<div class="theme-admonition theme-admonition-note admonition_U78o alert alert--secondary"><div class="admonitionHeading_hpf8"><span class="admonitionIcon_bCJT"><svg viewBox="0 0 14 16"><path fill-rule="evenodd" d="M6.3 5.69a.942.942 0 0 1-.28-.7c0-.28.09-.52.28-.7.19-.18.42-.28.7-.28.28 0 .52.09.7.28.18.19.28.42.28.7 0 .28-.09.52-.28.7a1 1 0 0 1-.7.3c-.28 0-.52-.11-.7-.3zM8 7.99c-.02-.25-.11-.48-.31-.69-.2-.19-.42-.3-.69-.31H6c-.27.02-.48.13-.69.31-.2.2-.3.44-.31.69h1v3c.02.27.11.5.31.69.2.2.42.31.69.31h1c.27 0 .48-.11.69-.31.2-.19.3-.42.31-.69H8V7.98v.01zM7 2.3c-3.14 0-5.7 2.54-5.7 5.68 0 3.14 2.56 5.7 5.7 5.7s5.7-2.55 5.7-5.7c0-3.15-2.56-5.69-5.7-5.69v.01zM7 .98c3.86 0 7 3.14 7 7s-3.14 7-7 7-7-3.12-7-7 3.14-7 7-7z"></path></svg></span>Why this matters for analysis</div><div class="admonitionContent_PHbT"><p>A <a href="https://en.wikipedia.org/wiki/Network_calculus" target="_blank" rel="noopener noreferrer" class="">network calculus</a> model is a model of a specific clause of 802.1Q. Knowing that "Qbv", "scheduled traffic" and "the Time-Aware Shaper" are the same mechanism, now part of the base standard, avoids treating one mechanism as three.</p></div></div>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="recommended-viewing">Recommended viewing<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#recommended-viewing" class="hash-link" aria-label="Direct link to Recommended viewing" title="Direct link to Recommended viewing" translate="no">​</a></h2>
<p>The IEEE Standards Association hosts a six-part on-demand TSN webinar series [4]. The two most useful as a complement to this post are <em>The Impact of Time-Sensitive Networks: An Introduction to IEEE 802.1</em> and <em>Driving Digital Transformation through IEEE 802.1 TSN: An Overview of Time-Sensitive Networking</em>; the others cover IEC/IEEE 60802, 802.1CM for fronthaul, Audio Video Bridging and 802.1AS.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1-tsn-task-group#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J. Farkas, "IEEE 802.1 Time-Sensitive Networking (TSN) Task Group Overview," DetNet–TSN workshop, 11 November 2018. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-overview-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">IEEE 802.1, <em>Time-Sensitive Networking (TSN) Task Group</em>. <a href="https://1.ieee802.org/tsn/" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
<li class="">IEEE Standards Association, <em>TSN Webinar Series</em>. <a href="https://engagestandards.ieee.org/TSN-Webinar-Series.html" target="_blank" rel="noopener noreferrer" class="">Web page</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>Presentation</category>
            <category>IEEE 802.1</category>
            <category>TSN</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1Q: the bridge, its architecture, data-plane actions and forwarding process]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge</guid>
            <pubDate>Tue, 17 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How an IEEE 802.1Q bridge is organised. The control and data planes, the actions taken at the ingress port, the relay and the egress port, the steps of the forwarding process, and the topology layers the control plane manages. These are the parts that every TSN tool extends.]]></description>
            <content:encoded><![CDATA[<p>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.</p>
<!-- -->
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-bridge-architecture.png" alt="Simplified baggy-pants model of a MAC bridge: control plane with higher layer entities and an external agent above a data plane made of a relay and two ports" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 1. The simplified “baggy pants” model of a MAC bridge. The control plane (higher layer entities, or an external agent such as an SDN controller) sits above a data plane made of a relay and at least two ports. Below the ports, media-specific functions connect each port to its LAN, for example IEEE 802.3 Ethernet.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 7<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->26<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-ATS"><td><a href="https://1.ieee802.org/tsn/802-1qcr/"><b>ATS</b></a></td><td>Asynchronous Traffic Shaping</td><td>IEEE 802.1Qcr: per-stream token-bucket shaping at every hop using local clocks only.</td></tr><tr id="abbr-CBS"><td><a href="https://standards.ieee.org/ieee/802.1Qav/4401/"><b>CBS</b></a></td><td>Credit-Based Shaper</td><td>The IEEE 802.1Qav shaper that limits a traffic class to its reserved rate (idleSlope) with a per-queue credit. In MEF bandwidth profiles, CBS instead means Committed Burst Size.</td></tr><tr id="abbr-CNC"><td><a href="https://1.ieee802.org/tsn/802-1qcc/"><b>CNC</b></a></td><td>Centralized Network Configuration</td><td>The 802.1Qcc entity that computes paths, schedules and reservations for the whole network and configures the bridges.</td></tr><tr id="abbr-CQF"><td><a href="https://1.ieee802.org/tsn/802-1qch/"><b>CQF</b></a></td><td>Cyclic Queuing and Forwarding</td><td>IEEE 802.1Qch: two queues per class alternate every cycle, so a frame advances one hop per cycle.</td></tr><tr id="abbr-FRER"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>FRER</b></a></td><td>Frame Replication and Elimination for Reliability</td><td>IEEE 802.1CB: frames are numbered, sent over disjoint paths, and duplicates are removed.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IETF"><td><a href="https://www.ietf.org/"><b>IETF</b></a></td><td>Internet Engineering Task Force</td><td>The body that develops Internet standards, published as RFCs.</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-LAN"><td><b>LAN</b></td><td>Local Area Network</td><td>A network covering a limited area, such as a building or a vehicle; IEEE 802 standardises LANs.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MMRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MMRP</b></a></td><td>Multiple MAC Registration Protocol</td><td>The MRP application that registers multicast MAC addresses.</td></tr><tr id="abbr-MRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MRP</b></a></td><td>Multiple Registration Protocol</td><td>IEEE 802.1ak, now in 802.1Q: the framework for declaring and registering attributes such as VLANs, multicast addresses and streams.</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-MVRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MVRP</b></a></td><td>Multiple VLAN Registration Protocol</td><td>The MRP application that registers VLAN membership, so that VLAN traffic only goes where members are.</td></tr><tr id="abbr-PCE"><td><a href="https://www.rfc-editor.org/rfc/rfc4655"><b>PCE</b></a></td><td>Path Computation Element</td><td>An entity that computes paths or trees from the network topology and constraints (RFC 4655).</td></tr><tr id="abbr-PCR"><td><a href="https://standards.ieee.org/ieee/802.1Qca/5557/"><b>PCR</b></a></td><td>Path Control and Reservation</td><td>IEEE 802.1Qca: IS-IS extensions with which a controller installs explicit, non-shortest trees (RFC 7813). In ATM, PCR instead means Peak Cell Rate.</td></tr><tr id="abbr-PSFP"><td><a href="https://1.ieee802.org/tsn/802-1qci/"><b>PSFP</b></a></td><td>Per-Stream Filtering and Policing</td><td>IEEE 802.1Qci: stream filters, stream gates and flow meters that enforce each stream’s contract at ingress.</td></tr><tr id="abbr-QoS"><td><b>QoS</b></td><td>Quality of Service</td><td>The treatment a network gives to a flow or class, in terms of bandwidth, delay, jitter and loss.</td></tr><tr id="abbr-RSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>RSTP</b></a></td><td>Rapid Spanning Tree Protocol</td><td>IEEE 802.1w, now in 802.1Q: a faster-converging spanning tree with alternate and backup port roles.</td></tr><tr id="abbr-SDN"><td><a href="https://www.rfc-editor.org/rfc/rfc7426"><b>SDN</b></a></td><td>Software-Defined Networking</td><td>An architecture that separates the control plane, run by a logically centralised controller, from the data plane of the network elements (RFC 7426).</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TAS"><td><a href="https://standards.ieee.org/ieee/802.1Qbv/6068/"><b>TAS</b></a></td><td>Time-Aware Shaper</td><td>IEEE 802.1Qbv scheduled traffic: a gate per queue, opened and closed by a repeating gate control list.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-VID"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VID</b></a></td><td>VLAN Identifier</td><td>The 12-bit field of the 802.1Q tag that names a frame’s VLAN.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>A <strong>bridge</strong> relays <a href="https://standards.ieee.org/ieee/802.3/10422/" target="_blank" rel="noopener noreferrer" class="">Ethernet</a> frames between two or more LANs at Layer 2. The bridges of TSN are specified in <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Q</a>, <em>Bridges and Bridged Networks</em>, which also defines <a href="https://en.wikipedia.org/wiki/VLAN" target="_blank" rel="noopener noreferrer" class="">virtual LANs</a> [1][4].</p>
<p>Four principles from the IEEE 802.1 tutorial frame everything else [1]:</p>
<ul>
<li class=""><strong>MAC addresses identify, they do not locate.</strong> A <a href="https://en.wikipedia.org/wiki/MAC_address" target="_blank" rel="noopener noreferrer" class="">MAC address</a> names a station, not where it is. The tutorial calls this a major Layer 2 value, not a defect.</li>
<li class=""><strong>Forwarding uses the destination MAC address and the VLAN ID.</strong></li>
<li class=""><strong>Unknown destinations are flooded, known ones are filtered.</strong> A frame whose destination location is not known is sent to every port of its VLAN except the one it arrived on. Once the location is known, the other ports are filtered out.</li>
<li class=""><strong>Quality of service comes after the forwarding decision.</strong> It is based on the frame's priority, its drop eligibility, and time.</li>
</ul>
<p>The last principle is where TSN enters: almost every TSN tool acts after the bridge has decided where a frame goes, and decides <em>when</em> and <em>whether</em> it goes there.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-architecture-control-plane-and-data-plane">2. Architecture: control plane and data plane<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#2-architecture-control-plane-and-data-plane" class="hash-link" aria-label="Direct link to 2. Architecture: control plane and data plane" title="Direct link to 2. Architecture: control plane and data plane" translate="no">​</a></h2>
<p>Figure 1 separates the two planes [2][3]:</p>
<ul>
<li class="">the <strong>control plane</strong> runs the control protocols as <em>higher layer entities</em> inside the bridge. Alternatively, an <strong>external agent</strong>, such as an <a href="https://www.rfc-editor.org/rfc/rfc7426" target="_blank" rel="noopener noreferrer" class="">SDN controller</a>, provides the control instead of the distributed protocols;</li>
<li class="">the <strong>data plane</strong> is made of a <strong>MAC relay</strong> and <strong>at least two ports</strong>.</li>
</ul>
<p>The external agent is what the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/sdn-and-tsn-configuration">SDN post</a> calls the CNC. The standard's own, more detailed picture is Figure 8-2, "VLAN-aware Bridge architecture", of 802.1Q [2].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-bridge-components.png" alt="A bridge specified as an A component and a B component with typed ports, implemented as a single relay with a port that combines the X, Y and Z functions" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 2. Specification versus implementation. 802.1Q describes a bridge as components (here A and B) whose ports have distinct types according to their role. A real bridge often implements all of them on a single relay, with one port combining several functions.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 14<!-- -->;<!-- --> <!-- -->cropped, with the slide text beside the figure removed<!-- -->.</span></figcaption></figure>
<p>The standard describes a bridge as a set of <strong>components</strong>, one per type of Layer 2 virtual network, each with typed ports. This is a description language: it specifies the operation in distinct steps. It does not prescribe an implementation. Implementations often use a single MAC relay, and one physical port may implement several port functions. When the outermost EtherType of a frame does not match the component type, the reception port assigns the frame to a VLAN [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-data-plane-actions">3. Data-plane actions<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#3-data-plane-actions" class="hash-link" aria-label="Direct link to 3. Data-plane actions" title="Direct link to 3. Data-plane actions" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-data-plane-actions.png" alt="The baggy-pants bridge redrawn as a pipeline: ingress port, relay and egress port, each with an action set and a table" loading="lazy"><figcaption>Figure 3. The data plane redrawn as a pipeline. Each stage applies an action set, using its own table. “Baggy pants” is just the simple drawing of the same pipeline.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 8<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>The baggy-pants drawing can be unfolded into a pipeline of three stages. Each applies an <strong>action set</strong> driven by a table [2][3]:</p>
<table><thead><tr><th>Stage</th><th>Action set</th><th>Actions</th><th>TSN additions at this stage</th></tr></thead><tbody><tr><td>Ingress port</td><td>Action set 1</td><td>Filtering (drop), tagging and untagging, VID translation, de- and encapsulation</td><td>Stream identification, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/per-stream-filtering-and-policing">PSFP</a>, the ingress side of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">FRER</a></td></tr><tr><td>Relay</td><td>Action set 2</td><td>Forwarding, filtering</td><td>Explicit trees (<a href="https://standards.ieee.org/ieee/802.1Qca/5557/" target="_blank" rel="noopener noreferrer" class="">802.1Qca</a>), replication and elimination</td></tr><tr><td>Egress port</td><td>Action set 3</td><td>Filtering, tagging and untagging, VID translation, de- and encapsulation, metering, queuing, transmission selection</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/credit-based-shaper">CBS</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/asynchronous-traffic-shaping">ATS</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/time-aware-shaper">TAS</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/cyclic-queuing-and-forwarding">CQF</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qbu-frame-preemption">preemption</a></td></tr></tbody></table>
<p>Most TSN tools therefore act on the egress port, where queuing and transmission selection happen.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-the-forwarding-process">4. The forwarding process<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#4-the-forwarding-process" class="hash-link" aria-label="Direct link to 4. The forwarding process" title="Direct link to 4. The forwarding process" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-forwarding-process.png" alt="The forwarding process of IEEE 802.1Q from reception port to transmission port, with the sub-clause of each step" loading="lazy"><figcaption>Figure 4. The forwarding process of IEEE 802.1Q, from the reception port to the transmission port. Each box is a sub-clause of clause 8.6 of the standard. Frame filtering consults the filtering database, and queue management acts on the queues.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 9<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>Inside the data plane, 802.1Q specifies the forwarding process as a fixed sequence of steps, each in its own sub-clause of clause 8.6 [2][3]:</p>
<table><thead><tr><th>Step</th><th>Sub-clause</th><th>What it does</th></tr></thead><tbody><tr><td>Active topology enforcement</td><td>8.6.1</td><td>Discards frames that would use a port not in the active topology for that frame, for example a port blocked by the spanning tree</td></tr><tr><td>Ingress</td><td>8.6.2</td><td>Assigns a VLAN to frames that arrive without one, and drops frames from ports that are not members of the frame's VLAN</td></tr><tr><td>Frame filtering</td><td>8.6.3</td><td>Looks up the destination MAC address and VLAN ID in the <strong>filtering database</strong> to choose the output ports</td></tr><tr><td>Egress</td><td>8.6.4</td><td>Applies the output port's VLAN membership and tagging rules</td></tr><tr><td>Flow metering</td><td>8.6.5</td><td>Meters frames against a bandwidth profile; per-stream filtering and policing extends this step</td></tr><tr><td>Queuing frames</td><td>8.6.6</td><td>Places each frame in the queue of its traffic class at the output port</td></tr><tr><td>Queue management</td><td>8.6.7</td><td>Removes frames from the queues, for example frames held too long</td></tr><tr><td>Transmission selection</td><td>8.6.8</td><td>Chooses the next frame to send, among the queues allowed to transmit</td></tr></tbody></table>
<p>Reading the TSN standards becomes much easier with this list in mind. Each amendment says which of these sub-clauses it changes. For example, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/time-aware-shaper">scheduled traffic</a> adds gates to transmission selection (8.6.8), and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/asynchronous-traffic-shaping">asynchronous traffic shaping</a> adds a shaper in front of it.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-quality-of-service-functions">5. Quality-of-service functions<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#5-quality-of-service-functions" class="hash-link" aria-label="Direct link to 5. Quality-of-service functions" title="Direct link to 5. Quality-of-service functions" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-qos-functions.png" alt="QoS functions of a bridge port: filtering and policing, shaping, queuing and transmission selection" loading="lazy"><figcaption>Figure 5. The QoS functions of a port, in order from frame reception to frame transmission. Filtering, policing and shaping can work per stream or per class; queuing and transmission selection work per class. Together they form a hierarchy.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 10<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>Figure 5 isolates the quality-of-service functions of a port [2]:</p>
<ol>
<li class=""><strong>Filtering and policing</strong>, which can be per stream or per class;</li>
<li class=""><strong>Shaping</strong>, also per stream or per class;</li>
<li class=""><strong>Queuing</strong> and <strong>transmission selection</strong>, which are per class.</li>
</ol>
<p>The order matters for analysis. Policing makes a stream respect its <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">arrival curve</a> before it meets other traffic. Shaping changes the curve. Queuing and transmission selection then define the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/service-curves">service curve</a> that each class receives.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-what-the-control-plane-controls">6. What the control plane controls<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#6-what-the-control-plane-controls" class="hash-link" aria-label="Direct link to 6. What the control plane controls" title="Direct link to 6. What the control plane controls" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-topology-layers.png" alt="Topology layers of a bridged network stacked as planes: physical network topology, active topology, VLAN topology and station location" loading="lazy"><figcaption>Figure 6. The topology layers of a bridged network. Each layer is a subset, real or not, of the one below it: the physical network topology, the active topology, the VLAN topology, and the station locations (the MAC address topology).<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 25<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>The control plane maintains four layered views of the network [1][3]:</p>
<table><thead><tr><th>Layer</th><th>Content</th><th>Maintained by, for example</th></tr></thead><tbody><tr><td>Physical network topology</td><td>All links and bridges</td><td>Management (enabling and disabling ports)</td></tr><tr><td>Active topology</td><td>The links actually used: a spanning tree, shortest paths, or traffic-engineered paths</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree">RSTP</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree">MSTP</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control">path control (PCR)</a></td></tr><tr><td>VLAN topology</td><td>Which bridges and ports belong to each VLAN</td><td><a class="" href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp">MVRP</a>, SPB, PCR, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">SRP</a></td></tr><tr><td>Station location</td><td>Where each MAC address is</td><td>Source address learning, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp">MMRP</a>, SPB, PCR, SRP</td></tr></tbody></table>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/intro2017-control-plane.png" alt="Control plane overview: VLANs assigned to control modes, and the control options for each topology layer" loading="lazy"><figcaption>Figure 7. Control options. Each VLAN is assigned a control mode: spanning tree, shortest path bridging (IS-IS), or an external agent for software-defined VLANs. Several modes can coexist in one network, and an external agent can use non-802.1 protocols.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf">J. Farkas, “Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group,” IEEE 802.1, 15 May 2017</a>, <!-- -->slide 49<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>Each of these protocols has its own post: <a class="" href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree">RSTP</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree">MSTP</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control">path control</a>, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp">MRP and MVRP</a>, and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">SRP</a>.</p>
<p>Control modes are assigned per VLAN. Distributed protocols and an external agent can therefore coexist in the same network, each controlling its own VLANs. The external control can even be a non-802.1 protocol, such as PCE or GMPLS [3]. This hybrid model is what lets a TSN network keep spanning tree for ordinary traffic while a CNC installs explicit paths for streams.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="7-where-tsn-plugs-in">7. Where TSN plugs in<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#7-where-tsn-plugs-in" class="hash-link" aria-label="Direct link to 7. Where TSN plugs in" title="Direct link to 7. Where TSN plugs in" translate="no">​</a></h2>
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 8. The same bridge as Figures 1 and 3, with the TSN tools added to each stage (own summary drawing; the 802.1 standard of each tool in brackets).<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<p><a class="" href="https://cnam-ece.github.io/learning-materials/blog/tsn-toolbox">The TSN toolbox post</a> goes through the tools of Figure 8 one by one. Each has its own post in the TSN topic.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slides 12, 14 and 25. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "TSN Basic Concepts," DetNet–TSN workshop, 11 November 2018, slides 7–10. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017, slides 28 and 47–49. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">IEEE, <em>IEEE 802.1Q-2022, Bridges and Bridged Networks</em>. <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">IEEE SA</a>. IEEE 802 standards are available free of charge through the <a href="https://standards.ieee.org/products-programs/ieee-get-program/" target="_blank" rel="noopener noreferrer" class="">IEEE GET Program</a>.</li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>TSN</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1Qat SRP: the Stream Reservation Protocol]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How the Stream Reservation Protocol registers a stream, reserves resources along its path and accumulates its worst-case latency. What a talker advertise carries, how listeners subscribe, and how MSRP builds on MRP and MVRP.]]></description>
            <content:encoded><![CDATA[<p>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. <a class="" href="https://cnam-ece.github.io/learning-materials/blog/stream-reservation">The stream reservation post</a> places SRP among later reservation approaches and derives the latency bound that each bridge has to compute.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where SRP acts: in the control plane, where it registers streams, and on the queues and shapers it configures for each admitted stream.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->12<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-AVB"><td><a href="https://www.ieee802.org/1/pages/avbridges.html"><b>AVB</b></a></td><td>Audio Video Bridging</td><td>The predecessor of TSN: gPTP, the credit-based shaper and stream reservation, combined for audio and video (profile: IEEE 802.1BA).</td></tr><tr id="abbr-gPTP"><td><a href="https://1.ieee802.org/tsn/802-1as-2020/"><b>gPTP</b></a></td><td>generalized Precision Time Protocol</td><td>The profile of PTP defined by IEEE 802.1AS, in which every bridge takes part in time distribution.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MMRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MMRP</b></a></td><td>Multiple MAC Registration Protocol</td><td>The MRP application that registers multicast MAC addresses.</td></tr><tr id="abbr-MRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MRP</b></a></td><td>Multiple Registration Protocol</td><td>IEEE 802.1ak, now in 802.1Q: the framework for declaring and registering attributes such as VLANs, multicast addresses and streams.</td></tr><tr id="abbr-MSRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>MSRP</b></a></td><td>Multiple Stream Registration Protocol</td><td>The MRP application at the core of SRP that registers streams and reserves bridge resources.</td></tr><tr id="abbr-MVRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MVRP</b></a></td><td>Multiple VLAN Registration Protocol</td><td>The MRP application that registers VLAN membership, so that VLAN traffic only goes where members are.</td></tr><tr id="abbr-PCP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>PCP</b></a></td><td>Priority Code Point</td><td>The 3-bit priority field of the 802.1Q tag (priorities 0 to 7).</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>The <strong>Stream Reservation Protocol</strong> implements <strong>admission control</strong> for Ethernet. It was standardised as IEEE 802.1Qat in September 2010 and incorporated into IEEE 802.1Q-2011. Work started in 2006 [1][2]. SRP defines the concept of a <strong>stream</strong> at Layer 2. It provides end-to-end management of a stream's resources, so that its quality of service is guaranteed [1]. It is part of the AVB and TSN standards [1].</p>
<p>SRP is built from three MRP applications [1]:</p>
<ul>
<li class=""><strong>MSRP</strong>, the Multiple Stream Registration Protocol, registers and advertises streams and reserves bridge resources for them;</li>
<li class=""><strong>MVRP</strong> makes the bridges on the path members of the stream's VLAN (see <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp">the MRP post</a>);</li>
<li class=""><strong>MMRP</strong> controls the propagation of group registrations.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-talkers-listeners-and-the-reservation-sequence">2. Talkers, listeners and the reservation sequence<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#2-talkers-listeners-and-the-reservation-sequence" class="hash-link" aria-label="Direct link to 2. Talkers, listeners and the reservation sequence" title="Direct link to 2. Talkers, listeners and the reservation sequence" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-srp-example.png" alt="A talker advertise propagating through bridges to listeners, with the accumulated latency increased at each bridge, and listener ready messages returning" loading="lazy"><figcaption>Figure 2. A stream reservation on the IEEE 802.1 slide: the talker advertise travels from bridge to bridge with its accumulated latency increased at each one, and listener ready messages travel back to the talker.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 53<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>Two roles take part [1]:</p>
<ul>
<li class=""><strong>talkers</strong> announce the streams they can supply;</li>
<li class=""><strong>listeners</strong> state which streams they want to receive.</li>
</ul>
<p>SRP then works in five steps [1]:</p>
<ol>
<li class="">A talker <strong>advertises</strong> a stream.</li>
<li class="">The bridges <strong>register</strong> the paths along the data flow.</li>
<li class="">Each bridge <strong>calculates the worst-case latency</strong>.</li>
<li class="">The bridges establish an <strong>AVB domain</strong>.</li>
<li class="">The bridges <strong>reserve the bandwidth</strong> for the stream.</li>
</ol>
<p>If a bridge can reserve the required resources, it propagates the advertisement further. Otherwise a <strong>talker failed</strong> message is raised, carrying the identity of the bridge and a failure code. When the advertise reaches a listener, the listener answers with <strong>listener ready</strong>, which propagates back to the talker [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/srp-talker-advertise.png" alt="A talker advertise propagating from bridge to bridge; in each bridge a registration on the input port becomes a declaration on the output ports" loading="lazy"><figcaption>Figure 3. The talker advertise spreads like any MRP declaration: registered (R) on the port where it arrives and declared (D) on the other ports, until it reaches the intended listener and other end stations.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Talker-Advertise-b.pdf">Talker-Advertise-b.pdf</a> by <!-- -->Michael Johas Teener (Mikejt)<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Time-Sensitive_Networking">Time-Sensitive Networking</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by-sa/3.0/">CC BY-SA 3.0</a>; page 1 rendered from PDF to PNG, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>Either message can be deregistered, which ends the stream. Periodic re-declarations detect devices that stop responding [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-what-a-talker-advertise-carries">3. What a talker advertise carries<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#3-what-a-talker-advertise-carries" class="hash-link" aria-label="Direct link to 3. What a talker advertise carries" title="Direct link to 3. What a talker advertise carries" translate="no">​</a></h2>
<table><thead><tr><th>Field</th><th>Changes along the path?</th></tr></thead><tbody><tr><td>Stream ID: the talker's 48-bit MAC address plus a 16-bit unique ID</td><td>No</td></tr><tr><td>Stream destination address (or a multicast group MAC address)</td><td>No</td></tr><tr><td>VLAN ID (used by MVRP) and priority (PCP)</td><td>No</td></tr><tr><td>Rank (emergency or not)</td><td>No</td></tr><tr><td>Traffic specification: maximum frame size, maximum frames per measurement interval</td><td>No</td></tr><tr><td><strong>Accumulated latency</strong></td><td>Increased at every bridge</td></tr><tr><td>Failure information: bridge ID and failure code</td><td>Set where the reservation fails</td></tr></tbody></table>
<p>The required bandwidth is the maximum frame size multiplied by the maximum number of frames per interval [1]. For the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/credit-based-shaper">credit-based shaper</a>, SR class A has a 2 ms worst-case latency target and a 125 µs measurement interval, and class B 50 ms and 250 µs, over at most 7 hops [1]. Each bridge adds its residence delay and the peer delay measured by <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1as-time-synchronization">gPTP</a> to the accumulated latency. Higher layers can use the result for media synchronisation [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-avb-domains">4. AVB domains<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#4-avb-domains" class="hash-link" aria-label="Direct link to 4. AVB domains" title="Direct link to 4. AVB domains" translate="no">​</a></h2>
<p>Reservations are made only inside an SRP domain, in which every bridge supports SRP and the stream's SR class; the domain is part of the reservation sequence above [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/avb-domains.svg" alt="Two AVB domains made of AVB bridges and end points; a path that crosses a non-AVB bridge cannot carry a reserved stream" loading="lazy"><figcaption>Figure 4. SRP reserves only within an AVB domain. Ports at the domain boundary filter or re-tag the priority of reserved traffic, so that a path through a non-AVB bridge never carries a reserved stream.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:AVB-Ethernet-connections.svg">AVB-Ethernet-connections.svg</a> by <!-- -->Michael Johas Teener (Mikejt), converted from PDF and cleaned up by Johannes Rössel<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Time-Sensitive_Networking">Time-Sensitive Networking</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by-sa/3.0/">CC BY-SA 3.0</a>.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-from-srp-to-newer-reservation">5. From SRP to newer reservation<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#5-from-srp-to-newer-reservation" class="hash-link" aria-label="Direct link to 5. From SRP to newer reservation" title="Direct link to 5. From SRP to newer reservation" translate="no">​</a></h2>
<p>SRP set the pattern of distributed admission control that later standards keep. Its limitations shaped them [3][4]:</p>
<ul>
<li class=""><strong>Configuration without the protocol.</strong> <a class="" href="https://cnam-ece.github.io/learning-materials/blog/sdn-and-tsn-configuration">802.1Qcc</a> enhances SRP and also allows reservations configured at boot time, without running the protocol.</li>
<li class=""><strong>Proofs for the latency fields.</strong> The example latency formulas behind the accumulated latency lacked formal proof and were later shown to be inaccurate.</li>
<li class=""><strong>Token buckets instead of frame counts.</strong> The Resource Allocation Protocol (P802.1DD) replaces the frames-per-interval traffic specification with a token bucket, which suits <a class="" href="https://cnam-ece.github.io/learning-materials/blog/arrival-curves">network calculus</a> better.</li>
</ul>
<p><a class="" href="https://cnam-ece.github.io/learning-materials/blog/stream-reservation">The stream reservation post</a> develops these points and the per-bridge latency bound.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">Wikipedia, "Stream Reservation Protocol." <a href="https://en.wikipedia.org/wiki/Stream_Reservation_Protocol" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">IEEE, <em>IEEE 802.1Qat-2010, Stream Reservation Protocol</em>. <a href="https://standards.ieee.org/ieee/802.1Qat/4050/" target="_blank" rel="noopener noreferrer" class="">IEEE SA</a></li>
<li class="">D. Pannell, "An Introduction to AVB (Audio Video Bridging), the 1st TSN Profile," IEEE SA TSN webinar series, June 2022, slides 18 and 28. <a href="https://www.ieee802.org/1/files/public/docs2022/webinar-pannell-AVB-0622.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">A. Grigorjew, S. Geissler, J. Schmitt, T. Hossfeld, "Decentralized Latency Models and Information Flow for TSN Shapers – A Tutorial," arXiv:2610.11999, 2026, Section V. <a href="https://arxiv.org/abs/2610.11999" target="_blank" rel="noopener noreferrer" class="">arXiv</a></li>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slide 53. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>TSN</category>
            <category>Reservation</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1aq SPB: shortest path bridging with IS-IS]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[Shortest Path Bridging replaces the shared spanning tree with one shortest path tree per bridge, computed by IS-IS from a common link-state database. SPBV and SPBM, equal-cost trees, failure recovery, and why symmetric, computed paths suit deterministic networks.]]></description>
            <content:encoded><![CDATA[<p>Spanning trees avoid loops by switching links off. Shortest Path Bridging (SPB) avoids loops differently: every bridge computes its own shortest path tree from a shared view of the network, so all links can be used. It brings to Ethernet the link-state routing that IP networks have long used.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where SPB acts: in the control plane, where IS-IS replaces the spanning tree protocols. The data plane still forwards on destination MAC address and VLAN ID, using the filtering entries SPB computes.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->16<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-ECT"><td><b>ECT</b></td><td>Equal Cost Tree</td><td>In SPB and PCR, an algorithm that chooses one tree among several of equal cost; each one is used through its own VID.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IP"><td><a href="https://www.rfc-editor.org/rfc/rfc791"><b>IP</b></a></td><td>Internet Protocol</td><td>The network-layer protocol of the Internet (IPv4, RFC 791; IPv6, RFC 8200).</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MPLS"><td><a href="https://www.rfc-editor.org/rfc/rfc3031"><b>MPLS</b></a></td><td>Multiprotocol Label Switching</td><td>Forwarding of packets on short labels along label-switched paths (RFC 3031).</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-RFC"><td><a href="https://www.rfc-editor.org/"><b>RFC</b></a></td><td>Request for Comments</td><td>The document series in which IETF standards and related documents are published.</td></tr><tr id="abbr-RSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>RSTP</b></a></td><td>Rapid Spanning Tree Protocol</td><td>IEEE 802.1w, now in 802.1Q: a faster-converging spanning tree with alternate and backup port roles.</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-SPBM"><td><b>SPBM</b></td><td>Shortest Path Bridging – MAC</td><td>The SPB mode built on Provider Backbone Bridges, with trees identified by backbone MAC addresses and no backbone learning.</td></tr><tr id="abbr-SPBV"><td><b>SPBV</b></td><td>Shortest Path Bridging – VID</td><td>The SPB mode in which shortest path trees are identified by VLAN IDs; flooding and learning, plug and play.</td></tr><tr id="abbr-SPT"><td><b>SPT</b></td><td>Shortest Path Tree</td><td>In SPB, the tree of shortest paths from one bridge to all others; each bridge forwards only on its own SPT.</td></tr><tr id="abbr-STP"><td><b>STP</b></td><td>Spanning Tree Protocol</td><td>The original 802.1D protocol that blocks redundant links to leave a loop-free tree; now replaced by RSTP.</td></tr><tr id="abbr-VID"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VID</b></a></td><td>VLAN Identifier</td><td>The 12-bit field of the 802.1Q tag that names a frame’s VLAN.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p><strong>IEEE 802.1aq</strong>, <em>Shortest Path Bridging</em>, is an amendment to <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Q</a>, approved in March 2012 and later incorporated into 802.1Q-2014 [1]. Its aims are as follows [1]:</p>
<ul>
<li class="">replace STP, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree">RSTP</a> and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree">MSTP</a>, which block redundant paths, with a control plane that keeps all paths active;</li>
<li class="">support much larger Layer 2 topologies, with faster convergence;</li>
<li class="">spread load over all paths of a mesh;</li>
<li class="">preserve the plug-and-play nature of Ethernet.</li>
</ul>
<p>Its control plane is <strong>IS-IS</strong>, the link-state routing protocol, extended with a few TLVs specified in <a href="https://www.rfc-editor.org/rfc/rfc6329" target="_blank" rel="noopener noreferrer" class="">RFC 6329</a>. SPB needs no change to the IS-IS state machine, only a new protocol identifier and these TLVs [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-active-topology.png" alt="Five bridges controlled by RSTP (one shared tree), MSTP (one tree per group of VLANs) and SPB (one shortest path tree per bridge)" loading="lazy"><figcaption>Figure 2. SPB compared with the spanning tree protocols (right): each bridge has its own shortest path tree, instead of all traffic sharing one or a few spanning trees.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 26<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-how-it-works">2. How it works<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#2-how-it-works" class="hash-link" aria-label="Direct link to 2. How it works" title="Direct link to 2. How it works" translate="no">​</a></h2>
<p>The IEEE 802.1 tutorial summarises the principle as "computation instead of signaling" [2]:</p>
<ol>
<li class="">IS-IS runs between SPB bridges and floods <strong>link-state</strong> information. Every bridge holds an identical replica of a database with the topology, the properties of the bridges, and service information [2].</li>
<li class="">From that database, every bridge independently computes <strong>symmetric shortest path trees</strong> from each participating bridge to all others [1].</li>
<li class="">Each bridge fills its filtering database from the result. A frame is forwarded only along the shortest path tree of the bridge where it entered [1][2].</li>
</ol>
<p>The MAC service model of Ethernet, such as in-order delivery, is preserved [2].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-spb-spt.png" alt="Shortest path trees of bridges A and C over four SPT bridges running ISIS-SPB" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 3. Each bridge uses only its own shortest path tree: the trees of bridges A and C over four bridges running ISIS-SPB.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 31<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-two-flavours-spbv-and-spbm">3. Two flavours: SPBV and SPBM<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#3-two-flavours-spbv-and-spbm" class="hash-link" aria-label="Direct link to 3. Two flavours: SPBV and SPBM" title="Direct link to 3. Two flavours: SPBV and SPBM" translate="no">​</a></h2>
<p>SPB has two operation modes that apply the same principle to different data planes [1][2]:</p>
<table><thead><tr><th></th><th>SPBV (SPB VID)</th><th>SPBM (SPB MAC)</th></tr></thead><tbody><tr><td>Data plane</td><td>IEEE 802.1Q VLANs (or 802.1ad)</td><td>Provider Backbone Bridges, IEEE 802.1ah "MAC-in-MAC"</td></tr><tr><td>Trees identified by</td><td>VLAN ID</td><td>Backbone MAC address</td></tr><tr><td>Learning</td><td>Flooding and learning, as in ordinary bridges</td><td>No backbone MAC flooding or learning; addresses known from IS-IS</td></tr><tr><td>Typical use</td><td>All types of VLANs, plug and play</td><td>Large managed networks, full isolation of customer MAC addresses</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-an-example-equal-cost-trees">4. An example: equal-cost trees<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#4-an-example-equal-cost-trees" class="hash-link" aria-label="Direct link to 4. An example: equal-cost trees" title="Direct link to 4. An example: equal-cost trees" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/spb-example.gif" alt="An example SPB network of eight nodes: a fully meshed core of four nodes and four dual-homed outer nodes, with interface numbers" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 4. An example SPB network: a fully meshed core of four nodes (0 to 3) and four outer nodes (4 to 7), each dual-homed to two core nodes. Small numbers are interface indexes.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:802d1aq_Wiki_Example.gif">802d1aq Wiki Example.gif</a> by <!-- -->Peterashwoodsmith<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/IEEE_802.1aq">IEEE 802.1aq</a>”, Wikimedia Commons, <a href="https://commons.wikimedia.org/wiki/Commons:Licensing#Public_domain">Public domain</a>.</span></figcaption></figure>
<p>With all links at the same cost, there are several equal shortest paths from node 7 to node 5. SPB specifies how to choose among them deterministically. Its first tie-breaking algorithm prefers the path with fewer hops, then the path with the lowest bridge identifier. Other algorithms use permutations of the identifiers [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/spb-ecmp-paths.png" alt="Two equal-cost paths from node 7 to node 5: the low path ID path on VID 101 and the high path ID path on VID 102" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 5. Two equal-cost paths from node 7 to node 5: the low path ID path, carried on VID 101, and the high path ID path, carried on VID 102.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:802d1aq_Wiki_Example3.png">802d1aq Wiki Example3.png</a> by <!-- -->Peterashwoodsmith<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/IEEE_802.1aq">IEEE 802.1aq</a>”, Wikimedia Commons, <a href="https://commons.wikimedia.org/wiki/Commons:Licensing#Public_domain">Public domain</a>.</span></figcaption></figure>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/spb-ecmt.png" alt="Three equal-cost trees between nodes 7 and 5 produced by three tie-breaking algorithms, each on its own VID" loading="lazy" style="max-width:min(100%, 520px)"><figcaption>Figure 6. Three equal-cost trees from three tie-breaking (ECT) algorithms, each on its own VID. The operator chooses which service uses which tree.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:802d1aq_Wiki_Example_4.png">802d1aq Wiki Example 4.png</a> by <!-- -->Peterashwoodsmith<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/IEEE_802.1aq">IEEE 802.1aq</a>”, Wikimedia Commons, <a href="https://commons.wikimedia.org/wiki/Commons:Licensing#Public_domain">Public domain</a>.</span></figcaption></figure>
<p>Sixteen <strong>equal-cost tree (ECT)</strong> algorithms are initially defined [1]. Unlike hashing in IP or MPLS, the choice is made by the operator at the edge: a service is assigned to one ECT VID, and all its traffic follows that tree in both directions [1]. The IEEE 802.1 tutorial calls this provisioned load spreading: a VLAN is assigned to an SPT set [2].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-spb-load.png" alt="Two equal-cost shortest path tree options for bridge A in a five-bridge network" loading="lazy" style="max-width:min(100%, 480px)"><figcaption>Figure 7. Load spreading on the IEEE 802.1 slide: two shortest path tree options for bridge A, from two tie-breaking variations.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 32<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/spb-ecmp-anim.gif" alt="Animation of eight equal-cost tree algorithms between a source and a destination in a larger SPB network" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 8. Eight equal-cost tree algorithms between one source (purple) and one destination (yellow) in a larger network (animation).<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:802d1aqECMP_(cropped).gif">802d1aqECMP (cropped).gif</a> by <!-- -->Peterashwoodsmith<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/IEEE_802.1aq">IEEE 802.1aq</a>”, Wikimedia Commons, <a href="https://commons.wikimedia.org/wiki/Commons:Licensing#Public_domain">Public domain</a>.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-failure-recovery">5. Failure recovery<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#5-failure-recovery" class="hash-link" aria-label="Direct link to 5. Failure recovery" title="Direct link to 5. Failure recovery" translate="no">​</a></h2>
<p>When a link fails, IS-IS advertises the failure and every bridge recomputes its trees and filtering entries [1]:</p>
<ul>
<li class=""><strong>No relearning in the SPBM core.</strong> Ethernet addresses are not advertised by IS-IS, so nothing has to be relearned there.</li>
<li class=""><strong>Fast failure detection.</strong> Failures can be detected faster with the Continuity Check Protocol of IEEE 802.1ag than with IS-IS hellos.</li>
<li class=""><strong>Fast multicast rebuild.</strong> Multicast trees are rebuilt about as fast as unicast routes, because they are computed locally rather than signalled.</li>
</ul>
<p>The tutorial gives convergence "within the range of 100 msec" [2].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="6-what-spb-means-for-determinism">6. What SPB means for determinism<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#6-what-spb-means-for-determinism" class="hash-link" aria-label="Direct link to 6. What SPB means for determinism" title="Direct link to 6. What SPB means for determinism" translate="no">​</a></h2>
<p>Three properties make SPB attractive under the analyses of this series:</p>
<ul>
<li class=""><strong>Paths are symmetric and predictable.</strong> The forward and reverse paths coincide, and the choice among equal-cost paths is an operator decision rather than a hash. Offline tools can model where every flow goes, and one-way delay can be taken as half the round-trip delay [1].</li>
<li class=""><strong>Paths are computed, not negotiated.</strong> Every bridge derives the same trees from the same database. A configuration tool can compute the same paths and the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">delay bounds</a> along them.</li>
<li class=""><strong>Shortest is not always enough.</strong> Streams that need disjoint paths, or paths that avoid a busy link, need more than shortest-path trees. <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control">Path control (802.1Qca)</a> extends SPB's IS-IS with explicit trees for exactly that.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">Wikipedia, "IEEE 802.1aq," sections on history, associated protocols, high level, equal cost multi tree, failure recovery and the example. <a href="https://en.wikipedia.org/wiki/IEEE_802.1aq" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slides 26 and 30–34. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">D. Fedyk, P. Ashwood-Smith et al., RFC 6329, "IS-IS Extensions Supporting IEEE 802.1aq Shortest Path Bridging," IETF, April 2012. <a href="https://www.rfc-editor.org/rfc/rfc6329" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1w RSTP: the Rapid Spanning Tree Protocol]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How a bridged network with redundant links avoids loops. The spanning tree, root and port roles, the proposal and agreement handshake that makes RSTP rapid, and what a spanning tree means for deterministic paths.]]></description>
            <content:encoded><![CDATA[<p>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 <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge">the bridge post</a>.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where RSTP acts: in the control plane of every bridge. It decides which ports forward; the data plane enforces that decision in its first step, active topology enforcement.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->9<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-BPDU"><td><b>BPDU</b></td><td>Bridge Protocol Data Unit</td><td>The message bridges exchange to run STP, RSTP and MSTP.</td></tr><tr id="abbr-FRER"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>FRER</b></a></td><td>Frame Replication and Elimination for Reliability</td><td>IEEE 802.1CB: frames are numbered, sent over disjoint paths, and duplicates are removed.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-LAN"><td><b>LAN</b></td><td>Local Area Network</td><td>A network covering a limited area, such as a building or a vehicle; IEEE 802 standardises LANs.</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-RSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>RSTP</b></a></td><td>Rapid Spanning Tree Protocol</td><td>IEEE 802.1w, now in 802.1Q: a faster-converging spanning tree with alternate and backup port roles.</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-STP"><td><b>STP</b></td><td>Spanning Tree Protocol</td><td>The original 802.1D protocol that blocks redundant links to leave a loop-free tree; now replaced by RSTP.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>The <strong>Rapid Spanning Tree Protocol</strong> was introduced by IEEE in 2001 as IEEE 802.1w and incorporated into IEEE 802.1D-2004, which made the original Spanning Tree Protocol (STP) obsolete [1]. It is backward compatible with STP [1]. The bridge functions of 802.1D, including RSTP, have since been brought into <a href="https://standards.ieee.org/ieee/802.1Q/10323/" target="_blank" rel="noopener noreferrer" class="">IEEE 802.1Q</a> [2]. The IEEE 802.1 tutorial notes that STP is now historical, replaced by RSTP [3].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-active-topology.png" alt="Five bridges controlled by RSTP (one shared tree), MSTP (one tree per group of VLANs) and SPB (one shortest path tree per bridge)" loading="lazy"><figcaption>Figure 2. The three distributed protocols for the active topology, as the IEEE 802.1 tutorial draws them: RSTP builds one spanning tree shared by all traffic, MSTP lets groups of VLANs use different spanning trees, and SPB gives each bridge its own shortest path tree.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 26<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<p>RSTP sits on the first layer of the bridge's control. It decides the <strong>active topology</strong>: which of the physical links are actually used. VLAN membership and station locations are then learned on top of it [3].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-how-a-spanning-tree-is-built">2. How a spanning tree is built<a href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree#2-how-a-spanning-tree-is-built" class="hash-link" aria-label="Direct link to 2. How a spanning tree is built" title="Direct link to 2. How a spanning tree is built" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/stp-2.svg" alt="A bridged network of seven bridges and six LAN segments, with bridge 3 elected root bridge" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 3. A bridged network with redundant links: seven bridges (numbered boxes) joined through six LAN segments (clouds). Bridge 3, with the lowest bridge ID, is the root.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Spanning_tree_protocol_at_work_2.svg">Spanning tree protocol at work 2.svg</a> by <!-- -->GhosT<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol">Spanning Tree Protocol</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by/3.0/">CC BY 3.0</a>.</span></figcaption></figure>
<p>Bridges exchange <strong>bridge protocol data units (BPDUs)</strong> with their neighbours. From them [1]:</p>
<ol>
<li class="">the bridges elect a <strong>root bridge</strong>;</li>
<li class="">every other bridge adds up the path cost towards the root and selects its best port towards it, the <strong>root port</strong>;</li>
<li class="">on each LAN segment, the bridge with the best path to the root forwards for that segment through its <strong>designated port</strong>;</li>
<li class="">every other port that would close a loop stops forwarding user data.</li>
</ol>
<p>The default path cost is inversely proportional to link speed: RSTP uses 20 Tbit/s divided by the bandwidth [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/stp-4.svg" alt="The same network after root and designated ports are chosen; the ports that would close loops are blocked" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 4. The resulting tree. Designated ports (DP) and root ports (RP) forward; the ports marked BP are blocked, so exactly one path remains between any two bridges.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Spanning_tree_protocol_at_work_4.svg">Spanning tree protocol at work 4.svg</a> by <!-- -->GhosT<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol">Spanning Tree Protocol</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by/3.0/">CC BY 3.0</a>.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-what-makes-it-rapid">3. What makes it rapid<a href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree#3-what-makes-it-rapid" class="hash-link" aria-label="Direct link to 3. What makes it rapid" title="Direct link to 3. What makes it rapid" translate="no">​</a></h2>
<p>RSTP keeps the idea of the spanning tree but changes how fast it reacts [1]:</p>
<table><thead><tr><th></th><th>STP</th><th>RSTP</th></tr></thead><tbody><tr><td>Reaction to a topology change</td><td>30 to 50 s</td><td>Within 3 hello times (6 s by default), or a few milliseconds after a physical link failure</td></tr><tr><td>Port states</td><td>Five</td><td>Three: discarding, learning, forwarding</td></tr><tr><td>Port roles</td><td>Root, designated, blocked</td><td>Root, designated, <strong>alternate</strong> (another path to the root), <strong>backup</strong> (another path to a segment), disabled</td></tr><tr><td>Edge ports</td><td>—</td><td>Ports with no bridge behind them forward at once, but still watch for BPDUs</td></tr></tbody></table>
<p>Two mechanisms do most of the work [1]:</p>
<ul>
<li class=""><strong>Prepared alternatives.</strong> An alternate or backup port already knows it is the next best choice, so it can take over without waiting for timers when the active port fails.</li>
<li class=""><strong>Proposal and agreement.</strong> On point-to-point links, a bridge proposes its spanning-tree information on its designated ports. A neighbour that accepts it as superior puts its other ports into discarding and returns an agreement, and the first bridge then moves the port straight to forwarding. The handshake cascades away from the root, instead of each port waiting through listening and learning.</li>
</ul>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/stp-5.svg" alt="A failed link between bridge 24 and segment c" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 5. A failure: the link between bridge 24 and segment c goes down.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Spanning_tree_protocol_at_work_5.svg">Spanning tree protocol at work 5.svg</a> by <!-- -->GhosT<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol">Spanning Tree Protocol</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by/3.0/">CC BY 3.0</a>.</span></figcaption></figure>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/commons/stp-6.svg" alt="The spanning tree rebuilt after the failure, with a previously blocked port now forwarding" loading="lazy" style="max-width:min(100%, 420px)"><figcaption>Figure 6. The tree after reconvergence: the port of bridge 5 on segment f, blocked before, now forwards, and bridge 4 reaches the root through it.<span class="nc-figure-source">Source: <a href="https://commons.wikimedia.org/wiki/File:Spanning_tree_protocol_at_work_6.svg">Spanning tree protocol at work 6.svg</a> by <!-- -->GhosT<!-- -->, from the Wikipedia article “<a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol">Spanning Tree Protocol</a>”, Wikimedia Commons, <a href="https://creativecommons.org/licenses/by/3.0/">CC BY 3.0</a>.</span></figcaption></figure>
<p>An RSTP bridge falls back to legacy STP on a port where it detects an old-style BPDU [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-what-a-spanning-tree-means-for-determinism">4. What a spanning tree means for determinism<a href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree#4-what-a-spanning-tree-means-for-determinism" class="hash-link" aria-label="Direct link to 4. What a spanning tree means for determinism" title="Direct link to 4. What a spanning tree means for determinism" translate="no">​</a></h2>
<p>For the analyses in this series, three properties of a spanning tree matter:</p>
<ul>
<li class=""><strong>One path.</strong> Between two bridges there is exactly one active path, and all traffic shares it. Redundant links stay idle until a failure. That is why <a class="" href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree">MSTP</a> and <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a> were developed.</li>
<li class=""><strong>Paths change after a failure.</strong> When the tree reconverges, streams move to new paths through new queues. A <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">network calculus</a> bound computed for the old path no longer applies, which is the problem studied in <a class="" href="https://cnam-ece.github.io/learning-materials/blog/dynamic-reconfiguration-of-tsn">the reconfiguration post</a>.</li>
<li class=""><strong>Reconvergence is not seamless.</strong> Even milliseconds of reconvergence lose frames. Applications that cannot afford this rely on <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">FRER</a>, which sends every frame on two disjoint paths at once and needs no reconvergence at all.</li>
</ul>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">Wikipedia, "Spanning Tree Protocol," sections on protocol operation and on the Rapid Spanning Tree Protocol. <a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">Wikipedia, "IEEE 802.1aq," section on associated protocols (802.1Q-2014 incorporates functionality previously specified in 802.1D). <a href="https://en.wikipedia.org/wiki/IEEE_802.1aq" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slides 25–26. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1Qca PCR: path control with explicit trees in IS-IS]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[How IEEE 802.1Qca lets a controller install explicit, non-shortest paths in a bridged network through IS-IS. Explicit trees, the path computation element, the five control modes, and why TSN needs paths that shortest-path bridging cannot give.]]></description>
            <content:encoded><![CDATA[<p><a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a> computes shortest paths. Deterministic networks often need other paths: two disjoint routes for <a class="" href="https://cnam-ece.github.io/learning-materials/blog/frame-replication-and-elimination">FRER</a>, 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.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where path control acts: in the control plane, where IS-IS installs explicit trees, and in the relay, whose filtering entries IS-IS sets so that frames of a VLAN follow the tree.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->18<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-CNC"><td><a href="https://1.ieee802.org/tsn/802-1qcc/"><b>CNC</b></a></td><td>Centralized Network Configuration</td><td>The 802.1Qcc entity that computes paths, schedules and reservations for the whole network and configures the bridges.</td></tr><tr id="abbr-ECT"><td><b>ECT</b></td><td>Equal Cost Tree</td><td>In SPB and PCR, an algorithm that chooses one tree among several of equal cost; each one is used through its own VID.</td></tr><tr id="abbr-ET"><td><a href="https://www.rfc-editor.org/rfc/rfc7813"><b>ET</b></a></td><td>Explicit Tree</td><td>In 802.1Qca, a loop-free tree imposed by a PCE instead of the shortest path tree.</td></tr><tr id="abbr-FRER"><td><a href="https://1.ieee802.org/tsn/802-1cb/"><b>FRER</b></a></td><td>Frame Replication and Elimination for Reliability</td><td>IEEE 802.1CB: frames are numbered, sent over disjoint paths, and duplicates are removed.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IETF"><td><a href="https://www.ietf.org/"><b>IETF</b></a></td><td>Internet Engineering Task Force</td><td>The body that develops Internet standards, published as RFCs.</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MSRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>MSRP</b></a></td><td>Multiple Stream Registration Protocol</td><td>The MRP application at the core of SRP that registers streams and reserves bridge resources.</td></tr><tr id="abbr-PCA"><td><a href="https://www.rfc-editor.org/rfc/rfc7813"><b>PCA</b></a></td><td>Path Control Agent</td><td>In 802.1Qca, the IS-IS participant that acts on behalf of a PCE outside the IS-IS domain.</td></tr><tr id="abbr-PCE"><td><a href="https://www.rfc-editor.org/rfc/rfc4655"><b>PCE</b></a></td><td>Path Computation Element</td><td>An entity that computes paths or trees from the network topology and constraints (RFC 4655).</td></tr><tr id="abbr-PCR"><td><a href="https://standards.ieee.org/ieee/802.1Qca/5557/"><b>PCR</b></a></td><td>Path Control and Reservation</td><td>IEEE 802.1Qca: IS-IS extensions with which a controller installs explicit, non-shortest trees (RFC 7813). In ATM, PCR instead means Peak Cell Rate.</td></tr><tr id="abbr-RFC"><td><a href="https://www.rfc-editor.org/"><b>RFC</b></a></td><td>Request for Comments</td><td>The document series in which IETF standards and related documents are published.</td></tr><tr id="abbr-SDN"><td><a href="https://www.rfc-editor.org/rfc/rfc7426"><b>SDN</b></a></td><td>Software-Defined Networking</td><td>An architecture that separates the control plane, run by a logically centralised controller, from the data plane of the network elements (RFC 7426).</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p><strong>IEEE 802.1Qca</strong>, <em>Path Control and Reservation</em>, specifies explicit path control via IS-IS in Layer 2 networks, to go beyond the shortest paths of SPB. It provides the means to establish and control <strong>explicit forwarding trees</strong> in a Layer 2 domain [1]. The IETF documents the corresponding IS-IS sub-TLVs in <a href="https://www.rfc-editor.org/rfc/rfc7813" target="_blank" rel="noopener noreferrer" class="">RFC 7813</a> [1].</p>
<p>PCR relies on the SPB architecture and terminology and reuses several SPB sub-TLVs. A bridge does not have to implement full IS-IS SPB to support PCR; it can run both in the same IS-IS instance [1]. PCR covers point-to-point links only [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/farkas2018-explicit-trees.png" alt="IS-IS shortest path tree and an explicit tree installed by a controller between edge bridges" loading="lazy"><figcaption>Figure 2. A hybrid approach: IS-IS provides topology discovery and the shortest path trees, and a controller (Ctrl) adds an explicit tree, here from edge bridge EB1 through core bridge CB2 instead of the shortest path through CB1.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">J. Farkas, “TSN Basic Concepts,” DetNet–TSN workshop, IEEE 802.1, 11 November 2018</a>, <!-- -->slide 17<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<p>The task group describes it as a <strong>hybrid SDN approach</strong>: IS-IS provides the basic functions (topology discovery and default paths), and one or more controllers control the explicit trees. No protocol changes are needed, only a few new sub-TLVs and the reuse of existing ones [2][3].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-explicit-trees-and-the-pce">2. Explicit trees and the PCE<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control#2-explicit-trees-and-the-pce" class="hash-link" aria-label="Direct link to 2. Explicit trees and the PCE" title="Direct link to 2. Explicit trees and the PCE" translate="no">​</a></h2>
<p>An <strong>explicit tree (ET)</strong> is an undirected, loop-free topology. Its use is controlled by the <strong>path computation element (PCE)</strong> that owns it, which associates VLAN IDs and MAC addresses with the tree [1]:</p>
<ul>
<li class=""><strong>Ownership.</strong> One or more PCEs can compute trees for a domain, but each tree has exactly one owner PCE.</li>
<li class=""><strong>Joining IS-IS.</strong> The PCE takes part in IS-IS itself, or through a <strong>path control agent (PCA)</strong> that does. Either way it receives the whole link-state database.</li>
<li class=""><strong>Installing a tree.</strong> The PCE injects the tree description into IS-IS, which floods it like any other link-state information. The bridges store it in their explicit tree database and install the matching filtering entries.</li>
</ul>
<p>How the PCE computes trees is deliberately left unspecified [1].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/rfc7813-fig2.png" alt="ASCII figure of a strict explicit tree over nine bridges A to I, and its description as a list of hops starting at root A" loading="lazy" style="max-width:min(100%, 360px)"><figcaption>Figure 3. A strict explicit tree and its description, rooted at node A: the tree is described as a list of hops, branch by branch, starting from the root.<span class="nc-figure-source">Source: <a href="https://www.rfc-editor.org/rfc/rfc7813">J. Farkas (Ed.), N. Bragg, P. Unbehagen, G. Parsons, P. Ashwood-Smith, C. Bowers, RFC 7813, “IS-IS Path Control and Reservation,” IETF, June 2016</a>, <!-- -->Figure 2<!-- -->;<!-- --> <!-- -->ASCII figure rendered from the RFC text, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>A tree is either <strong>strict</strong>, listing every bridge and link, or <strong>loose</strong>, listing only bridges with a special role (edge bridge, root, leaf, a bridge to avoid). Each bridge computes the loose segments itself: by default the shortest path, or a constrained shortest path when the tree carries constraints such as an administrative group of links [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-five-control-modes">3. Five control modes<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control#3-five-control-modes" class="hash-link" aria-label="Direct link to 3. Five control modes" title="Direct link to 3. Five control modes" translate="no">​</a></h2>
<p>A VLAN is put under explicit control by associating it with one of five <strong>explicit ECT algorithms</strong> [1]:</p>
<table><thead><tr><th>Algorithm</th><th>Use</th></tr></thead><tbody><tr><td>Strict Tree (ST)</td><td>A strict, static tree: only its owner PCE can change it, also after a topology change (required)</td></tr><tr><td>Loose Tree (LT)</td><td>A single loose tree, whose loose hops IS-IS restores after a topology change</td></tr><tr><td>Loose Tree Set (LTS)</td><td>A set of loose trees</td></tr><tr><td>MRT</td><td>Maximally redundant trees for fast reroute (<a href="https://www.rfc-editor.org/rfc/rfc7812" target="_blank" rel="noopener noreferrer" class="">RFC 7812</a>)</td></tr><tr><td>MRT GADAG (MRTG)</td><td>The same, with part of the computation done centrally and distributed through IS-IS</td></tr></tbody></table>
<p>IS-IS can also record <strong>bandwidth assignments</strong> along an explicit tree. This must not be combined with a reservation protocol: in one domain, either MSRP (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">SRP</a>) or IS-IS makes bandwidth assignments, never both [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-why-tsn-needs-it">4. Why TSN needs it<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control#4-why-tsn-needs-it" class="hash-link" aria-label="Direct link to 4. Why TSN needs it" title="Direct link to 4. Why TSN needs it" translate="no">​</a></h2>
<p>Path control fills a gap that the other topology protocols leave open:</p>
<ul>
<li class=""><strong>Disjoint paths for redundancy.</strong> FRER is only as reliable as its paths are disjoint. A strict tree pair, computed by a controller, guarantees that two member streams share no bridge or link.</li>
<li class=""><strong>Paths chosen for latency.</strong> A controller can route a stream away from links whose <a class="" href="https://cnam-ece.github.io/learning-materials/blog/three-fundamental-bounds">delay bound</a> is already tight. Shortest-path forwarding cannot.</li>
<li class=""><strong>Paths that stay put.</strong> A strict tree does not move when the topology changes elsewhere, unless its owner moves it. For analysis, that is exactly the property needed: the path behind a bound changes only when the controller decides, and can recheck the bound first.</li>
</ul>
<p>In 802.1Qcc terms, the CNC of the <a class="" href="https://cnam-ece.github.io/learning-materials/blog/sdn-and-tsn-configuration">SDN post</a> plays the role of the PCE, and path control is one of the ways it installs the paths it computes.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">J. Farkas (Ed.), N. Bragg, P. Unbehagen, G. Parsons, P. Ashwood-Smith, C. Bowers, RFC 7813, "IS-IS Path Control and Reservation," IETF, June 2016, Sections 1, 4 and 5. <a href="https://www.rfc-editor.org/rfc/rfc7813" target="_blank" rel="noopener noreferrer" class="">RFC Editor</a></li>
<li class="">J. Farkas, "TSN Basic Concepts," DetNet–TSN workshop, 11 November 2018, slide 17. <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017, slide 37. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">IEEE, <em>IEEE 802.1Qca-2015, Path Control and Reservation</em>. <a href="https://standards.ieee.org/ieee/802.1Qca/5557/" target="_blank" rel="noopener noreferrer" class="">IEEE SA</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>TSN</category>
            <category>SDN</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1ak MRP and MVRP: registering VLANs across a bridged network]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The Multiple Registration Protocol is the registration framework of IEEE 802.1Q, and MVRP is its application for VLAN membership. How declarations and registrations propagate, what MVRP writes into the filtering database, and how the same framework carries multicast and stream reservations.]]></description>
            <content:encoded><![CDATA[<p>Once <a class="" href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree">RSTP, MSTP</a> or <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a> 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 <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">stream reservations</a>.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where MRP and MVRP act: in the control plane of each bridge. What they register becomes dynamic entries of the filtering database used by the relay.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->19<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-AVB"><td><a href="https://www.ieee802.org/1/pages/avbridges.html"><b>AVB</b></a></td><td>Audio Video Bridging</td><td>The predecessor of TSN: gPTP, the credit-based shaper and stream reservation, combined for audio and video (profile: IEEE 802.1BA).</td></tr><tr id="abbr-GARP"><td><b>GARP</b></td><td>Generic Attribute Registration Protocol</td><td>The 802.1D predecessor of MRP.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-IP"><td><a href="https://www.rfc-editor.org/rfc/rfc791"><b>IP</b></a></td><td>Internet Protocol</td><td>The network-layer protocol of the Internet (IPv4, RFC 791; IPv6, RFC 8200).</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-LAN"><td><b>LAN</b></td><td>Local Area Network</td><td>A network covering a limited area, such as a building or a vehicle; IEEE 802 standardises LANs.</td></tr><tr id="abbr-MAC"><td><a href="https://standards.ieee.org/ieee/802.3/10422/"><b>MAC</b></a></td><td>Medium Access Control</td><td>The lower sublayer of the data link layer, which frames data and controls access to the medium. A MAC address identifies a network interface.</td></tr><tr id="abbr-MAD"><td><b>MAD</b></td><td>MRP Attribute Declaration</td><td>The per-port MRP state machine that declares attributes and registers those declared by neighbours.</td></tr><tr id="abbr-MAP"><td><b>MAP</b></td><td>MRP Attribute Propagation</td><td>The MRP function that turns a registration on one port into declarations on the other ports.</td></tr><tr id="abbr-MMRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MMRP</b></a></td><td>Multiple MAC Registration Protocol</td><td>The MRP application that registers multicast MAC addresses.</td></tr><tr id="abbr-MRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MRP</b></a></td><td>Multiple Registration Protocol</td><td>IEEE 802.1ak, now in 802.1Q: the framework for declaring and registering attributes such as VLANs, multicast addresses and streams.</td></tr><tr id="abbr-MSRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>MSRP</b></a></td><td>Multiple Stream Registration Protocol</td><td>The MRP application at the core of SRP that registers streams and reserves bridge resources.</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-MVRP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MVRP</b></a></td><td>Multiple VLAN Registration Protocol</td><td>The MRP application that registers VLAN membership, so that VLAN traffic only goes where members are.</td></tr><tr id="abbr-RSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>RSTP</b></a></td><td>Rapid Spanning Tree Protocol</td><td>IEEE 802.1w, now in 802.1Q: a faster-converging spanning tree with alternate and backup port roles.</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-SRP"><td><a href="https://standards.ieee.org/ieee/802.1Qat/4050/"><b>SRP</b></a></td><td>Stream Reservation Protocol</td><td>IEEE 802.1Qat: distributed admission control in which talkers advertise streams and listeners subscribe, reserving resources hop by hop.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>The <strong>Multiple Registration Protocol</strong> is a generic registration framework, defined by the IEEE 802.1ak amendment (2007) to IEEE 802.1Q. It lets bridges and end stations register and deregister attribute values, such as VLAN identifiers or multicast group membership, across a large LAN [1]. It replaced the older Generic Attribute Registration Protocol (GARP) of 802.1D. GARP-based VLAN registration could take an extremely long time to converge on a large network, consuming considerable bandwidth [1].</p>
<p>The IEEE 802.1 tutorial describes MRP as a flooding protocol, not unlike IS-IS or OSPF. On every bridge port, it registers the neighbours' ability to transmit, or need to receive, various kinds of data [2]. Three applications use it [1][2]:</p>
<table><thead><tr><th>Application</th><th>Registers</th><th>Replaces</th></tr></thead><tbody><tr><td><strong>MVRP</strong>, Multiple VLAN Registration Protocol</td><td>VLAN membership: where frames flooded to a VLAN, such as broadcasts or unknown unicasts, must go</td><td>GVRP</td></tr><tr><td><strong>MMRP</strong>, Multiple MAC Registration Protocol</td><td>Multicast MAC addresses, or VLAN and MAC pairs (not necessarily IP multicast)</td><td>GMRP</td></tr><tr><td><strong>MSRP</strong>, Multiple Stream Registration Protocol (<a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">SRP</a>)</td><td>Talkers that want to send and listeners that want to receive streams with bandwidth, latency and loss requirements</td><td>(new with AVB)</td></tr></tbody></table>
<p>In some networks, MRP is being supplanted by IS-IS [2]. For example, <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1aq-shortest-path-bridging">SPB</a> distributes service membership through its link-state database.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-declarations-and-registrations">2. Declarations and registrations<a href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp#2-declarations-and-registrations" class="hash-link" aria-label="Direct link to 2. Declarations and registrations" title="Direct link to 2. Declarations and registrations" translate="no">​</a></h2>
<figure class="nc-figure"><svg viewBox="0 0 720 215" width="720" role="img" aria-label="An end station declares an attribute, for example membership of VLAN 10. Each bridge registers it on the port where it arrives and declares it on its other ports, so every bridge learns through which port members can be reached"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="10" y="70" width="110" height="46" rx="4" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="65" y="86.175" font-size="10.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">End station</text><text x="65" y="99.825" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">member of VLAN 10</text></g><g><g><rect x="190" y="60" width="130" height="66" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="255" y="93" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Bridge 1</text></g><g><rect x="188" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="201" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">R</text></g><g><rect x="296" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="309" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">D</text></g></g><g><g><rect x="370" y="60" width="130" height="66" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="435" y="93" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Bridge 2</text></g><g><rect x="368" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="381" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">R</text></g><g><rect x="476" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="489" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">D</text></g></g><g><g><rect x="550" y="60" width="130" height="66" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="615" y="93" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Bridge 3</text></g><g><rect x="548" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-arrival-fill)" stroke="var(--nc-arrival)" stroke-width="1.3"></rect><text x="561" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">R</text></g><g><rect x="656" y="80" width="26" height="26" rx="2" fill="var(--nc-fig-fill)" stroke="var(--nc-fig-stroke)" stroke-width="1.3"></rect><text x="669" y="93" font-size="11" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">D</text></g></g><path d="M120,93 H188" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)"></path><path d="M322,93 H368" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)"></path><path d="M502,93 H548" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)"></path><text x="154" y="80" font-size="10.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--nc-arrival)">declare</text><text x="360" y="24" font-size="11.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">a declaration received on a port is registered (R) there,</text><text x="360" y="42" font-size="11.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">and declared (D) on the bridge’s other ports</text><path d="M610,160 H130" fill="none" stroke="var(--nc-service)" stroke-width="1.4" stroke-dasharray="5 4" marker-end="url(#dg-arrow-service)"></path><text x="370" y="176" font-size="11" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--nc-service)">frames for VLAN 10 now reach the registering port, and only the ports that lead to members</text><text x="370" y="200" font-size="10.5" font-weight="400" font-style="italic" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MRP applications: MVRP (VLANs), MMRP (multicast MAC addresses), MSRP (streams)</text></svg><figcaption>Figure 2. MRP in one picture. An end station declares an attribute, here membership of VLAN 10. Each bridge registers it on the port where it arrives (R) and declares it on its other ports (D), so every bridge learns through which ports the members can be reached.<span class="nc-figure-source">Source: <!-- -->own drawing of MRP attribute declaration and propagation, after the<!-- --> <a href="https://en.wikipedia.org/wiki/Multiple_Registration_Protocol">Wikipedia article on MRP</a> and the<!-- --> <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">IEEE 802.1Q tutorial</a>, IETF 86, 2013, slide 27.</span></figcaption></figure>
<p>MRP separates two functions [1]:</p>
<ul>
<li class=""><strong>MRP Attribute Declaration (MAD)</strong> is the per-port state machine that declares attributes to a neighbour and registers the attributes declared by it;</li>
<li class=""><strong>MRP Attribute Propagation (MAP)</strong> passes a registration on one port to declarations on the bridge's other ports, along the active topology.</li>
</ul>
<p>Withdrawing a declaration deregisters the attribute along the same path. A registration therefore always reflects where the members currently are.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-mvrp">3. MVRP<a href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp#3-mvrp" class="hash-link" aria-label="Direct link to 3. MVRP" title="Direct link to 3. MVRP" translate="no">​</a></h2>
<p>MVRP is the MRP application for the VLAN registration service. It dynamically maintains the <strong>dynamic VLAN registration entries</strong> of the filtering database and propagates them to other bridges [1]. Each bridge thus learns which VLANs currently have active members, and through which ports they can be reached [1].</p>
<p>The practical effect is configuration at the edge only. To add a port to a VLAN, only the end port or the device connected to it needs to be configured. MVRP creates the necessary VLAN trunks on the other bridges [1]. 802.1Q allows VLAN membership to be configured statically, dynamically through MVRP, or as a mix of both [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-where-it-sits-among-the-control-protocols">4. Where it sits among the control protocols<a href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp#4-where-it-sits-among-the-control-protocols" class="hash-link" aria-label="Direct link to 4. Where it sits among the control protocols" title="Direct link to 4. Where it sits among the control protocols" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-topology-layers.png" alt="Topology layers of a bridged network stacked as planes: physical network topology, active topology, VLAN topology and station location" loading="lazy"><figcaption>Figure 3. The topology layers of a bridged network. MVRP maintains the VLAN topology, a subset of the active topology fixed by the spanning tree or SPB; MMRP and source learning maintain station locations above it.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 25<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>In the layered view of <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge">the bridge post</a>, MVRP maintains the <strong>VLAN topology</strong>. That is the layer between the active topology (spanning tree, SPB or path control) and the station locations (source address learning, MMRP) [2][3]. For TSN, MRP matters mostly through its third application. The <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qat-srp">Stream Reservation Protocol</a> uses the same declarations and registrations to reserve resources along a stream's path, and MVRP to make the bridges on that path members of the stream's VLAN [4].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/mrp-and-mvrp#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">Wikipedia, "Multiple Registration Protocol," sections on history, MMRP and MVRP. <a href="https://en.wikipedia.org/wiki/Multiple_Registration_Protocol" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slides 25 and 27. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017, slide 49. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">Wikipedia, "Stream Reservation Protocol." <a href="https://en.wikipedia.org/wiki/Stream_Reservation_Protocol" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>Presentation</category>
        </item>
        <item>
            <title><![CDATA[IEEE 802.1s MSTP: one spanning tree per group of VLANs]]></title>
            <link>https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree</link>
            <guid>https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The Multiple Spanning Tree Protocol extends RSTP so that different groups of VLANs use different spanning trees. MST regions, instances, the single BPDU that carries them all, and how a region looks to the RSTP world outside it.]]></description>
            <content:encoded><![CDATA[<p><a class="" href="https://cnam-ece.github.io/learning-materials/blog/rstp-rapid-spanning-tree">RSTP</a> builds one tree for the whole network, so every redundant link stays idle. Once a network carries several VLANs, there is an obvious improvement: give different VLANs different trees, so that each link carries some traffic. That is what the Multiple Spanning Tree Protocol (MSTP) does.</p>
<!-- -->
<figure class="nc-figure"><svg viewBox="0 0 720 312" width="720" role="img" aria-label="An IEEE 802.1Q bridge with its control plane and its data plane stages, showing which TSN standard extends which existing stage"><defs><marker id="dg-arrow-plain" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-fig-stroke)"></path></marker><marker id="dg-arrow-service" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-service)"></path></marker><marker id="dg-arrow-arrival" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-arrival)"></path></marker><marker id="dg-arrow-muted" viewBox="0 0 10 10" refX="9" refY="5" markerWidth="7" markerHeight="7" orient="auto-start-reverse"><path d="M0,0 L10,5 L0,10 z" fill="var(--nc-bound)"></path></marker></defs><g><rect x="15" y="24" width="690" height="278" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3" stroke-dasharray="5 4"></rect></g><a href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1q-bridge"><title>The IEEE 802.1Q bridge: architecture and data-plane actions</title><text x="28" y="12" font-size="12" font-weight="700" text-anchor="start" dominant-baseline="central" fill="var(--nc-service)">IEEE 802.1Q bridge ↗</text></a><g><rect x="36" y="40" width="648" height="44" rx="4" fill="var(--nc-fig-service-fill)" stroke="var(--nc-service)" stroke-width="1.3"></rect><text x="360" y="54.2" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Control plane</text><text x="360" y="69.80000000000001" font-size="12" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">SRP (Qat), TSN configuration (Qcc), path control (Qca)</text></g><text x="36" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="start" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame in</text><text x="684" y="118" font-size="11.5" font-weight="400" font-style="italic" text-anchor="end" dominant-baseline="central" fill="var(--ifm-font-color-base)">frame out</text><g><g><rect x="36" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="88" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Ingress</text><text x="88" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">PSFP (Qci)</text><text x="88" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">FRER (CB)</text></g><path d="M140,165 H172" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="172" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="224" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Relay</text><text x="224" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">forwarding</text><text x="224" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">explicit trees</text></g><path d="M276,165 H308" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="308" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Queuing</text><text x="360" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CBS (Qav)</text><text x="360" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">ATS (Qcr)</text></g><path d="M412,165 H444" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="444" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="496" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Tx selection</text><text x="496" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">gates (Qbv)</text><text x="496" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">CQF (Qch)</text></g><path d="M548,165 H580" fill="none" stroke="var(--nc-fig-stroke)" stroke-width="1.4" marker-end="url(#dg-arrow-plain)"></path></g><g><g><rect x="580" y="130" width="104" height="70" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="632" y="150.05" font-size="11.5" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">MAC / PHY</text><text x="632" y="165" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">preemption</text><text x="632" y="179.95000000000002" font-size="11.5" font-weight="400" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">(Qbu, 802.3br)</text></g></g><g><rect x="36" y="246" width="648" height="38" rx="4" fill="var(--nc-fig-muted-fill)" stroke="var(--nc-bound)" stroke-width="1.3"></rect><text x="360" y="265" font-size="12" font-weight="700" text-anchor="middle" dominant-baseline="central" fill="var(--ifm-font-color-base)">Common time: gPTP (802.1AS)</text></g><path d="M360,130 V84" fill="none" stroke="var(--nc-arrival)" stroke-width="1.4" marker-end="url(#dg-arrow-arrival)" marker-start="url(#dg-arrow-arrival)"></path><path d="M360,246 V200" fill="none" stroke="var(--nc-service)" stroke-width="1.4" marker-end="url(#dg-arrow-service)"></path></svg><figcaption>Figure 1. Where MSTP acts: in the control plane, like RSTP. It computes several active topologies; the data plane uses the one assigned to each frame's VLAN.<span class="nc-figure-source">Source: <!-- -->own drawing, after the bridge architecture, data-plane actions and QoS function chain in <!-- -->J. Farkas, <a href="https://www.ieee802.org/1/files/public/docs2018/detnet-tsn-farkas-tsn-basic-concepts-1118-v01.pdf">TSN Basic Concepts</a>, DetNet–TSN workshop, 11 November 2018, <!-- -->slides 7, 8 and 10.</span></figcaption></figure>
<details class="abbr-box"><summary>Abbreviations used in this post<!-- --> (<!-- -->14<!-- -->)</summary><table><thead><tr><th>Abbreviation</th><th>Stands for</th><th>Meaning</th></tr></thead><tbody><tr id="abbr-BPDU"><td><b>BPDU</b></td><td>Bridge Protocol Data Unit</td><td>The message bridges exchange to run STP, RSTP and MSTP.</td></tr><tr id="abbr-CNC"><td><a href="https://1.ieee802.org/tsn/802-1qcc/"><b>CNC</b></a></td><td>Centralized Network Configuration</td><td>The 802.1Qcc entity that computes paths, schedules and reservations for the whole network and configures the bridges.</td></tr><tr id="abbr-CST"><td><b>CST</b></td><td>Common Spanning Tree</td><td>The tree that connects MSTP regions and single bridges; compatible with STP and RSTP.</td></tr><tr id="abbr-IEEE"><td><a href="https://standards.ieee.org/"><b>IEEE</b></a></td><td>Institute of Electrical and Electronics Engineers</td><td>The professional association whose Standards Association publishes the IEEE 802 LAN/MAN standards.</td></tr><tr id="abbr-ISIS"><td><a href="https://www.rfc-editor.org/rfc/rfc1195"><b>IS-IS</b></a></td><td>Intermediate System to Intermediate System</td><td>A link-state routing protocol (ISO/IEC 10589, RFC 1195); the control plane of SPB and PCR.</td></tr><tr id="abbr-IST"><td><b>IST</b></td><td>Internal Spanning Tree</td><td>The part of the common spanning tree inside one MSTP region.</td></tr><tr id="abbr-MST"><td><b>MST</b></td><td>Multiple Spanning Tree</td><td>A spanning tree to which one or more VLANs are mapped under MSTP.</td></tr><tr id="abbr-MSTI"><td><b>MSTI</b></td><td>MST Instance</td><td>One spanning tree inside an MSTP region, together with the VLANs mapped to it.</td></tr><tr id="abbr-MSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>MSTP</b></a></td><td>Multiple Spanning Tree Protocol</td><td>IEEE 802.1s, now in 802.1Q: several spanning trees, each used by a group of VLANs.</td></tr><tr id="abbr-RSTP"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>RSTP</b></a></td><td>Rapid Spanning Tree Protocol</td><td>IEEE 802.1w, now in 802.1Q: a faster-converging spanning tree with alternate and backup port roles.</td></tr><tr id="abbr-SPB"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>SPB</b></a></td><td>Shortest Path Bridging</td><td>IEEE 802.1aq: bridges compute shortest path trees with IS-IS, so all links can be used.</td></tr><tr id="abbr-STP"><td><b>STP</b></td><td>Spanning Tree Protocol</td><td>The original 802.1D protocol that blocks redundant links to leave a loop-free tree; now replaced by RSTP.</td></tr><tr id="abbr-TSN"><td><a href="https://1.ieee802.org/tsn/"><b>TSN</b></a></td><td>Time-Sensitive Networking</td><td>The set of IEEE 802.1 standards that give Ethernet bounded latency, time synchronisation and high reliability.</td></tr><tr id="abbr-VLAN"><td><a href="https://standards.ieee.org/ieee/802.1Q/10323/"><b>VLAN</b></a></td><td>Virtual LAN</td><td>A logical LAN within a bridged network, identified by a 12-bit VLAN ID in the 802.1Q tag.</td></tr></tbody></table></details>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="1-definition">1. Definition<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#1-definition" class="hash-link" aria-label="Direct link to 1. Definition" title="Direct link to 1. Definition" translate="no">​</a></h2>
<p>The <strong>Multiple Spanning Tree Protocol</strong> was defined in IEEE 802.1s-2002 and merged into IEEE 802.1Q-2005. It is an extension of RSTP that makes VLANs more useful [1]. Under MSTP, a spanning tree can be defined for individual VLANs or for groups of VLANs [1]. In the words of the IEEE 802.1 tutorial, different VLANs may share different spanning trees [3].</p>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/ieee8021q-tutorial-active-topology.png" alt="Five bridges controlled by RSTP (one shared tree), MSTP (one tree per group of VLANs) and SPB (one shortest path tree per bridge)" loading="lazy"><figcaption>Figure 2. RSTP, MSTP and SPB compared: under MSTP (centre) different VLANs may share different spanning trees, so the redundant links of the RSTP tree (left) can carry traffic.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, “IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks,” IEEE 802.1 tutorial, IETF 86, 10 March 2013</a>, <!-- -->slide 26<!-- -->;<!-- --> <!-- -->cropped, with neighbouring slide text, logos or navigation icons blanked<!-- -->.</span></figcaption></figure>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="2-regions-and-instances">2. Regions and instances<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#2-regions-and-instances" class="hash-link" aria-label="Direct link to 2. Regions and instances" title="Direct link to 2. Regions and instances" translate="no">​</a></h2>
<p>MSTP organises bridges and VLANs in two steps [1]:</p>
<ol>
<li class="">bridges are assigned to an <strong>MST region</strong>;</li>
<li class="">VLANs are mapped to <strong>MST instances (MSTIs)</strong>, each of which is a spanning tree.</li>
</ol>
<p>Inside a region, frames of a VLAN follow the tree of the instance their VLAN is mapped to. The terms in the standard are as follows [1]:</p>
<table><thead><tr><th>Term</th><th>Meaning</th></tr></thead><tbody><tr><td>Multiple spanning tree (MST)</td><td>A spanning tree to which one or more VLANs are mapped</td></tr><tr><td>MST instance (MSTI)</td><td>A group of VLANs and the spanning tree they use inside a region</td></tr><tr><td>Common spanning tree (CST)</td><td>The tree that connects regions and single bridges; backward compatible with STP and RSTP</td></tr><tr><td>Internal spanning tree (IST)</td><td>The instance of the common tree inside a region</td></tr><tr><td>Boundary port</td><td>A port at the edge of a region, towards an RSTP or STP bridge or an end station</td></tr></tbody></table>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="3-one-bpdu-for-all-instances">3. One BPDU for all instances<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#3-one-bpdu-for-all-instances" class="hash-link" aria-label="Direct link to 3. One BPDU for all instances" title="Direct link to 3. One BPDU for all instances" translate="no">​</a></h2>
<p>Proprietary per-VLAN spanning trees send one set of BPDUs per VLAN. MSTP instead puts all of its information into <strong>one BPDU format</strong> [1]:</p>
<ul>
<li class="">the BPDU starts with a standard RSTP BPDU;</li>
<li class="">an additional region section follows, with one message per MSTI (from 0 to 64 instances, although many bridges support fewer);</li>
<li class="">instead of the full table of VLAN-to-instance mappings, the BPDU carries an <strong>MD5 digest</strong> of it. Two neighbours with the same digest and the same configured region values belong to the same region.</li>
</ul>
<p>This keeps the number of BPDUs low. Because an RSTP bridge can read an MSTP BPDU as an RSTP BPDU, it also keeps compatibility with RSTP and with STP [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="4-a-region-seen-from-outside">4. A region seen from outside<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#4-a-region-seen-from-outside" class="hash-link" aria-label="Direct link to 4. A region seen from outside" title="Direct link to 4. A region seen from outside" translate="no">​</a></h2>
<p>To RSTP bridges outside, a whole MST region looks like <strong>one RSTP bridge</strong>, however many bridges it contains. MSTP uses a remaining-hops counter inside the region instead of the message age timer of RSTP. The message age is incremented only once when spanning-tree information enters a region, so RSTP bridges see the region as a single hop [1]. As in RSTP, boundary ports facing end stations can be edge ports and start forwarding at once [1].</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="5-mstp-among-the-control-options">5. MSTP among the control options<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#5-mstp-among-the-control-options" class="hash-link" aria-label="Direct link to 5. MSTP among the control options" title="Direct link to 5. MSTP among the control options" translate="no">​</a></h2>
<figure class="nc-figure nc-figure-image"><img src="https://cnam-ece.github.io/learning-materials/img/sources/intro2017-control-plane.png" alt="Control plane overview: VLANs assigned to control modes, and the control options for each topology layer" loading="lazy"><figcaption>Figure 3. Control options per VLAN: spanning-tree VLANs controlled by MSTP, shortest-path VLANs by IS-IS (SPB), and software-defined VLANs by an external agent, all in one network.<span class="nc-figure-source">Source: <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf">J. Farkas, “Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group,” IEEE 802.1, 15 May 2017</a>, <!-- -->slide 49<!-- -->;<!-- --> <!-- -->cropped, otherwise unchanged<!-- -->.</span></figcaption></figure>
<p>802.1Q assigns a <strong>control mode per VLAN</strong>. Spanning-tree VLANs are controlled by MSTP, shortest-path VLANs by IS-IS, and software-defined VLANs by an external agent, and the modes can coexist in one network [2]. A TSN network can therefore keep MSTP for its ordinary VLANs while a controller installs explicit paths for streams, with <a class="" href="https://cnam-ece.github.io/learning-materials/blog/ieee-802-1qca-path-control">path control</a> or a CNC.</p>
<p>For determinism, MSTP shares the properties of RSTP. Each VLAN has one active path between two bridges, and that path changes when the tree of its instance reconverges.</p>
<h2 class="anchor anchorTargetStickyNavbar_bCYu" id="references">References<a href="https://cnam-ece.github.io/learning-materials/blog/mstp-multiple-spanning-tree#references" class="hash-link" aria-label="Direct link to References" title="Direct link to References" translate="no">​</a></h2>
<ol>
<li class="">Wikipedia, "Spanning Tree Protocol," section on the Multiple Spanning Tree Protocol. <a href="https://en.wikipedia.org/wiki/Spanning_Tree_Protocol" target="_blank" rel="noopener noreferrer" class="">Article</a></li>
<li class="">J. Farkas, "Introduction to IEEE 802.1: Focus on the Time-Sensitive Networking Task Group," 15 May 2017, slide 49. <a href="https://www.ieee802.org/1/files/public/docs2017/tsn-farkas-intro-0517-v01.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
<li class="">P. Thaler, N. Finn, D. Fedyk, J. Farkas, G. Parsons, E. Gray, "IEEE 802.1Q: Media Access Control Bridges and Virtual Bridged Local Area Networks," IEEE 802.1 tutorial, IETF 86, 10 March 2013, slides 25–26. <a href="https://www.ieee802.org/802_tutorials/2013-03/8021-IETF-tutorial-final.pdf" target="_blank" rel="noopener noreferrer" class="">Slides</a></li>
</ol>]]></content:encoded>
            <category>Standard</category>
            <category>IEEE 802.1</category>
            <category>Presentation</category>
        </item>
    </channel>
</rss>