Research On Routing Strategies And Routing Algorithms For Power Communication Networks

The services in the power communication system have unique transmission requirements which will make the routing algorithms for the public communication network not suitable for the power system. The power communication routing algorithms can be divided into single path routing algorithm and double paths routing algorithm. The single path routing algorithms seldom take the foctor of Qo S(Qo S, quality of service) and the factor of risk balance into consideration at the same time.The researches of routing algorithm for power communication network seldom pay attention to the double routing algorithm. In view of the above, this reserch subject can make up the insufficiency of the existing routing algorithms. As a result, the management level of power communication network will be improved.A large number of researches for power communication network have been studied, and the routing strategies are proposed. Based on the domestic and foreign researches, the problem of power communication routing strategies have been studied. For the single routing problem, the muti-constraint risk balancing strategy is proposed to guarantee the services' Qo S and a relatively low risk balancing degree. Three types of double routing algorithms for the public communication network are discussed. Considering the diversity of the network topology, the maximally disjoint routing algorithm is adopted. To guarantee the double routes' reliability, the most reliable maximally disjoint routing strategy is proposed. To solve the problem of muti-constraint double routing problem, the muti-constraint maximally disjoint routing strategy is proposed.To solve the problem of the services routing for power communication network, the routing algorithms under the studied strategies are proposed. The routing algorithm RABOMS is proposed to meet the muti-constraint risk balancing strategy. To find a pair of relatively reliable maximally disjoint routes in the network, MRMLS is put to use. The MMDRA is adopted to satisfy the muti-constraint maximally disjoint routing strategy. The three algorithms are achieved through C language. The experiment results show the feasibility and validity of the three proposed routing algorithms.