The Research And Simulation Of The Multipath Transimision Algorithm In Vector Network

With the dramatic growth in the network traffic, the way of the traditional IP network transmission is not able to meet the communication requirements. In order to solve the problems in the IP network, the network of next generation has been proposed. Combined with the technology of the current and the next generation network, the vector network puts forward a number of new techniques and methods, which can not only change the approach to transmit packets but achieve a separation of the transmission and control planes and provide the guaranteed QoS service and multipath transmission mechanism. The vector network, thanks to its multipath transmission characteristic, offers a new way to solve the dramatic increase in the traffic.The multipath transmission mechanism is enjoying increasing popularity, for it can balance the load, shorten the transmission delay, improve the utility of the bandwidth and enhance the fault tolerance and reliability. The multipath routing algorithms are the basis to implement the multipath transmission. In this thesis, according to the fractal characteristics of the vector network and integrated with the path similarity objective and the heuristic method, a new multi-path routing algorithm based on the A*algorithm, called MA*algorithm, is proposed. The algorithm mainly deals with the determination of the coordinates of nodes, the calculation of node cost, the similarity of paths and the penalty value of overlap links. Combined with the above factors, a new evaluation function construction method is devised for the MA*algorithm, which is proved feasible through theoretical analysis. By using the network topology generation tool and VC++, the simulation experiments are carried out to compare the MA*algorithm with other multipath routing algorithms. The results show that the MA*algorithm can acquire multiple paths with reasonable path cost and similarity within less search. In addition, the balance between path cost and path similarity can be achieved through reasonable adjustment of the penalty parameter. In conclusion, the MA*algorithm provides a new way to achieve the multipath transmission in the vector network at a lower cost, which, as a more common multi-path routing algorithm, can be applied to the wider multipath transmission environment.