Publications by Eleni Stai | EPFL Graph Search

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

Eleni Stai

Chat with Graph Search

Dispatching Stochastic Heterogeneous Resources Accounting for Grid and Battery Losses

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

Online Battery Storage Management via Lyapunov Optimization in Active Distribution Grids

Admissibility of Uncertain Injections in Quadratic Algebraic Systems

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

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

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

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

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

Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks