https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Nardelli_et_al_2009aNardelli et al 2009a - Revision history2026-04-18T17:20:38ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Nardelli_et_al_2009a&diff=204921&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 412552064 to Nardelli et al 2009a2021-02-03T15:44:17Z<p>Scipediacontent moved page <a href="/public/Draft_Content_412552064" class="mw-redirect" title="Draft Content 412552064">Draft Content 412552064</a> to <a href="/public/Nardelli_et_al_2009a" title="Nardelli et al 2009a">Nardelli et al 2009a</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 15:44, 3 February 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=Nardelli_et_al_2009a&diff=204920&oldid=prevScipediacontent: Created page with " == Abstract == In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and..."2021-02-03T15:44:14Z<p>Created page with " == Abstract == In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed through a thorough implementation phase of these algorithms solving a number of issues related to protocol implementation that allows a complete analysis in real traffic settings in real networks. We discuss the performance of such protocols and some difficulties encountered during their implementation. Supported by an already mature standardization framework we conclude that dynamic yet stable traffic engineering is not only feasible but expected with rising interest by network operators.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://www.diegoperino.com/publications/icumt09a.pdf http://www.diegoperino.com/publications/icumt09a.pdf]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/5340227/5345316/05345516.pdf?arnumber=5345516 http://xplorestaging.ieee.org/ielx5/5340227/5345316/05345516.pdf?arnumber=5345516],<br />
: [http://dx.doi.org/10.1109/icumt.2009.5345516 http://dx.doi.org/10.1109/icumt.2009.5345516]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/icumt/icumt2009.html#MuscarielloPN09 https://dblp.uni-trier.de/db/conf/icumt/icumt2009.html#MuscarielloPN09],<br />
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005345516 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005345516],<br />
: [https://ieeexplore.ieee.org/document/5345516 https://ieeexplore.ieee.org/document/5345516],<br />
: [https://academic.microsoft.com/#/detail/2157120127 https://academic.microsoft.com/#/detail/2157120127]</div>Scipediacontent