Publications by Eleni Stai | EPFL Graph Search

Related publications (11)

Dispatching Stochastic Heterogeneous Resources Accounting for Grid and Battery Losses

Mario Paolone, Jean-Yves Le Boudec, Fabrizio Sossan, Lorenzo Enrique Reyes Chamorro, Eleni Stai

We compute an optimal day-ahead dispatch plan for distribution networks with stochastic resources and batteries, while accounting for grid and battery losses. We formulate and solve a scenario-based AC Optimal Power Flow (OPF), which is by construction non ...

2018

FCR: Fast and Consistent Controller-Replication in Software Defined Networking

Jean-Yves Le Boudec, Maaz Mashood Mohiuddin, Eleni Stai, Mia Primorac

We consider the problem of coordination among replicated SDN controllers, where the challenge is to ensure a consistent view of the network while reacting to network events in a prompt manner. Existing solutions are either consensus-based, which achieve co ...

2019

Online Battery Storage Management via Lyapunov Optimization in Active Distribution Grids

Jean-Yves Le Boudec, Cong Wang, Eleni Stai

We consider low run-time complexity power management in distribution grids with renewable energy sources (RESs) and batteries, where forecasts are unavailable. We propose iterative Lyapunov Real-time Control (iLypRC), a fast online algorithm, which does no ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Admissibility of Uncertain Injections in Quadratic Algebraic Systems

Jean-Yves Le Boudec, Cong Wang, Eleni Stai

We study the admissibility problem in multivariate algebraic systems, such as ac electrical networks, where the power injection is quadratic in the state. The goal of such systems is to ensure that the state stays in some security set (e.g., magnitudes of ...

2021

On the Solution of the Optimal Power Flow for Three-Phase Radial Distribution Networks With Energy Storage

Jean-Yves Le Boudec, Cong Wang, Eleni Stai

We study a multiperiod optimal power flow (OPF) problem in unbalanced three-phase radial distribution networks with batteries. To address this problem, we first take the resistance-line battery model that treats lossy batteries by adding resistive lines an ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

A Receding Horizon Control Approach For Re-Dispatching Stochastic Heterogeneous Resources Accounting for Grid and Battery Losses

Mario Paolone, Jean-Yves Le Boudec, Fabrizio Sossan, Emil Namor, Eleni Stai

In this paper, we propose a re-dispatch scheme for radial distribution grids hosting stochastic Distributed Energy Resources (DERs) and controllable batteries. At each re-dispatch round, the proposed scheme computes a new dispatch plan that modifies and ex ...

Elsevier2019

Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour, Maaz Mashood Mohiuddin

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 Traffic Shaping (ATS), as proposed by the Time-Sensitive Networking (TSN) standard ...

IEEE2018

Improved Credit Bounds for the Credit-Based Shaper in Time-Sensitive Networking

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour

In Time-Sensitive Networking (TSN), it is important to formally prove per-flow latency and backlog bounds. To this end, recent works have applied network calculus and obtained latency bounds from service curves. The latency component of such service curves ...

2019

Improved Delay Bound for a Service Curve Element with Known Transmission Rate

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour

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 and where packet transmission occurs at line rate without pre-emption. The ...

2019

Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity Networks

Eleni Stai

Computing the most central nodes in large-scale commodity networks is rather important for improving routing and associated applications. In this paper, we introduce a novel framework for the analysis and efficient computation of routing path-based central ...

Ieee Computer Soc2017

Improved 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 INC2023