北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2013, Vol. 36 ›› Issue (3): 79-82,87.doi: 10.13190/jbupt.201303.81.002

• 研究报告 • 上一篇    下一篇

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

曾庆涛, 邱雪松, 郭少勇, 亓峰, 孟洛明   

  1. 北京邮电大学 网络与交换技术国家重点实验室, 北京 100876
  • 收稿日期:2012-07-15 出版日期:2013-06-30 发布日期:2013-06-30
  • 作者简介:曾庆涛(1982—), 男, 博士生, E-mail: qtzeng@bupt.edu.cn; 孟洛明(1955—), 男, 教授, 博士生导师.
  • 基金资助:

    国家高技术研究发展计划项目(2012AA050801)

Routing Algorithm for Power Communications Service Assignment

ZENG Qing-tao, QIU Xue-song, GUO Shao-yong, QI Feng, MENG Luo-ming   

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2012-07-15 Online:2013-06-30 Published:2013-06-30

摘要:

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

关键词: 电力通信网, 路由算法, 风险均衡, 业务分配

Abstract:

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.

Key words: communication networks for electric power system, routing algorithm, risk balance, service assignment

中图分类号: