首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种求解虚波长路径光网络波长资源优化问题的启发式算法
引用本文:张杰,顾畹仪.一种求解虚波长路径光网络波长资源优化问题的启发式算法[J].光子学报,1997,26(10):915-918.
作者姓名:张杰  顾畹仪
作者单位:北京邮电大学电信工程学院!北京,100088,北京邮电大学电信工程学院!北京,100088,北京邮电大学电信工程学院!北京,100088,北京邮电大学电信工程学院!北京,100088
摘    要:本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的.

关 键 词:波分复用  虚波长路径(VWP)  启发式算法
收稿时间:1997-02-03

HEURISTIC ALGORITHM FOR MINIMIZING THE NUMBER OF WAVELENGTHS IN VWP OPTICAL NETWORKS
Zhang Jie,Gu Wanyi,Li Guorui,Xu Daxiong.HEURISTIC ALGORITHM FOR MINIMIZING THE NUMBER OF WAVELENGTHS IN VWP OPTICAL NETWORKS[J].Acta Photonica Sinica,1997,26(10):915-918.
Authors:Zhang Jie  Gu Wanyi  Li Guorui  Xu Daxiong
Institution:College of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100088
Abstract:This paper proposes a path accommodation design algorithm applicable to virtual wavelength path networks that heuristically minimize the number of wavelengths required by the realization of optical paths. A new optimal routing strategy based on the maximum probability paths is introduced in the algorithm. At last, the numerical results of a sample network show the effect of the algorithm.
Keywords:Wavelength division multiplexing  Virtual wavelength path  Heuristic algorithm  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《光子学报》浏览原始摘要信息
点击此处可从《光子学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号