多约束多播业务量疏导机制  

Multi-Constrained Multicast Traffic Grooming Mechanism

作　　者：李泰[1] 王兴伟[1] 李福亮[1] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110819

出　　处：《计算机科学与探索》2016年第10期1398-1406,共9页Journal of Frontiers of Computer Science and Technology

基　　金：国家自然科学基金;Nos.61572123;61502092;国家杰出青年科学基金;Nos.61572123;61502092;高等学校博士学科点专项科研基金优先发展领域资助课题;No.20120042130003~~

摘　　要：为了使WDM(wavelength division multiplexing)光网络中的波长资源利用率达到最大化,提出了一种多约束多播业务量疏导机制。该机制在考虑光收发器数约束、波长转换能力约束以及分光量约束等多约束的前提下,结合多约束光树建立算法,可以有效地完成WDM光网络中多播业务量疏导的任务。对美国国家自然科学基金网NSFnet和欧洲教育科研网GEANT的拓扑进行了仿真实现。性能分析表明,该疏导机制不仅能够有效完成多播业务量疏导工作,而且与多跳疏导机制相比,具有较低的阻塞率。In order to fully utilize the wavelength resources of the WDM (wavelength division multiplexing) optical networks, this paper proposes a multi-constrained multicast traffic grooming mechanism. According to a multiconstrained multicast light- tree establishing algorithm, this mechanism provides an effective solution to multicast traffic grooming inWDM optical networks under multi-constraints, including the number of optical transceivers, wavelength conversion capability and wavelength splitting capability. This paper evaluates the proposed traffic grooming mechanism based on the topology of the National Science Foundation Network of USA (NSFnet) and Pan-European Research and Education Network (GEANT). The simulation results show that the proposed mechanism can not only accomplish multicast traffic grooming effectively, but also gain a lower blocking proportion compared with the multi-hop traffic grooming mechanism.

关 键 词：光网络 多播路由 多约束 光树 业务量疏导 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]