期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Design of Survivable Routing with and without Wavelength-continuity Constraints in WDM Networks
1
作者 刘逢清 Zeng +6 位作者 Qingji ZHU Xu YANG Xudong Xiao Shilin 《High Technology Letters》 EI CAS 2004年第4期1-5,共5页
The problem of routing logical links (lightpaths) on a physical topology of WDM networks in a way that the logical topology remains connected in the event of single physical link failure is called survivable routing. ... The problem of routing logical links (lightpaths) on a physical topology of WDM networks in a way that the logical topology remains connected in the event of single physical link failure is called survivable routing. This paper addresses 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 that survivable routing solutions of most logical topologies can be found by the algorithm of the authors. Furthermore, comparing with other similar methods, the above algorithm can find out a survivable solution in much shorter time, and it works especially well with sparse-connected logical topologies. The impact of wavelength-continuity constraints and the other factors that influence the probability to find out a survivable solution are also discussed in the paper. 展开更多
关键词 WDM网络 ILP算法 物理拓扑 逻辑拓扑 rwa通信 波分多路转换技术
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部