Network planning with deep reinforcement learning

H Zhu, V Gupta, SS Ahuja, Y Tian, Y Zhang… - Proceedings of the 2021 …, 2021 - dl.acm.org
Network planning is critical to the performance, reliability and cost of web services. This
problem is typically formulated as an Integer Linear Programming (ILP) problem. Today's …

{Semi-oblivious} traffic engineering: The road not taken

P Kumar, Y Yuan, C Yu, N Foster, R Kleinberg… - … USENIX Symposium on …, 2018 - usenix.org
Networks are expected to provide reliable performance under a wide range of operating
conditions, but existing traffic engineering (TE) solutions optimize for performance or …

TEAVAR: striking the right utilization-availability balance in WAN traffic engineering

J Bogle, N Bhatia, M Ghobadi, I Menache… - Proceedings of the …, 2019 - dl.acm.org
To keep up with the continuous growth in demand, cloud providers spend millions of dollars
augmenting the capacity of their wide-area backbones and devote significant effort to …

Contracting wide-area network topologies to solve flow problems quickly

F Abuzaid, S Kandula, B Arzani, I Menache… - … USENIX Symposium on …, 2021 - usenix.org
Many enterprises today manage traffic on their wide-area networks using software-defined
traffic engineering schemes, which scale poorly with network size; the solver runtimes and …

Reasoning about Network Traffic Load Property at Production Scale

R Li, F Ye, Y Yuan, R Yang, B Tian, T Guo… - … USENIX Symposium on …, 2024 - usenix.org
This paper presents Jingubang, the first reported system for checking network traffic load
properties (eg, if any link's utilization would exceed 80% during a network change) in a …

Meissa: Scalable network testing for programmable data planes

N Zheng, M Liu, E Zhai, HH Liu, Y Li, K Yang… - Proceedings of the …, 2022 - dl.acm.org
Ensuring the correctness of programmable data planes is important. Testing offers
comprehensive correctness checking, including detecting both code bugs and non-code …

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides

G Xu, S Burer - Computational Optimization and Applications, 2018 - Springer
We study two-stage adjustable robust linear programming in which the right-hand sides are
uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the …

Cost-effective capacity provisioning in wide area networks with Shoofly

R Singh, N Bjorner, S Shoham, Y Yin, J Arnold… - Proceedings of the …, 2021 - dl.acm.org
In this work we propose Shoofly, a network design tool that minimizes hardware costs of
provisioning long-haul capacity by optically bypassing network hops where conversion of …

Enabling quasi-static reconfigurable networks with robust topology engineering

MY Teh, S Zhao, P Cao… - IEEE/ACM Transactions …, 2022 - ieeexplore.ieee.org
Many optical circuit switched data center networks (DCN) have been proposed in the last
decade to attain higher capacity and topology reconfigurability, though commercial adoption …

A General and Efficient Approach to Verifying Traffic Load Properties under Arbitrary k Failures

R Li, Y Yuan, F Ye, M Liu, R Yang, Y Yu, T Guo… - Proceedings of the …, 2024 - dl.acm.org
This paper presents YU, the first verification system for checking traffic load properties under
arbitrary failure scenarios that can scale to production Wide Area Networks (WANs). Building …