https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Leduc_et_al_2005aLeduc et al 2005a - Revision history2026-05-08T20:56:14ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Leduc_et_al_2005a&diff=195912&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 734461552 to Leduc et al 2005a2021-01-28T23:47:30Z<p>Scipediacontent moved page <a href="/public/Draft_Content_734461552" class="mw-redirect" title="Draft Content 734461552">Draft Content 734461552</a> to <a href="/public/Leduc_et_al_2005a" title="Leduc et al 2005a">Leduc et al 2005a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 23:47, 28 January 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Leduc_et_al_2005a&diff=195911&oldid=prevScipediacontent: Created page with " == Abstract == We compare and evaluate how well-known and novel network-wide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare t..."2021-01-28T23:47:23Z<p>Created page with " == Abstract == We compare and evaluate how well-known and novel network-wide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare t..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
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.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://orbi.uliege.be/bitstream/2268/3427/1/SB-CoNext2005-Poster.pdf https://orbi.uliege.be/bitstream/2268/3427/1/SB-CoNext2005-Poster.pdf]<br />
<br />
* [https://orbi.uliege.be/handle/2268/3427 https://orbi.uliege.be/handle/2268/3427]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/conext/conext2005.html#BalonSL05 https://dblp.uni-trier.de/db/conf/conext/conext2005.html#BalonSL05],<br />
: [https://core.ac.uk/display/13486396 https://core.ac.uk/display/13486396],<br />
: [https://doi.acm.org/10.1145/1095921.1095952 https://doi.acm.org/10.1145/1095921.1095952],<br />
: [https://orbi.uliege.be/handle/2268/3427 https://orbi.uliege.be/handle/2268/3427],<br />
: [https://academic.microsoft.com/#/detail/1967009311 https://academic.microsoft.com/#/detail/1967009311]<br />
<br />
* [http://dl.acm.org/ft_gateway.cfm?id=1095952&amp;ftid=332944&amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=1095952&amp;ftid=332944&amp;dwn=1],<br />
: [http://dx.doi.org/10.1145/1095921.1095952 http://dx.doi.org/10.1145/1095921.1095952]</div>Scipediacontent