一种用于光网络的高效业务疏导辅助图及动态业务疏导算法  

A high-efficiency auxiliary graph model and dynamic traffic grooming algorithm in optical network

作　　者：杨帆[1] 徐展琦[1] 王正平[1] 邱智亮[1] 许奇钦 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《光电子．激光》2012年第3期479-488,共10页Journal of Optoelectronics·Laser

基　　金：国家"863"计划(2009AA01ZZ254);陕西省自然科学基金(2011JM8037);中央高校基本科研业务费专项(K50510010025);高等学校创新引智计划(B08038);综合业务网国家重点实验室基金(ISN1104003)资助项目

摘　　要：利用辅助图,研究了光网络中的业务疏导技术。为解决传统的辅助图存在着模型复杂、波长通道的带宽利用率不高等问题,提出一种新的业务疏导辅助图,能够更有效地利用已有波长通道,避免低效的路由;为了降低动态业务疏导算法的复杂度,提出了一种简化的k最短路径算法,并以此为基础提出了多种疏导策略。仿真结果表明,本文提出的辅助图及其业务疏导算法,可以有效地减少阻塞率。The traffic grooming in optical network is studied in this paper. Using auxiliary graph, the traffic grooming problem can be solved as a routing problem. Traditional auxiliary graph is complex and the bandwidth utilization of light path is not high. So a new auxiliary graph is proposed in this paper. The new auxiliary graph can use the light path more efficiently and can avoid inefficient routing. In order to decrease the complexity of the dynamic traffic grooming algorithm, a simplified k shortest path routing algorithm is proposed. A series of traffic grooming schemes are put forward based on the simplified k shortest path routing algorithm. The simulation results show that the new auxiliary graph and its grooming algorithm can reduce the Mocking probability effectively.

关 键 词：光网络 动态业务疏导 辅助图 阻塞率 

分 类 号：TN915[电子电信—通信与信息系统]