基于业务安全性的电力通信网双路由配置方法研究

ON SERVICE SECURITY-BASED DUAL-ROUTE ALLOCATION ALGORITHM FOR POWER COMMUNICATION NETWORKS

针对现有电力通信业务路由配置方法集中于单路由算法无法从根本上保证信息安全传输的问题,提出基于业务安全性的最佳双路由算法ODR(Optimal Double Route),为每一条业务配置两条安全性最高的节点分离路径。首先,综合考虑站点和光缆的安全性,以及电力通信网的特殊性,构建通信网业务的双路由问题模型。其次,根据该问题模型改进Bhandari算法实现节点分离路径对的搜索。最后,通过实例测试业务配置结果,与最简单双路由算法RF(Remove-Find)相比,ORD算法的业务容量提高了9.07%,业务路径安全性高出20.4%,对于实际工程中的业务部署和网络规划具有一定的指导价值。

Existing routing allocation algorithm for power communication services focuses on single route, and cannot fundamentally guarantee secure information transmission. Aiming at this problem, we proposed a service security-based optimal dual-route （ODR） algorithm to allocate two node-disjoint paths with highest security for each service. First, we built the dual-route problem model of communication network services by comprehensively considering the security of station and optic cable and the particularity of power communication networks. Secondly, we improved Bhandari algorithm according to the problem model to implement the search of node-disjoint path pair. Finally, we tested the service allocation results by example. The ORD algorithm increased the service capacity by 9.07% and improved the service path security by 20.4% compared with the simplest duel-route algorithm Remove-Find. It can play a guiding role for service allocation and network planning in practical engineering.