Publication
Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks
Related publications (70)
Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus
Seyed Mohammadhossein Tabatabaee
Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...
EPFL2023A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks
Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...
EPFL2023Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks
Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour
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. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023Deficit Round-Robin: A Second Network Calculus Analysis
Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee
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 al., who used a rigorous network calculus approach and characterized the ser ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022Interleaved Weighted Round-Robin: A Network Calculus Analysis
Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee
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 served consecutively, which leads to a bursty service. Interleaved Weighted Round ...
IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS2021Extending R2P2 with Congestion Control and Request-Level Scheduling
Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...
2020Interleaved Weighted Round-Robin: A Network Calculus Analysis
Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee
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 served consecutively, which leads to a bursty service. Interleaved Weighted Round ...
2020Destination buffer analysis for packets rejection obliteration in multi-channel networks
In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...
2019Reliability Mechanisms for Controllers in Real-Time Cyber-Physical Systems
Cyber-physical systems (CPSs) are real-world processes that are controlled by computer algorithms. We consider CPSs where a centralized, software-based controller maintains the process in a desired state by exchanging measurements and setpoints with proces ...
EPFL2018Bridging the gap between dataplanes and commodity operating systems
The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and microsecond-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. In particular, dataplanes borrow d ...
EPFL2018