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

发布时间：2018-03-24 11:46

  本文选题：生存性　切入点：通路保护　出处：《铁道学报》2017年12期

【摘要】：铁路光传送网络是高速铁路地面基础设施的神经中枢,其生存性设计是网络正常运营的关键,而高效可靠的路由算法是生存性设计的关键。本文提出一种基于通路所经链路总权重与总节点数之和最小为指标的路由算法BTWH(Balance the Weight and Hop),可以给业务请求寻找链路分离且节点分离的工作通路与保护通路,并在占用较少波长资源的同时做到负载均衡,以降低业务请求的保护倒换时间。同时在算法中加入了可调系数,在寻路过程中能通过调整链路权重系数与节点总数系数来满足不同的业务需求。仿真结果证明,在相同业务请求时,BTWH算法比MTW(Minimum the Total Weight)算法占用的波长资源少13.21%;在相同链路失效时,BTWH算法比MTW算法需要的保护倒换时间少23.34%;在全网业务请求相同时,BTWH算法的平均路由跳数小于MTW算法。
[Abstract]:The railway optical transport network is the nerve center of the high-speed railway ground infrastructure, and its survivability design is the key to the normal operation of the network. An efficient and reliable routing algorithm is the key of survivability design. This paper presents a routing algorithm BTWH(Balance the Weight and hopping, which is based on the minimum sum of the total weight and the total number of nodes. It can find links for traffic requests. Separate and separate working paths and protection paths, At the same time, load balancing is achieved in order to reduce the protection switching time of traffic request. At the same time, the adjustable coefficient is added to the algorithm. The link weight coefficient and the total node number coefficient can be adjusted to meet different traffic requirements during the route finding process. The simulation results show that, The wavelength resource of the MTW(Minimum the Total weight algorithm is 13.21 less than that of the MTW(Minimum the Total weight algorithm at the same traffic request; the protection switching time of the MTW algorithm is 23.34 less than that of the MTW algorithm in the same link failure; and the average path of the BTWH algorithm is lower than that of the MTW algorithm when the network traffic request is the same. The number of hops is smaller than the MTW algorithm.
，

本文编号：1658164