Paper Info
Title
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE
Abstract
This paper concerns the problem of minimizing the maximum link utilization of IP telecommunication networks under the joint use of traditional IGP routing protocols, such as IS-IS and OSPF, and the more sophisticated MPLS-TE technology. It is shown that the problem of choosing the optimal routing, both under working conditions and under single link failure scenarios, can be cast as a linear program of reasonable size. The proposed model is validated by a computational experimentation performed on synthetic and real networks: the obtained results show that the new approach considerably reduces the maximum link utilization of the network with respect to simply optimizing the IGP weights, at the cost of adding a limited number of label switched paths (LSPs). Optimizing the set of IGP weights within the overall approach further improves performances. The computational time needed to solve the models matches well with real-time requirements, and makes it possible to consider network design problems.
Year
DOI
Venue
2011
10.1016/j.cor.2011.02.019
Computers & OR
Keywords
DocType
Volume
linear programming model,traffic engineering,network design problem,LP models,computational time,combined IS-IS,IP telecommunication network,computational experimentation,Robustness,maximum link utilization,single link failure scenario,new approach,survivable network,traditional IGP routing protocol,IGP weight,Routing problems,optimal routing
Journal
38
Issue
ISSN
Citations 
12
Computers and Operations Research
4
PageRank 
References 
Authors
0.41
33
7
Name
Order
Citations
PageRank
Davide Cherubini1132.25
alessandra fanni2186.10
A. Mereu340.41
A. Frangioni41107.54
C. Murgia551.16
M. G. Scutellí680.82
P. Zuddas740.41