电力通信业务路由分配算法-北京邮电大学学报.PDF

2013年6月 北 京 邮 电 大 学 学 报 Jun.2013 第36卷 第3期 Journal of Beijing University of Posts and Telecommunications Vol.36 No.3 摇 摇 文章编号:1007鄄5321(2013)03鄄0079鄄0 DOI:10.13190/ jbupt.201303.81.002 电力通信业务路由分配算法 曾庆涛,摇 邱雪松,摇 郭少勇,摇 亓摇 峰,摇 孟洛明 (北京邮电大学 网络与交换技术国家重点实验室,北京 100876) 摘要:针对电力通信网中重要通信业务集中于少数几条路径,提出了业务风险均衡K鄄shortest path算法. 建立了电 力通信节点、通道段风险度模型,并在此基础上提出了业务通道风险均衡度评价模型;采用改进的Dijkstra算法搜 索K鄄shortest path作为候选路径,并基于最大最小模型进行风险均衡路由决策;通过仿真实验评价了业务风险均衡 K-shortest path算法与已有算法的性能差异,验证了新算法的有效性. 关摇 键摇 词:电力通信网;路由算法;风险均衡;业务分配 中图分类号:TP393摇 摇 摇 摇 文献标志码:A Routing Algorithm for Power Communications Service Assignment ZENG Qing鄄tao,摇 QIU Xue鄄song,摇 GUO Shao鄄yong,摇 QI Feng,摇 MENG Luo鄄ming (State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China) Abstract:An new routing algorithm hasbeen proposedfor the problem about important power communi鄄 cation serviceconcentratedin afew paths,whichbasedon serviceriskequalization degree. First,tworisk degreemodelsof communicationnodesandchannel segmentshavebeenbuilt,andanequilibriumriskde鄄 gree modelwasproposedbasedonthosetow models. Second,theimprovedDijkstraalgorithmwasusedto 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 ex鄄 isting algorithms. Simulation verifies the effectiveness of the RBKSP algorithm. Key words:communication networksfor electric power system;routing algorithm;risk balance;service assignment 摇 摇 在电力通信网中,业务为恒定数据流负荷,突发 (MM)策略选择风险均衡路由. 性拥塞不再是业务通信风险的根源,业务过度集中 1摇