电力通信业务路由分配算法

Routing Algorithm for Power Communications Service Assignment

针对电力通信网中重要通信业务集中于少数几条路径,提出了业务风险均衡K-shortest path算法.建立了电力通信节点、通道段风险度模型,并在此基础上提出了业务通道风险均衡度评价模型;采用改进的Dijkstra算法搜索K-shortest path作为候选路径,并基于最大最小模型进行风险均衡路由决策;通过仿真实验评价了业务风险均衡K-shortest path算法与已有算法的性能差异,验证了新算法的有效性.

An new routing algorithm has been proposed for the problem about important power communication service concentrated in a few paths,which based on service risk equalization degree.First,two risk degree models of communication nodes and channel segments have been built,and an equilibrium risk degree model was proposed based on those tow models.Second,the improved Dijkstra algorithm was used to search for K-shortest paths as candidates,and maximum and minimum model was employed for routing decision.Finally,the performance of risk balanced K-shortest path（RBKSP） is compared with two existing algorithms.Simulation verifies the effectiveness of the RBKSP algorithm.