5 papers
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…
Saihu: A Common Interface of Worst-Case Delay Analysis Tools for Time-Sensitive Networks
Chun-Tso Tsai, Seyed Mohammadhossein Tabatabaee, Stéphan Plassart +1
Time-sensitive networks, as in the context of IEEE-TSN and IETF-Detnet, require bounds on worst-case delays. Various network analysis tools compute such bounds; these tools are bas…
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…
Deficit Round-Robin: A Second Network Calculus Analysis
Seyed Mohammadhossein Tabatabaee, Jean-Yves Le Boudec
Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays for DRR were found by Boyer et…
Interleaved Weighted Round-Robin: A Network Calculus Analysis
Seyed Mohammadhossein Tabatabaee, Jean-Yves Le Boudec, Marc Boyer
Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be serve…