Network planning with deep reinforcement learning
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 …
problem is typically formulated as an Integer Linear Programming (ILP) problem. Today's …
{Semi-oblivious} traffic engineering: The road not taken
Networks are expected to provide reliable performance under a wide range of operating
conditions, but existing traffic engineering (TE) solutions optimize for performance or …
conditions, but existing traffic engineering (TE) solutions optimize for performance or …
TEAVAR: striking the right utilization-availability balance in WAN traffic engineering
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 …
augmenting the capacity of their wide-area backbones and devote significant effort to …
Contracting wide-area network topologies to solve flow problems quickly
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 …
traffic engineering schemes, which scale poorly with network size; the solver runtimes and …
Reasoning about Network Traffic Load Property at Production Scale
This paper presents **gubang, 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 …
properties (eg, if any link's utilization would exceed 80% during a network change) in a …
Meissa: Scalable network testing for programmable data planes
Ensuring the correctness of programmable data planes is important. Testing offers
comprehensive correctness checking, including detecting both code bugs and non-code …
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
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 …
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
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 …
provisioning long-haul capacity by optically bypassing network hops where conversion of …
Enabling quasi-static reconfigurable networks with robust topology engineering
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 …
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
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 …
arbitrary failure scenarios that can scale to production Wide Area Networks (WANs). Building …