基于区域扩展的绿色业务量疏导算法  

Green traffic grooming in zone-based scalable optical networks

作　　者：王汝言[1] 徐印[1] 吴大鹏[1] 彭海英[1] 

机构地区：[1]重庆邮电大学光互联网及光信息处理研究所,重庆400065

出　　处：《重庆邮电大学学报（自然科学版）》2012年第2期133-137,158,共6页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金项目(60972096);重庆市科委自然科学基金(CSTC2011BA2041);重庆邮电大学启动基金(A2009-07)资助;重庆邮电大学基金(A2011-14);重庆市教委项目(KJ110531)资助~~

摘　　要：针对全光网络中传统绿色业务量疏导算法阻塞率高的性能缺陷,提出一种全光网络中基于区域扩展的绿色业务量疏导算法。该算法基于W+5分层图模型,生成一个仅包含部分网络节点的区域性辅助图,通过灵活扩展辅助图的方式,寻找最佳路径,避免了形成过长路由。仿真结果表明,与传统绿色业务量疏导算法相比,基于区域扩展的绿色业务量疏导算法能够有效地降低业务阻塞率,并且在高负载的情况下,网络的平均功耗最低。In the view of high blocking probability of Traditional Green traffic grooming algorithm in optical networks,a Green traffic grooming in zone-based scalable optical networks is proposed and studied in this paper.On the basis of W＋5 Auxiliary Graph Model,generating an auxiliary graph which only contains parts of network nodes,it is possible to find a suitable and shorter route by flexibility to expand the auxiliary graph.Simulation results show that in comparison with the Traditional Green traffic grooming algorithm,the proposed algorithm can effectively reduce the blocking probability and achieve the lowest average power consumption when traffic load is relatively high.

关 键 词：业务量疏导 功耗 区域扩展 

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