5 citations · 11 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
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…
Of Kernels and Queues: when network calculus meets analytic combinatorics
Anne Bouillard, Céline Comte, Élie De Panafieu +1
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues…
Stability and performance guarantees in networks with cyclic dependencies
Anne Bouillard
With the development of real-time networks such as reactive embedded systems, there is a need to compute deterministic performance bounds. This paper focuses on the performance gua…
Monotony in Service Orchestrations
Anne Bouillard, Sidney Rosario, Albert Benveniste +1
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given performance to the orche…