4 papers
Improved Delay Bound for a Service Curve Element with Known Transmission Rate
Ehsan Mohammadpour, Elena Stai, Jean-Yves Le Boudec
Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves. We consider a FIFO system that offers a rate-latency service curve…
Improved Credit Bounds for the Credit-Based Shaper in Time-Sensitive Networking
Ehsan Mohammadpour, Eleni Stai, Jean-Yves Le Boudec
In Time-Sensitive Networking (TSN), it is important to formally prove per flow latency and backlog bounds. To this end, recent works apply network calculus and obtain latency bound…
A Polynomial-Time Method for Testing Admissibility of Uncertain Power Injections in Microgrids
Cong Wang, Eleni Stai, Jean-Yves Le Boudec
We study the admissibility of power injections in single-phase microgrids, where the electrical state is represented by complex nodal voltages and controlled by nodal power injecti…
Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping
Ehsan Mohammadpour, Eleni Stai, Maaz Mohiuddin +1
We compute bounds on end-to-end worst-case latency and on nodal backlog size for a per-class deterministic network that implements Credit Based Shaper (CBS) and Asynchronous Traffi…