TY - JOUR
T1 - Traffic engineering in segment routing networks
AU - Moreno, Eduardo
AU - Beghelli, Alejandra
AU - Cugini, Filippo
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/2/26
Y1 - 2017/2/26
N2 - Segment routing (SR) has been recently proposed as an alternative traffic engineering (TE) technology enabling relevant simplifications in control plane operations. In the literature, preliminary investigations on SR have focused on label encoding algorithms and experimental assessments, without carefully addressing some key aspects of SR in terms of the overall network TE performance. In this study, ILP models and heuristics are proposed and successfully utilized to assess the TE performance of SR-based packet networks. Results show that the default SR behavior of exploiting equal cost multiple paths (ECMP) may lead to several drawbacks, including higher network resource utilization with respect to cases where ECMP is avoided. Moreover, results show that, by properly performing segment list computations, it is possible to achieve very effective TE solutions by just using a very limited number of stacked labels, thus successfully exploiting the benefits of the SR technology.
AB - Segment routing (SR) has been recently proposed as an alternative traffic engineering (TE) technology enabling relevant simplifications in control plane operations. In the literature, preliminary investigations on SR have focused on label encoding algorithms and experimental assessments, without carefully addressing some key aspects of SR in terms of the overall network TE performance. In this study, ILP models and heuristics are proposed and successfully utilized to assess the TE performance of SR-based packet networks. Results show that the default SR behavior of exploiting equal cost multiple paths (ECMP) may lead to several drawbacks, including higher network resource utilization with respect to cases where ECMP is avoided. Moreover, results show that, by properly performing segment list computations, it is possible to achieve very effective TE solutions by just using a very limited number of stacked labels, thus successfully exploiting the benefits of the SR technology.
KW - Heuristic
KW - Integer Linear Programming
KW - Segment routing
UR - http://www.scopus.com/inward/record.url?scp=85010021747&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2017.01.006
DO - 10.1016/j.comnet.2017.01.006
M3 - Article
AN - SCOPUS:85010021747
SN - 1389-1286
VL - 114
SP - 23
EP - 31
JO - Computer Networks
JF - Computer Networks
ER -