77 citations · 133 across the 8 of their papers we have counts for
4 papers · 1 filter
Improved Network Calculus Delay Bounds in Time-Sensitive Networks
Ehsan Mohammadpour, Eleni Stai, Jean-Yves Le Boudec
In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. Howeve…
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…
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…