【作者】 吴建华； 李霞； 张凯；

【Author】 Wu Jianhua Li Xia Zhang Kai (Information Science and Engineering Institute, Northeastern University, Shenyang 110004, China)

【机构】 东北大学 信息科学与工程学院；

【摘要】 本文将火星探测中寻路技术所使用的D*算法用于解决智能光网络(ASON)中动态路由及波长分配(RWA)问题。针对ASON中控制平面灵活性的要求,提出了将各链路基本代价和波长使用情况组成的链路代价函数作为D*算法的估价函数,实现了ASON光网络中动态业务的高效分配,提高了网络生存性。仿真结果表明,该算法在降低网络阻塞率上优于OSPF路由协议中使用的Dijkstra+First Fit算法。更多还原

【Abstract】 A heuristic algorithm based on D~* principle is used for solving dynamic Routing and Wavelength Assignment (RWA) problem in ASON networks.In order to adapt the requirement of the optical control plan,D~* algorithm with a novel evaluation function is proposed,which is composed by the basic cost of link and the use of wavelength.The simulation results show that this algorithm is better than the Dijkstra+First Fit algorithm in the area of assignment efficiency.It can effectively reduce the blocking probabilities,and promote the rational assignment of the wavelength resource.更多还原