Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks

Authors:
Emre Yetginer;Ezhan Karasan
Affiliations:
-;-
Venue:
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Year:
2002

Citing 0
Cited 2

Maximizing restorable throughput in MPLS networks

IEEE/ACM Transactions on Networking (TON)
Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study traffic engineering of restorable paths in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of working and restoration paths with path rerouting as the restoration scheme. First we compute a link-disjoint path set for given set of demands. Using this path set we study four approaches for selecting working and restoration paths, and formulate each method as an Integer Linear Programming (ILP) problem. A traffic uncertainty model is developed in order to compare these approaches based on their robustness with respect to changing traffic patterns. We obtain numerical results and compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network.