https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Adami_et_al_2009aAdami et al 2009a - Revision history2026-04-18T17:18:41ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Adami_et_al_2009a&diff=195736&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 310470529 to Adami et al 2009a2021-01-28T23:27:40Z<p>Scipediacontent moved page <a href="/public/Draft_Content_310470529" class="mw-redirect" title="Draft Content 310470529">Draft Content 310470529</a> to <a href="/public/Adami_et_al_2009a" title="Adami et al 2009a">Adami 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 23:27, 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=Adami_et_al_2009a&diff=195735&oldid=prevScipediacontent: Created page with " == Abstract == Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based p..."2021-01-28T23:27:35Z<p>Created page with " == Abstract == Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based p..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints. This paper deals with two distinct categories of path computation algorithms: on-line path computation algorithms adn on-line multi path algorithms. All these algorithms have been implemented in NS2 as an extension of OSPF-TE\ s and integrated with RSVP-TE\ s.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.4108/icst.simutools2008.2930 http://dx.doi.org/10.4108/icst.simutools2008.2930]<br />
<br />
* [http://eudl.eu/pdf/10.4108/ICST.SIMUTOOLS2008.2930 http://eudl.eu/pdf/10.4108/ICST.SIMUTOOLS2008.2930]<br />
<br />
* [https://arpi.unipi.it/handle/11568/187000 https://arpi.unipi.it/handle/11568/187000],<br />
: [https://dblp.uni-trier.de/db/conf/simutools/simutools2008.html#AdamiGCP08 https://dblp.uni-trier.de/db/conf/simutools/simutools2008.html#AdamiGCP08],<br />
: [https://eudl.eu/doi/10.4108/ICST.SIMUTOOLS2008.2930 https://eudl.eu/doi/10.4108/ICST.SIMUTOOLS2008.2930],<br />
: [https://academic.microsoft.com/#/detail/2029069922 https://academic.microsoft.com/#/detail/2029069922]</div>Scipediacontent