5 citations · 11 across the 10 of their papers we have counts for
12 papers
Sub-additive service curves in the Network Calculus analysis
Anne Bouillard
Network Calculus is a theoretical model that aims at providing upper bounds of worst-case performance (such as delay or buffer occupancy). This is a mathematical framework that han…
Quasi-Deterministic Burstiness Bound for Aggregate of Independent, Periodic Flows
Seyed Mohammadhossein Tabatabaee, Anne Bouillard, Jean-Yves Le Boudec
Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and…
Stochastic Network Calculus with Localized Application of Martingales
Anne Bouillard
Stochastic Network Calculus is a probabilistic method to compute performance bounds in networks, such as end-to-end delays. It relies on the analysis of stochastic processes using…
Worst-case Delay Analysis of Time-Sensitive Networks with Deficit Round-Robin
Seyed Mohammadhossein Tabatabaee, Anne Bouillard, Jean-Yves Le Boudec
In feed-forward time-sensitive networks with Deficit Round-Robin (DRR), worst-case delay bounds were obtained by combining Total Flow Analysis (TFA) with the strict service curve c…
Unleashing the Power of Paying Multiplexing Only Once in Stochastic Network Calculus
Anne Bouillard, Paul Nikolaus, Jens Schmitt
The stochastic network calculus (SNC) holds promise as a versatile and uniform framework to calculate probabilistic performance bounds in networks of queues. A great challenge to a…
Trade-off between accuracy and tractability of network calculus in FIFO networks
Anne Bouillard
Computing accurate deterministic performance bounds is a strong need for communication technologies having strong requirements on latency and reliability. Beyond new scheduling pro…