In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restoration paths where path rerouting is used as the restoration scheme. We first compute maximum number of paths for each demand such that paths satisfy diversity requirements. Using the generated path set we study four different approaches for selecting working and restoration paths, and formulate each method as an Integer Linear Programming (ILP) problem. The first two methods treat working and restoration path design problems separately. We propose two new path design methods that jointly optimize the working and restoration paths. A traffic uncertainty model is developed in order to evaluate performances of these four approaches based on their robustness with respect to changing traffic patterns. We compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. It is shown through simulations that the weighted load balancing method proposed in this paper outperforms the other three methods in handling traffic demand uncertainty.

Original document

The different versions of the original document can be found in:

Back to Top

Document information

Published on 01/01/2002

Volume 2002, 2002
DOI: 10.1109/iscc.2002.1021784
Licence: CC BY-NC-SA license

Document Score


Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?