Traffic Engineering

This section demonstrates the expressiveness of TIE for doing traffic engineering. We propose an optimization problem that balances link utilization on the network only by selecting the appropriate egress point for each pair $(i,p)$ (i.e., by setting the values of $\beta(i,p,e)$). This is in contrast with the common practice of optimizing link utilization by either tweaking IGP link weights or BGP policies. After defining the optimization problem and presenting our solution, we evaluate our solution by comparing the link utilizations achieved using TIE to that using the current network configuration.