Scipediacontent: Scipediacontent moved page Draft Content 727284071 to Leduc et al 2006a

2021-01-25T09:33:17Z

Scipediacontent moved page Draft Content 727284071 to Leduc et al 2006a

Scipediacontent: Created page with " == Abstract == We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare th..."

2021-01-25T09:33:13Z

Created page with " == Abstract == We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare th..."

New page

== Abstract ==

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. We show that all the objective functions are not equivalent and some are far better than others. Considering the preferences a network operator may have, we show which objective functions are adequate or not. Peer reviewed

== Original document ==

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

* [https://link.springer.com/content/pdf/10.1007%2F11753810_7.pdf https://link.springer.com/content/pdf/10.1007%2F11753810_7.pdf]

* [https://orbi.uliege.be/handle/2268/3395 https://orbi.uliege.be/handle/2268/3395]

* [http://link.springer.com/content/pdf/10.1007/11753810_7 http://link.springer.com/content/pdf/10.1007/11753810_7],
: [http://dx.doi.org/10.1007/11753810_7 http://dx.doi.org/10.1007/11753810_7] under the license http://www.springer.com/tdm

* [https://link.springer.com/chapter/10.1007/11753810_7 https://link.springer.com/chapter/10.1007/11753810_7],
: [https://dblp.uni-trier.de/db/conf/networking/networking2006.html#BalonSL06 https://dblp.uni-trier.de/db/conf/networking/networking2006.html#BalonSL06],
: [http://wpage.unina.it/pescape/cit/new2511/Networking2006-Balon.pdf http://wpage.unina.it/pescape/cit/new2511/Networking2006-Balon.pdf],
: [http://core.ac.uk/display/13475861 http://core.ac.uk/display/13475861],
: [http://dx.doi.org/10.1007/11753810_7 http://dx.doi.org/10.1007/11753810_7],
: [https://rd.springer.com/chapter/10.1007/11753810_7 https://rd.springer.com/chapter/10.1007/11753810_7],
: [https://orbi.uliege.be/handle/2268/3395 https://orbi.uliege.be/handle/2268/3395],
: [https://academic.microsoft.com/#/detail/1913894557 https://academic.microsoft.com/#/detail/1913894557]

← Older revision	Revision as of 09:33, 25 January 2021
(No difference)

Leduc et al 2006a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 727284071 to Leduc et al 2006a

Scipediacontent: Created page with " == Abstract == We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare th..."