Communication Systems and Routing

In modern communication networks, backbone infrastructure must dynamically adjust routes to accommodate wildly fluctuating traffic demands from streaming services, cloud computing, and IoT devices. Traffic Engineering (TE) utilizing Model Predictive Control (MPC) resolves these complex allocations but faces competing demands: operators must route packets efficiently to strictly avoid bandwidth congestion, yet they must also suppress erratic, sudden changes to the routing policies to maintain overall network stability.

This routing challenge is frequently framed as a strongly convex multi-objective optimization problem over a predictive time horizon.

\[\begin{split}\text{Congestion Excess: } & f_1(R) = \sum_{k=t+1}^{t+h} \|\zeta(k)\|_2^2 \\ \text{Route Volatility: } & f_2(R) = \sum_{k=t+1}^{t+h} \|\Delta R(k)\|_2^2\end{split}\]

Where \(R(k)\) is the routing allocation matrix at time step \(k\), \(\zeta(k)\) represents the bandwidth excess above target capacity, and \(\Delta R(k)\) denotes the modifications applied to the traffic routing.

Simultaneously minimizing both objectives heavily relies on strong convexity. Even if the network flow constraints are piece-wise linear or broadly just convex, the explicit \(L_2\) penalty on the route changes (\(\|\Delta R(k)\|_2^2\)) injects a mathematically strict positive-definite curvature into the optimization landscape. This uniformly bounds the Hessian away from zero, enforcing the strong convexity of the routing matrix modifications.

For real-time network controllers, instantly reacting to traffic bursts while balancing these trade-offs using standard Quadratic Programming solvers at every microsecond is computationally prohibitive. By fitting a Bézier simplex to the Pareto front of the sub-games, operators unlock an instantaneous, purely arithmetic continuous mapping of the exact trade-offs between congestion and routing modifications. The network can then dynamically, and safely, slide along the Pareto front using continuous polynomial evaluations instead of repeatedly executing heavy optimization loops, ensuring uninterrupted low-latency services.