By Topic

Robust path design algorithms for traffic engineering with restoration in MPLS networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yetginer, E. ; Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey ; Karasan, E.

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.

Published in:

Computers and Communications, 2002. Proceedings. ISCC 2002. Seventh International Symposium on

Date of Conference:

2002