Skip to main content

7 posts tagged with "YouTube"

Resource type: recorded lectures and seminars on YouTube

View All Tags

Why deterministic guarantees? From TSN to worst-case bounds

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

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

Min-plus algebra: the language of network calculus

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

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

Aggregate multiplexing and residual service

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

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

Dynamic reconfiguration of TSN: where network calculus fits

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

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