A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare the objective functions we model the TE problem as a linear program and solve it to optimality, thus finding for each objective function the best possible target of any heuristic TE algorithm. Our first results on the GÉANT network suggest that they can give quite different results.doi:10.1145/1095921.1095952 dblp:conf/conext/BalonSL05 fatcat:yh7ogzwb45goni23xeiegeetna