WDM网络中动态多播业务量疏导算法  

Dynamic Multicast Traffic Grooming Algorithms in WDM Mesh Networks

作　　者：王雄[1] 王晟[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信网技术教育部重点实验室,成都610054

出　　处：《电子科技大学学报》2007年第S2期1089-1091,1120,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60472008);四川省青年科技基金(05ZQ026-002)

摘　　要：研究WDM网络中动态多播业务量疏问题,提出了两种动态多播业务量疏导算法。该两种算法通过动态的扩展或重配置已有光树来连接新业务的目的节点,使新业务可以使用已有光树的剩余带宽提高网络资源利用率。通过仿真和与已有算法相比,SETG和METG算法可有效地降低网络阻塞率,更好地利用网络资源。与SETG算法相比,METG算法有更好的性能,但是算法复杂度更高。This paper studies the traffic grooming problem with dynamic multicast traffic in Wavelength Division Multiplexing(WDM)mesh network.Two grooming algorithms are proposed to support dynamic multicast traffic grooming by taking advantage of light-trees.In those algorithms,an existing light-tree can be reconfigured or extended when a route is to be established for a new request,and the residual bandwith can be used by the new request.Simulation results and comparisons with the existing algorithms show that the proposed algorithms can achieve better performace in term of network block probability.

关 键 词：业务量疏导 多播业务 光树 WDM网络 

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