A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks(Switching)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2004-02-01
著者
-
Zhu Xu
R&d Center For Broadband Optical Net Working Technology Shanghai Jiao Tong University
-
LIU Fengqing
R&D Center for Broadband Optical Net working Technology, Shanghai Jiao Tong University
-
ZENG Qingji
R&D Center for Broadband Optical Net working Technology, Shanghai Jiao Tong University
-
ZHU Xu
R&D Center for Broadband Optical Net working Technology, Shanghai Jiao Tong University
-
Zeng Qingji
R&d Center For Broadband Optical Net Working Technology Shanghai Jiao Tong University
-
Liu Fengqing
R&d Center For Broadband Optical Net Working Technology Shanghai Jiao Tong University
関連論文
- A Simplified Survivable Routing Method for Sparse-Connected Logical Topologies in Optical Networks(Switching)
- Restoration Based on Sub-Lightpath Rerouting against Non-concurrent Single-Failure in WDM Optical Networks(Fiber-Optic Transmission)