Research On Cost-penalized Multi-path And Multi-constrained Routing And Its Simulation

With the development of network technology,the ever-expanding network scale and the ever-increasing demand for network quality of service(QoS)form a pair of contradictions.At the same time,the existing network running the IP protocol faces unprecedented challenges due to a series of intractable problems such as the limited network scale,the bottleneck of routing performance,and the lack of support for QoS guarantees.As a new type of network structure,the vector network not only solves the problems encountered by the current network,but also achieves extremely low cost.The multi-path routing problem is one of them.In order to take advantage of the vector network compared to the IP protocol network,this paper proposes a multi-path multi-constraint routing algorithm based on cost penalty and introduces it into the vector network.The specific work content of this paper is as follows:(1)A multi-constraint routing algorithm is proposed,the definition of the distance between paths and the cost penalty function in the network topology are proposed,and a Planar Multi-Path Multi-Constrain routing(PMPMC)algorithm is proposed.This algorithm realizes multi-path routing in a planar topology and maintains a certain distance between multiple paths.The simulation experiment verifies that this algorithm can effectively achieve load balancing in the network.(2)Combining the hierarchical characteristics of vector networks,a multi-path integration method between peer groups of vector networks is designed,and a costpenalized Hieratical Multi-Path Multi-Constrain routing(HMPMC)algorithm suitable for vector networks is proposed.This algorithm solves the independent end-to-end multipath problem and realizes the QoS guarantee of vector networks.The simulation experiment shows that the vector networks using this algorithm have larger network capacity than traditional networks under the same network scale.(3)Considering the large-scale network simulation requirements of the vector network,the network topology model and user distribution model of the large-scale network are designed,the deployment method of user traffic on the network topology is given,and a method to simulate the network capacity in a large-scale network is proposed.Using this method,the network capacity of different networks can be counted in a largescale network.In summary,this paper presents a cost-penalized multi-path multi-constraint routing algorithm suitable for planar topologies and vector network hierarchical topologies.Besides,simulations prove that the PMPMC algorithm is superior to the shortest path routing algorithm in terms of end-to-end throughput,packet loss rate,and failure recovery performance in the same network environment,and at the same time,it can achieve network load balancing.The simulations also prove that the HMPMC algorithm realizes the multi-path routing and QoS guarantee of the vector network,and at the same time,the network capacity of the vector network using the HMPMC algorithm is better than that of the traditional network using the shortest path routing in the same network scale.