Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2013, Vol. 36 ›› Issue (3): 79-82,87.doi: 10.13190/jbupt.201303.81.002

• Reports • Previous Articles     Next Articles

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

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

CLC Number: