Skip to main content

10 posts tagged with "Network calculus"

Technology: deterministic network calculus bounds and analyses

View All Tags

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.

IEEE 802.1Qcr ATS: asynchronous traffic shaping without a clock

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

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

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

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

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

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

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

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