Paper Info
Title
Robust path design algorithms for traffic engineering with restoration in MPLS networks
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.
Year
DOI
Venue
2002
10.1109/ISCC.2002.1021784
ISCC
Keywords
Field
DocType
integer programming,linear programming,multiprotocol label switching,telecommunication control,telecommunication network routing,telecommunication traffic,ILP problem,MPLS networks,changing traffic patterns,integer linear programming,link-disjoint path set,multiprotocol label switching,off-line computation,path rerouting,residual capacity distribution,robust path design,traffic engineering,traffic restoration,traffic uncertainty model
Multiprotocol Label Switching,Computer science,Computer network,Traffic engineering,Distributed computing
Conference
ISSN
ISBN
Citations 
1530-1346
0-7695-1671-8
6
PageRank 
References 
Authors
0.49
7
2
Name
Order
Citations
PageRank
Emre Yetginer1252.51
Ezhan Karasan228641.74