Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE

Authors:
D. Cherubini;A. Fanni;A. Mereu;A. Frangioni;C. Murgia;M. G. Scutellí;P. Zuddas
Affiliations:
Tiscali International Network, loc. "Sa Illetta", Cagliari, Italy;DIEE, Universití di Cagliari, P.za d'Armi 1, Cagliari, Italy;DIEE, Universití di Cagliari, P.za d'Armi 1, Cagliari, Italy;Dipartimento di Informatica, Universití di Pisa, Largo B. Pontecorvo 3, Italy;Tiscali Italia S.p.A., loc. "Sa Illetta", Cagliari, Italy;Dipartimento di Informatica, Universití di Pisa, Largo B. Pontecorvo 3, Italy;DIT, Universití di Cagliari, P.za d'Armi 1, Cagliari, Italy
Venue:
Computers and Operations Research
Year:
2011

Citing 27
Cited 0

Multicommodity network flows: the impact of formulation on decomposition

Mathematical Programming: Series A and B
Designing least-cost nonblocking broadband networks

Journal of Algorithms
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Provisioning a virtual private network: a network design problem for multicommodity flow

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On open shortest path first related network optimisation problems

Performance Evaluation
MATE: multipath adaptive traffic engineering

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems

INFORMS Journal on Computing
Networks new economical virtual private

Communications of the ACM - E-services: a cornucopia of digital offerings ushers in the next Net-based evolution
Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Increasing Internet Capacity Using Local Search

Computational Optimization and Applications
Comparing traffic engineering objective functions

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Providing public intradomain traffic matrices to the research community

ACM SIGCOMM Computer Communication Review
Survivable IP network design with OSPF routing

Networks - Special Issue on Multicommodity Flows and Network Design
Hardness of robust network design

Networks
Routing and network design with robustness to changing or uncertain traffic demands

ACM SIGACT News
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

SIAM Journal on Discrete Mathematics
Traffic Flow Optimization in Networks with Combined OSPF/MPLS Routing

ADCOM '07 Proceedings of the 15th International Conference on Advanced Computing and Communications
The VPN conjecture is true

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterization of failures in an operational IP backbone network

IEEE/ACM Transactions on Networking (TON)
Hybrid routing in next generation IP networks

Computer Communications
Multi-commodity flow traffic engineering with hybrid MPLS/OSPF routing

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Traffic Engineering an Operational Network with the TOTEM Toolbox

IEEE Transactions on Network and Service Management
Routing bandwidth guaranteed paths with local restoration in label switched networks

IEEE Journal on Selected Areas in Communications
RATES: a server for MPLS traffic engineering

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.01

Visualization

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.