https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Guedrez_et_al_2016a 2026-05-07T16:02:03Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Guedrez_et_al_2016a&diff=202304&oldid=prev 2021-02-02T05:34:15Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_244415216" class="mw-redirect" title="Draft Content 244415216">Draft Content 244415216</a> to <a href="/public/Guedrez_et_al_2016a" title="Guedrez et al 2016a">Guedrez et al 2016a</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 05:34, 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 https://www.scipedia.com/wd/index.php?title=Guedrez_et_al_2016a&diff=202303&oldid=prev 2021-02-02T05:34:07Z

<p>Created page with &quot; == Abstract == International audience; Abstract: Segment Routing is a new architecture that leverages the source routing mechanism to enhance packet forwarding in networks....&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> International audience; Abstract: Segment Routing is a new architecture that leverages the source routing mechanism to enhance packet forwarding in networks. It is designed to operate over either an MPLS (SR-MPLS) or an IPv6 control plane. SR-MPLS encodes a path as a stack of labels inserted in the packet header by the ingress node. This overhead may violate the Maximum SID Depth (MSD), the equipment hardware limitation which indicates the maximum number of labels an ingress node can push onto the packet header. Currently, the MSD varies from 3 to 5 depending on the equipment manufacturer. Therefore, the MSD value considerably limits the number of paths that can be implemented with SR-MPLS, leading to an inefficient network resource utilization and possibly to congestion. We propose and analyze SR-LEA, an algorithm for an efficient path label encoding that takes advantage of the existing IGP shortest paths in the network. The output of SR-LEA is the minimum label stack to express SR-MPLS paths according to the MSD constraint. Therefore, SR-LEA substantially slackens the impact of MSD and restores the path diversity that MSD forbids in the network.<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [https://hal.archives-ouvertes.fr/hal-01574155 https://hal.archives-ouvertes.fr/hal-01574155]<br /> <br /> * [http://xplorestaging.ieee.org/ielx7/7764659/7778571/07778603.pdf?arnumber=7778603 http://xplorestaging.ieee.org/ielx7/7764659/7778571/07778603.pdf?arnumber=7778603],<br /> : [http://dx.doi.org/10.1109/nca.2016.7778603 http://dx.doi.org/10.1109/nca.2016.7778603]<br /> <br /> * [https://ieeexplore.ieee.org/document/7778603 https://ieeexplore.ieee.org/document/7778603],<br /> : [https://hal.archives-ouvertes.fr/hal-01574155 https://hal.archives-ouvertes.fr/hal-01574155],<br /> : [https://dblp.uni-trier.de/db/conf/nca/nca2016.html#GuedrezDLT16 https://dblp.uni-trier.de/db/conf/nca/nca2016.html#GuedrezDLT16],<br /> : [http://ieeexplore.ieee.org/document/7778603 http://ieeexplore.ieee.org/document/7778603],<br /> : [https://doi.org/10.1109/NCA.2016.7778603 https://doi.org/10.1109/NCA.2016.7778603],<br /> : [https://dx.doi.org/10.1109/NCA.2016.7778603 https://dx.doi.org/10.1109/NCA.2016.7778603],<br /> : [https://academic.microsoft.com/#/detail/2566381278 https://academic.microsoft.com/#/detail/2566381278]</div>

Scipediacontent