Latest revision as of 00:47, 29 January 2021

Abstract

We compare and evaluate how well-known and novel network-wide 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 GEANT network suggest that they can give quite different results.

Original document

The different versions of the original document can be found in:

• https://orbi.uliege.be/bitstream/2268/3427/1/SB-CoNext2005-Poster.pdf

• https://orbi.uliege.be/handle/2268/3427

• https://dblp.uni-trier.de/db/conf/conext/conext2005.html#BalonSL05,

https://core.ac.uk/display/13486396,

https://doi.acm.org/10.1145/1095921.1095952,

https://orbi.uliege.be/handle/2268/3427,

https://academic.microsoft.com/#/detail/1967009311

• http://dl.acm.org/ft_gateway.cfm?id=1095952&ftid=332944&dwn=1,

http://dx.doi.org/10.1145/1095921.1095952