光组播路由代价与波长使用量的联合优化方法  

Joint optimizing the multicast routing cost and wavelength consumption for optical multicast

作　　者：刘焕淋[1] 刘洋[1] 胡晓慧[1] 李祯[1] 

机构地区：[1]重庆邮电大学通信与信息工程学院重庆市高校光纤通信技术重点实验室,重庆400065

出　　处：《光电子．激光》2013年第7期1298-1303,共6页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金(61275077,61071117);重庆市教委自然科学基金(KJ110527)资助项目

摘　　要：为解决光组播路由中组播中路由代价和波长资源消耗单一化造成的组播路树路由的代价过高问题,在分光节点约束条件下,提出了光组播路由代价与波长使用量联合优化的长路优先(LPF)方法和短路优先(SPF)方法。算法通过检查最小光组播树是否存在节点分光约束的问题,根据设置的波长使用代价控制因子,使LPF或SPF的路由代价和波长使用量最小。LPF方法首先选择组播树最长路径或新波长通道重路由受分光约束的目的节点,SPF方法先选择组播树中最短路径或新波长通道重路由受分光约束的目的节点,仿真结果表明,本文提出的两种联合优化方法都能实现路由代价较低和波长需求较少的目的。For resolving the high cost problem of multicast routing tree with just optimization the multi- cast routing cost or just optimization the wavelength number consumption, the longest path first （LPF） method and shortest path first （SPF） method based on the node light splitting constraint are respectively proposed to resolve the problem of joint optimizing multicast routing cost and wavelength consumption number in this paper. By checking whether the node on the minimal cost multicast tree violates the light splitting constraint, according to the wavelength tradeoff cost control factor, the longest path or shortest path on the tree is selected first to realize the lowest multicast rauting cost and wavelength consumption. The longest path or new wavelength channel is selected to re-route the light splitting constraint node in the LPF algorithm with low total cost. However, the SPF algorithm selects the shortest path on the tree or new wavelength channel to re-route the light splitting constraint node. The simulation results show that the proposed two algorithms can achieve the low routing cost and require a few wavelengths simul- taneously for optical multicast routing.

关 键 词：光组播网络 组播路由 波长代价联合优化(JOWC) 长路优先(LPF) 短路优先 (SPF) 组播树代价 

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