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

WDM全光网中的多播路由算法研究
引用本文:邓昶,刘小晶,龚迅炜. WDM全光网中的多播路由算法研究[J]. 嘉兴学院学报, 2007, 19(3): 64-67
作者姓名:邓昶  刘小晶  龚迅炜
作者单位:嘉兴学院信息工程学院,浙江嘉兴,314001
摘    要:研究了WDM全光网中多播路由的问题,并给出一种满足时延约束的多播路由与波长分配算法,此算法是在Chlam tac[2]等人提出的波长图的基础上,将路由与波长分配统一进行,构造了时延受限低代价多播树,克服了将寻径和波长分配分步进行的弊端,具有较低的时间复杂度,避免了同类算法的较高复杂性。

关 键 词:WDM(波分复用)  多播路由  时延受限
文章编号:1008-6781(2007)03-0064-04
收稿时间:2005-12-01
修稿时间:2005-12-01

The Multicast Routing Algorithm in WDM Optical Networks
DENG Chang,LIU Xiao-jing,GONG Xun-wei. The Multicast Routing Algorithm in WDM Optical Networks[J]. Journal of Jiaxing College, 2007, 19(3): 64-67
Authors:DENG Chang  LIU Xiao-jing  GONG Xun-wei
Affiliation:School of Information Engineering, Jiaxing Universtiy, Jiaxing, Zhejiang 341001
Abstract:This article studies the question of Multicast Route in the WDM all-optical networks,and a routing and wavelength assignment in WDM all-optical networks is presented.Based on the wavelength graph that Chlamtac presents,this algorithm deals with routing and wavelength assignment as a unified process,constructs a minimal cost multicasting tree satisfying delay bound constraint.Moreover,the algorithm avoids high complexity common to most delay-constrained heuristics.
Keywords:WDM  Multicast Routing  Steiner Tree Delay Constraints
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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