Preprocessing for segment routing optimization

DOI10.1002/NET.22165MaRDI QIDQ6180032zbMATH OpenFDO

Authors Jérôme de Boeck, Bernard Fortz

Publication date 18 January 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22165

zbMATH Keywords

graph theorymixed integer linear programmingnetwork flowsnetwork optimizationrouting algorithmssegment routingtelecommunication networkstraffic engineering

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Intra-domain traffic engineering with shortest path routing protocols
• Preprocessing speed-up techniques is hard
• Intra-domain traffic engineering with shortest path routing protocols
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• Path computation for traffic engineering in MPLS networks

Cites work

• Intra-domain traffic engineering with shortest path routing protocols

Cited in

(1)

• Leveraging duality for the gamma-robust segment routing traffic engineering problem

This page was built for publication: Preprocessing for segment routing optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180032)