http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Roux_et_al_2007b 2026-05-11T06:11:37Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 http://www.colloquiam.com/wd/index.php?title=Roux_et_al_2007b&diff=201567&oldid=prev 2021-02-02T03:53:18Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_472087197" class="mw-redirect" title="Draft Content 472087197">Draft Content 472087197</a> to <a href="/public/Roux_et_al_2007b" title="Roux et al 2007b">Roux et al 2007b</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 03:53, 2 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>

Scipediacontent http://www.colloquiam.com/wd/index.php?title=Roux_et_al_2007b&diff=201566&oldid=prev 2021-02-02T03:53:11Z

<p>Created page with &quot; == Abstract == International audience; In Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE) networks with distributed tunnel path computation on head-end routers,...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> International audience; In Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE) networks with distributed tunnel path computation on head-end routers, tunnel requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. The order in which requests are handled has a significant impact on the network optimization and blocking probability. If it is not possible to control the arrival order, in return it is possible, in some cases, to reorder requests using the preemption function. This paper evaluates the impact of the arrival order, so as to determine efficient orders. It then proposes two preemption strategies so as to reorder arrivals and evaluate these strategies applied to the shortest constrained path computation algorithm.<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [http://www.irisa.fr/prive/bcousin/Articles/GIIS-2007.pdf http://www.irisa.fr/prive/bcousin/Articles/GIIS-2007.pdf]<br /> <br /> * [http://xplorestaging.ieee.org/ielx5/4404149/4404150/04404195.pdf?arnumber=4404195 http://xplorestaging.ieee.org/ielx5/4404149/4404150/04404195.pdf?arnumber=4404195],<br /> : [http://dx.doi.org/10.1109/giis.2007.4404195 http://dx.doi.org/10.1109/giis.2007.4404195]<br /> <br /> * [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004404195 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004404195],<br /> : [https://www.irisa.fr/prive/Bernard.Cousin/Articles/GIIS-2007.pdf https://www.irisa.fr/prive/Bernard.Cousin/Articles/GIIS-2007.pdf],<br /> : [https://hal.archives-ouvertes.fr/hal-01184229 https://hal.archives-ouvertes.fr/hal-01184229],<br /> : [https://hal.archives-ouvertes.fr/hal-01184229/document https://hal.archives-ouvertes.fr/hal-01184229/document],<br /> : [http://www.irisa.fr/prive/bcousin/Articles/GIIS-2007.pdf http://www.irisa.fr/prive/bcousin/Articles/GIIS-2007.pdf],<br /> : [https://ieeexplore.ieee.org/document/4404195 https://ieeexplore.ieee.org/document/4404195],<br /> : [https://academic.microsoft.com/#/detail/1990684432 https://academic.microsoft.com/#/detail/1990684432]<br /> <br /> * [https://hal.archives-ouvertes.fr/hal-01184229 https://hal.archives-ouvertes.fr/hal-01184229],<br /> : [https://hal.archives-ouvertes.fr/hal-01184229/document https://hal.archives-ouvertes.fr/hal-01184229/document],<br /> : [https://hal.archives-ouvertes.fr/hal-01184229/file/GIIS-2007.pdf https://hal.archives-ouvertes.fr/hal-01184229/file/GIIS-2007.pdf]</div>

Scipediacontent