The Research Of Multi-path Routing Optimization Technology

Currently, Internet routing protocol is single path routing, data transmits along a single path, this will bring large routing overhead and the network delay, and also will cost congestion easily. Multi-path routing is a protocol that finds paths through a certain constraint rules, and transmits data through multi paths. Multi-path routing has better performance over single path routing, now is a research focus. Presently, there are a variety of multi-path routing protocols proposed brought out to meet the security, load balancing improvement requirement. But it lacks a multi-path protocol to meet the reliability and scalability needs in large-scale network.This paper analyzes a variety of multi-path routing protocols, which has a special detail analysis on source routing and intermediate routing. We point out the advantages and disadvantages of source routing and intermediate routing, and then give a new multi-path routing which combines the advantages of source routing and intermediate routing. And we point out that the new multi-path routing performance depends on the intermediate nodes set. This paper bases on two applications scenario: known network topology and unknown network topology to put forward some algorithms those set the intermediate nodes property.In the case of known network topology scenario, we propose traversal and integrated scoring intermediate routing nodes setting algorithm. The traversal algorithms have three algorithms, which are simple traversal algorithm, traversal algorithm that import simulated annealing and improve traversal algorithm. The improve traversal algorithm translates the combinatorial optimization problem into single nodes solution, this can effectively improve the solve efficiency. Integrated scoring algorithm is based on the mind of information searching, give a model that can score nodes. The simulation results show integrated scoring algorithm has good performance.In the case of unknown network topology scenario, we propose a distributed detect intermediate nodes algorithm which we mark as MRABTN. We discover the existing of topologically-critical nodes which we call TN, give a simple, effective, distributed method to detect the TN and avoid them, then find the most valuable intermediate nodes. Simulation results show that MRABTN has good performance.At last, we conclude the paper and point out the future improvement direction.