http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Meng_et_al_2007aMeng et al 2007a - Revision history2026-05-11T13:34:59ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Meng_et_al_2007a&diff=183744&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 850175013 to Meng et al 2007a2021-01-25T09:25:57Z<p>Scipediacontent moved page <a href="/public/Draft_Content_850175013" class="mw-redirect" title="Draft Content 850175013">Draft Content 850175013</a> to <a href="/public/Meng_et_al_2007a" title="Meng et al 2007a">Meng et al 2007a</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 09:25, 25 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>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Meng_et_al_2007a&diff=183743&oldid=prevScipediacontent: Created page with " == Abstract == This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms tr..."2021-01-25T09:25:54Z<p>Created page with " == Abstract == This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms tr..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms try to minimize the interference between different source-destination pairs by circumventing the critical links. But the process of identifying critical links is very computationally expensive. The main contribution of this paper is a new precomputation approach of route selection considering the interference. The proposed algorithm reduces online computing complexity through efficient precomputation. From the simulation results, the proposed algorithm outperforms prior algorithms in terms of efficiency and complexity.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf]<br />
<br />
* [http://link.springer.com/content/pdf/10.1007/11947950_44 http://link.springer.com/content/pdf/10.1007/11947950_44],<br />
: [http://dx.doi.org/10.1007/11947950_44 http://dx.doi.org/10.1007/11947950_44] under the license http://www.springer.com/tdm<br />
<br />
* [https://dblp.uni-trier.de/db/conf/icdcn/icdcn2006.html#MengSM06 https://dblp.uni-trier.de/db/conf/icdcn/icdcn2006.html#MengSM06],<br />
: [https://link.springer.com/chapter/10.1007%2F11947950_44 https://link.springer.com/chapter/10.1007%2F11947950_44],<br />
: [http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf http://wpage.unina.it/vittorio.manetti/documents/200ZhaoweiMeng.pdf],<br />
: [https://www.researchgate.net/profile/Vittorio_Manetti/publication/220725279_A_New_Precomputation_Scheme_for_MPLS_Traffic_Engineering_Routing/links/0912f50752ac941346000000.pdf https://www.researchgate.net/profile/Vittorio_Manetti/publication/220725279_A_New_Precomputation_Scheme_for_MPLS_Traffic_Engineering_Routing/links/0912f50752ac941346000000.pdf],<br />
: [https://rd.springer.com/chapter/10.1007/11947950_44 https://rd.springer.com/chapter/10.1007/11947950_44],<br />
: [https://academic.microsoft.com/#/detail/1575059480 https://academic.microsoft.com/#/detail/1575059480]</div>Scipediacontent