output
20192026
most citedThe Maximum Common Subgraph Problem: A Portfolio Approach

21 citations

5 papers

cs.OS2026

Netkit: Specializing Linux Packet Delivery for Container Networks

Daniel Borkmann, Paul Chaignon

Cloud-native microservices architectures rely on network namespaces for isolation, with the overhead of container communications remaining a critical performance bottleneck. While…

cs.DC2022★ 12 cited

Multi-Agent Reinforcement Learning for Network Load Balancing in Data Center

Zhiyuan Yao, Zihan Ding, Thomas Clausen

This paper presents the network load balancing problem, a challenging real-world task for multi-agent reinforcement learning (MARL) methods. Traditional heuristic solutions like We…

cs.AR2021★ 13 cited

Charon: Load-Aware Load-Balancing in P4

Carmine Rizzi, Zhiyuan Yao, Yoann Desmouceaux +2

Load-Balancers play an important role in data centers as they distribute network flows across application servers and guarantee per-connection consistency. It is hard however to ma…

cs.DC2021★ 3 cited

Towards Intelligent Load Balancing in Data Centers

Zhiyuan Yao, Yoann Desmouceaux, Mark Townsley +1

Network load balancers are important components in data centers to provide scalable services. Workload distribution algorithms are based on heuristics, e.g., Equal-Cost Multi-Path…

cs.DS2019★ 21 cited

The Maximum Common Subgraph Problem: A Portfolio Approach

Andrea Marcelli, Stefano Quer, Giovanni Squillero

The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates…