Jérémie Leguay
YOU?
Author Swipe
View article: Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation Open
In real-life applications, most optimization problems are variants of well-known combinatorial optimization problems, including additional constraints to fit with a particular use case. Usually, efficient algorithms to handle a restricted …
View article: Multitopology Routing With Virtual Topologies and Segment Routing
Multitopology Routing With Virtual Topologies and Segment Routing Open
Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies…
View article: Safe Load Balancing in Software-Defined-Networking
Safe Load Balancing in Software-Defined-Networking Open
High performance, reliability and safety are crucial properties of any Software-Defined-Networking (SDN) system. Although the use of Deep Reinforcement Learning (DRL) algorithms has been widely studied to improve performance, their practic…
View article: Equilibrage de charge avec un apprentissage par renforcement sûr
Equilibrage de charge avec un apprentissage par renforcement sûr Open
International audience
View article: Virtual Multi-Topology Routing for QoS Constraints
Virtual Multi-Topology Routing for QoS Constraints Open
International audience
View article: Semi-Distributed Coflow Scheduling in Datacenters
Semi-Distributed Coflow Scheduling in Datacenters Open
International audience
View article: Alternative paths computation for congestion mitigation in segment-routing networks
Alternative paths computation for congestion mitigation in segment-routing networks Open
In backbone networks, it is fundamental to quickly protect traffic against any unexpected event, such as failures or congestions, which may impact Quality of Service (QoS). Standard solutions based on Segment Routing (SR), such as Topology…
View article: Towards Safe Load Balancing based on Control Barrier Functions and Deep Reinforcement Learning
Towards Safe Load Balancing based on Control Barrier Functions and Deep Reinforcement Learning Open
Deep Reinforcement Learning (DRL) algorithms have recently made significant strides in improving network performance. Nonetheless, their practical use is still limited in the absence of safe exploration and safe decision-making. In the con…
View article: Loss/Delay instances for vIGP
Loss/Delay instances for vIGP Open
This dataset contains network topologies and their asociated demands with QoS requirements (loss and delay). These instances are based on the SDNlib dataset.
View article: Virtual Multi-Topology Routing for QoS Constraints
Virtual Multi-Topology Routing for QoS Constraints Open
Multi-topology routing (MTR) provides an attractive alternative to segment routing for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and…
View article: Loss/Delay instances for vIGP
Loss/Delay instances for vIGP Open
This dataset contains network topologies and their asociated demands with QoS requirements (loss and delay). These instances are based on the SDNlib dataset.
View article: Graph Convolutional Reinforcement Learning for Load Balancing and Smart Queuing
Graph Convolutional Reinforcement Learning for Load Balancing and Smart Queuing Open
International audience
View article: AMAC: Attention-based Multi-Agent Cooperation for Smart Load Balancing
AMAC: Attention-based Multi-Agent Cooperation for Smart Load Balancing Open
International audience
View article: Global QoS Policy Optimization in SD-WAN
Global QoS Policy Optimization in SD-WAN Open
In modern SD-WAN networks, a global controller is able to steer traffic on different paths based on application requirements and global intents. However, existing solutions cannot dynamically tune the way bandwidth is shared between flows …
View article: Routing and slot allocation in 5G hard slicing
Routing and slot allocation in 5G hard slicing Open
View article: Protected load balancing problem: Neural-network based approximation for non-convex optimization
Protected load balancing problem: Neural-network based approximation for non-convex optimization Open
Nowadays, centralized Path Computation Elements (PCE) integrate control plane algorithms to optimize routing and load-balancing continuously. When a link fails, the traffic load is automatically transferred to the remaining paths according…
View article: Routing and QoS Policy Optimization in SD-WAN
Routing and QoS Policy Optimization in SD-WAN Open
In modern SD-WAN networks, a global controller continuously optimizes application and user intents by selecting the proper routing policies for each application. Nevertheless, the competition between flows can still occur at each overlay l…
View article: Scalable Damper-based Deterministic Networking
Scalable Damper-based Deterministic Networking Open
With 5G networking, deterministic guarantees are emerging as a key enabler. In this context, we present a scalable Damper-based architecture for Large-scale Deterministic IP Networks (D-LDN) that meets required bounds on end-to-end delay a…
View article: Fair Coflow Scheduling via Controlled Slowdown
Fair Coflow Scheduling via Controlled Slowdown Open
The average coflow completion time (CCT) is the standard performance metric in coflow scheduling. However, standard CCT minimization may introduce unfairness between the data transfer phase of different computing jobs. Thus, while progress…
View article: Graph Convolutional Reinforcement Learning for Collaborative Queuing Agents
Graph Convolutional Reinforcement Learning for Collaborative Queuing Agents Open
In this paper, we explore the use of multi-agent deep learning as well as learning to cooperate principles to meet stringent service level agreements, in terms of throughput and end-to-end delay, for a set of classified network flows. We c…
View article: Model-independent routing for low latency
Model-independent routing for low latency Open
View article: Lagrangian relaxation for the design of virtual IGP topologies
Lagrangian relaxation for the design of virtual IGP topologies Open
International audience
View article: Minimisation du temps de complétion pour les coflux
Minimisation du temps de complétion pour les coflux Open
View article: Approximability of Robust Network Design: The Directed Case
Approximability of Robust Network Design: The Directed Case Open
We consider robust network design problems where an uncertain traffic vector belonging to a polytope has to be dynamically routed to minimize either the network congestion or some linear reservation cost. We focus on the variant in which t…
View article: Offloading computing tasks beyond the edge: A data-driven analysis
Offloading computing tasks beyond the edge: A data-driven analysis Open
International audience
View article: Affine routing for robust network design
Affine routing for robust network design Open
Taking into account the dynamic nature of traffic in telecommunication networks, the robust network design problem is to fix the edge capacities so that all demand vectors belonging to a polytope can be routed. While a common heuristic for…
View article: Optimisation contrainte d'une politique d'équilibrage de charge
Optimisation contrainte d'une politique d'équilibrage de charge Open
L'équilibrage de charge consisteà répartir le trafic entre une paire de noeuds sur plusieurs chemins afin d'améliorer les performances du réseau. Idéalement, la politique d'équilibrage devrait s'adapter en fonction du trafic et anticiper s…
View article: On the approximability of robust network design
On the approximability of robust network design Open
View article: Génération de colonnes pour le problème de routage à délai variable
Génération de colonnes pour le problème de routage à délai variable Open
International audience
View article: Autour de l'approximabilité du problème de dimensionnement robuste des réseaux
Autour de l'approximabilité du problème de dimensionnement robuste des réseaux Open
International audience