Algorithm of QoS Based Network Routing
|Keywords||IP network Routing Weight stable for several Quality of service Improved Dijkstra Algorithm Routing Algorithm|
This paper USES mathematics theory and method to study the IP network routing algorithm. First of all, this paper studies the background and general situation of network routing, and proves that the number of stable weight a theoretical lower bound. Secondly, based on the Dijkstra algorithm used in the OSPF, and puts forward the improved Dijkstra algorithm, which makes the routers and communication on the link cost all can count, with more comprehensive depict network state. Then, in view of the network based on QoS routing mechanism is to provide distributed multimedia applications QoS guarantee foundation, this paper proposes a heuristic based on QoS routing algorithm, which is helpful to make selected routing can simultaneously satisfy the user's bandwidth and delay needs. Finally, this paper puts forward a comprehensive considering the bandwidth, delay, site number and other network parameters, based on QoS, use evaluation function method of routing algorithm, through the simulation experiments, proved and common algorithms, the algorithm to select the routing security is higher, and save network resources.