Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.5 pp.1632-1640
- Publication Date
- 2003/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ezhan KARASAN, Emre YETGINER, "Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 5, pp. 1632-1640, May 2003, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_5_1632/_p
Copy
@ARTICLE{e86-b_5_1632,
author={Ezhan KARASAN, Emre YETGINER, },
journal={IEICE TRANSACTIONS on Communications},
title={Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks},
year={2003},
volume={E86-B},
number={5},
pages={1632-1640},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1632
EP - 1640
AU - Ezhan KARASAN
AU - Emre YETGINER
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2003
AB - 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.
ER -
English
