首页> 中文期刊> 《铁道学报》 >均衡节点与权重的铁路光传送网路由优化算法

均衡节点与权重的铁路光传送网路由优化算法

         

摘要

Railway optical transmission network is the nerve center of high-speed railway ground facilities ,and its survivability design is the key to the normal operation of the network .In addition ,an efficient and reliable routing algorithm is the basic guarantee of survivability .In this paper ,a routing algorithm balance the weight and hop(BTWH) which minimizes the sum of the total weight of the links and the total number of the nodes is proposed to find the link-disjoint and the node-disjoint working path and protection path .BTWH occupies less wavelength resources while balancing the loads ,and reduce the protection switching time of the service request when a link failure occurs .Moreover ,BTWH can also meet different service requirements by adjusting the co-efficients of the link weights and the total number of nodes .The simulation results show that the amount of wavelength resources occupied by BTWH is 13 .21% less than the MTW algorithm when processing the same service request ;the protection switching time of BTWH algorithm is 23 .34% less than MTW algorithm when the same link fails ;the average number of hops of the BTWH algorithm is less than the MTW algorithm when the whole network service requests are the same .%铁路光传送网络是高速铁路地面基础设施的神经中枢,其生存性设计是网络正常运营的关键,而高效可靠的路由算法是生存性设计的关键.本文提出一种基于通路所经链路总权重与总节点数之和最小为指标的路由算法BTWH(Balance the Weight and Hop),可以给业务请求寻找链路分离且节点分离的工作通路与保护通路,并在占用较少波长资源的同时做到负载均衡,以降低业务请求的保护倒换时间.同时在算法中加入了可调系数,在寻路过程中能通过调整链路权重系数与节点总数系数来满足不同的业务需求.仿真结果证明,在相同业务请求时,BTWH算法比MTW(Minimum the Total Weight)算法占用的波长资源少13.21%;在相同链路失效时,BTWH算法比MTW算法需要的保护倒换时间少23.34%;在全网业务请求相同时,BTWH算法的平均路由跳数小于MTW算法.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号