Research And Implementation Of Improved Route Algorithm Based On TCP/IP

With the development and application of computer network technology,The load with existing network makes the network transmission ability greatly challenged.How to improve the transmission performance of the network,validity,real-time and efficiency of the information in the network transmission has been paid more and more attention by researchers and network products service providers.According to the characteristics of the practical application,a lot of oriented information transmission routine algorithms are proposed.By using the shortest path routing algorithm and technology,Reduce the number of data packet forwarding and control packet number,reduce network overhead,shorten packet transmission delay,to meet the practical application requirements.The shortest path algorithm has been the main subject of algebra,information science,computer science,control science and other principles.Especially the algebra theory,the matrix theory,graph theory,topology theory and other disciplines to provide the basic theory.Common shortest path algorithms include:algorithms of Dijkstra and Bellman_Ford,fast shortest path algorithm,heuristic algorithm,double-ended queue identification algorithm,intelligent algorithm.In practical applications,It is generally possible to improve the network transmission capability by optimizing the network topology and designing the best routing strategy.Because it is more difficult and more expensive to change the topology of a known network,the research based on the best routing strategy in complex networks will undoubtedly have great theoretical and practical value.At present,the research on Bellman_Ford and Dijkstra algorithm in China has made many achievements in the improvement of its algorithm and model simulation.As for many successful cases,most people do not understand the network routing process due to the restrictions on copyright and patents in practical applications.It can be seen that it is particularly important to promote thepopularization and improvement of computer network routing technology in the form of open-source code when the theoretical research and practical application of the algorithm are closely integrated.Base on the above viewpoints,with the analysis of the principles and technologies of network routine protocol,first of all,using the graph theory,topology theory and Boolean algebra theory,we prove some properties of Bellman_Ford and Dijkstra algorithm,at the same time,To design and develop routine algorithms functions library with C programming in Sun Solaris System for TCP/IP network,the routine library not only achieves the dynamic routine function required by in TCP / IP network,but also has the ability of translating and expanding efficiently in different network system platform.At the same time,it also provides a deliberate attempt to communicate for effective routine of isomorphic and heterogeneous network connected.