Research On Multipath Routing Algorithms With Hierarchical And Recursive Optimization For Vector Networks

Network routing problem is one of the foremost issues of the network.What routing method is adopted has an important impact on the network.Designing an efficient and applicable routing algorithm has always been a hot research direction in the field of network communication.For small scale networks,there are mature routing schemes,such as OSPF and RIP protocols.But they can't be used on large networks.The IP net uses BGP to solve the problem of inter-domain routing,but the IP net has the characteristics of connectionless,shortest-path-routing and so on.Although the IP network technology is mature,but some of its own shortcomings have not been solved,such as the routing of convergence is slow,only providing a single path and so on.Industry research results show that the key to solve large-scale network routing is to use Network Layered Routing Technology.The network routing system which combines the characteristics of the new network vector network(VN)can provide new reasonable and efficient solutions to these problems.Network routing includes the representation method of network topology,the acquisition of network topology and route selection.Combining with VN technology,using Use the idea of hierarchy and recursion to reduce the size of routing hierarchical routing algorithm is the main content of this paper.Specific work mainly includes the following aspects:(1)A hierarchical recursive representation of topological structure based on vector network is proposed.The planar physical network topology can be represented as a hierarchical network architecture,the aggregation of links and nodes can simplify the network topology representation and provide a basis for the design of routing algorithm.(2)According to the characteristics of vector networks,the path format of VN,routing algorithm in peer group,a method of scoring and sorting paths,judgment method of coincidence degree between multiple paths and the method of reducing the overlap between multiple paths are proposed.Based on the above work,a hierarchical routing algorithm using hierarchical recursive optimization is proposed,this method reduces the computational complexity of large-scale network routing and theoretically reduces the computational complexity from N2 to N*logN,and it can significantly improve the routing efficiency.This method can not only find the best path between two nodes in a network topology,but also find several alternative paths which are relatively independent of the best path,so as to improve the reliability of the network.(3)The above topology representation method and routing algorithm are programmed and implemented through the platform of PyCharm and Python 3.6,and the experimental scheme is designed and the algorithm is simulated,which proves the feasibility of the algorithm.The experimental results show that the algorithm can be effectively applied to different sizes of network routing.Routing algorithm has a direct impact on the overall performance of the network.The heuristic optimization multipath routing algorithm proposed in this paper is applied to a new network architecture,namely vector network.The network is extensible because of the layered routing architecture,and it can also support large-scale networks,and reduce the computational complexity of routing.