A Routing Method for Communication Network Based on Multi-metric Parameters by Analytic Hierarchy Process

Abstract

The invention provides a multi-measurement-parameter communication network route method based on an analytic hierarchy process (AHP). According to the method, the AHP is used for twice, multiple routes with different weight are orderly established from a service source node to a service destination node according to multiple measurement parameters, wherein the first AHP comprises the steps that according to a service type of flow, a next route is selected from all adjacent nodes of any node in a network topology, and the multiple routes from the source node to the destination node are established, and the second AHP comprises the steps that still according to the service type of the flow, selection trends, according to corresponding weight, of different services to different routes are calculated and obtained, and finally the flow of different service types is scheduled to the route with the corresponding weight so that congestion control and load balance are achieved. According to the multi-measurement-parameter communication network route method based on the AHP, multiple network property measurement indexes are used for confirming the weight, the different service types are taken into account, the route with the largest weight is preferentially selected, when congestion occurs, a suboptimal route is selected, the remaining routes can be done in the same manner, the congestion of the communication network can be effectively solved, and flow balance in the whole network is achieved.

Description

technical field [0001] The invention relates to a communication network routing method based on a hierarchical analysis method with multiple measurement parameters, and belongs to the technical field of routing exchange in communication networks. Background technique [0002] Among the network routing algorithms in the prior art, according to the storage mode of network parameter information in the network, there are currently three types of routing algorithms: source routing algorithms, distributed routing algorithms and hierarchical routing algorithms. in: [0003] The source routing algorithm assumes that each node in the network understands the global state of the network, and each node maintains a global state information database. When sending a message, the source node can determine the data forwarding path. The typical protocol using the source routing algorithm is the link state protocol OSPF. The node in the OSPF protocol broadcasts the state information of the no...

AI Technical Summary

Problems solved by technology

Its disadvantages are: the performance of pathfinding coordination between nodes is reduced, and it is easy to cause loops or ignore the best path

However, after being assembled into a group, the nodes outside the group cannot fully know the status information of the nodes in the group, which will aggravate the inaccuracy of routing information

Images