Robust path design algorithms for traffic engineering with restoration in MPLS networks
Author
Yetginer, Emre
Karasan, Ezhan
Date
2002-07Source Title
IEEE International Symposium on Computers and Communications
Publisher
IEEE
Pages
933 - 938
Language
English
Type
Conference PaperItem Usage Stats
66
views
views
48
downloads
downloads
Metadata
Show full item recordAbstract
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. © 2002 IEEE.
Keywords
Integer linear programmingLink-disjoint paths
Multiprotocol label switching networks
Off-line computation
Residual capacity
Restoration paths
Traffic engineering
Traffic uncertainties
Highway engineering
Integer programming
Restoration