本文選題：生存性　切入點(diǎn)：通路保護(hù)　出處：《鐵道學(xué)報(bào)》2017年12期

【摘要】：鐵路光傳送網(wǎng)絡(luò)是高速鐵路地面基礎(chǔ)設(shè)施的神經(jīng)中樞,其生存性設(shè)計(jì)是網(wǎng)絡(luò)正常運(yùn)營(yíng)的關(guān)鍵,而高效可靠的路由算法是生存性設(shè)計(jì)的關(guān)鍵。本文提出一種基于通路所經(jīng)鏈路總權(quán)重與總節(jié)點(diǎn)數(shù)之和最小為指標(biāo)的路由算法BTWH(Balance the Weight and Hop),可以給業(yè)務(wù)請(qǐng)求尋找鏈路分離且節(jié)點(diǎn)分離的工作通路與保護(hù)通路,并在占用較少波長(zhǎng)資源的同時(shí)做到負(fù)載均衡,以降低業(yè)務(wù)請(qǐng)求的保護(hù)倒換時(shí)間。同時(shí)在算法中加入了可調(diào)系數(shù),在尋路過程中能通過調(diào)整鏈路權(quán)重系數(shù)與節(jié)點(diǎn)總數(shù)系數(shù)來滿足不同的業(yè)務(wù)需求。仿真結(jié)果證明,在相同業(yè)務(wù)請(qǐng)求時(shí),BTWH算法比MTW(Minimum the Total Weight)算法占用的波長(zhǎng)資源少13.21%;在相同鏈路失效時(shí),BTWH算法比MTW算法需要的保護(hù)倒換時(shí)間少23.34%;在全網(wǎng)業(yè)務(wù)請(qǐng)求相同時(shí),BTWH算法的平均路由跳數(shù)小于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.
，

本文編號(hào)：1658164