A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks
Summary :
In this paper, we address the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show the efficiency of our algorithm and the impact of wavelength-continuity constraints.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.2 pp.380-383
- Publication Date
- 2004/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Switching
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
Fengqing LIU, Qingji ZENG, Xu ZHU, "A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 2, pp. 380-383, February 2004, doi: .
Abstract: In this paper, we address the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show the efficiency of our algorithm and the impact of wavelength-continuity constraints.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_2_380/_p
Copy
@ARTICLE{e87-b_2_380,
author={Fengqing LIU, Qingji ZENG, Xu ZHU, },
journal={IEICE TRANSACTIONS on Communications},
title={A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks},
year={2004},
volume={E87-B},
number={2},
pages={380-383},
abstract={In this paper, we address the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show the efficiency of our algorithm and the impact of wavelength-continuity constraints.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 380
EP - 383
AU - Fengqing LIU
AU - Qingji ZENG
AU - Xu ZHU
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2004
AB - In this paper, we address the survivable routing problem with and without wavelength-continuity constraints by proposing a new Integer Linear Programming (ILP) algorithm, which is based on a simplified necessary and sufficient condition. Numerical results are given and discussed to show the efficiency of our algorithm and the impact of wavelength-continuity constraints.
ER -
English
