A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks
Summary :
This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.8 pp.2455-2462
- Publication Date
- 2003/08/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
Eiji OKI, Nobuaki MATSUURA, Kohei SHIOMOTO, Naoaki YAMANAKA, "A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 8, pp. 2455-2462, August 2003, doi: .
Abstract: This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_8_2455/_p
Copy
@ARTICLE{e86-b_8_2455,
author={Eiji OKI, Nobuaki MATSUURA, Kohei SHIOMOTO, Naoaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks},
year={2003},
volume={E86-B},
number={8},
pages={2455-2462},
abstract={This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - A Disjoint Path Selection Scheme with Shared Risk Link Group Constraints in GMPLS Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2455
EP - 2462
AU - Eiji OKI
AU - Nobuaki MATSUURA
AU - Kohei SHIOMOTO
AU - Naoaki YAMANAKA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2003
AB - This paper proposes a disjoint path selection scheme for Generalized Multi-Protocol Label Switching (GMPLS) networks with Shared Risk Link Group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the total number of SRLG members related to a link as part of the link cost when the k-shortest path algorithm is executed. In WSRLG, a link that has many SRLG members is rarely selected as the shortest path. Simulation results show that WSRLG finds more disjoint paths than the conventional k-shortest path algorithm. In addition, since WSRLG searches for the weight of the SRLG factor by using a modified binary search algorithm while satisfying the required number of disjoint paths between source and destination nodes, it can find cost-effective disjoint paths.
ER -
English
