WDM全光网中的多播路由算法研究  

The Multicast Routing Algorithm in WDM Optical Networks

作　　者：邓昶[1] 刘小晶[1] 龚迅炜[1] 

机构地区：[1]嘉兴学院信息工程学院,浙江嘉兴314001

出　　处：《嘉兴学院学报》2007年第3期64-67,共4页Journal of Jiaxing University

摘　　要：研究了WDM全光网中多播路由的问题,并给出一种满足时延约束的多播路由与波长分配算法,此算法是在Chlam tac[2]等人提出的波长图的基础上,将路由与波长分配统一进行,构造了时延受限低代价多播树,克服了将寻径和波长分配分步进行的弊端,具有较低的时间复杂度,避免了同类算法的较高复杂性。This article studies the question of Muhicast 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 muhicasting tree satisfying delay bound constraint. Moreover, the algorithm avoids high complexity common to most delay - constrained heuristics.

关 键 词：WDM(波分复用) 多播路由 时延受限 

分 类 号：TN929.11[电子电信—通信与信息系统]