Algorithm Of QoS Based Network Routing

This thesis is devoted to the research of the IP network routing algorithms by the theory and method of mathematics. After giving the research background of this thesis and the developing condition of the network routing, we prove a theoretical lower bound of weighted stability number. Then we improve Dijkstra algorithm that can be used in OSPF protocol, and this algorithm could more completely describe the states of network. For QoS based network routing mechanisms are fundamental means which can provide QoS guarantees required by distributed multimedia applications, a QoS based heuristic routing algorithm is presented, and the route obtained by this algorithm could satisfy the requirements of bandwidth and delay of the users. Finally, another new QoS routing algorithm is developed, and the trade-off among the network parameters such as bandwidth, delay and hop count of a route, which yield more reasonable results, and the results of the simulated experiments show that the route obtained by this algorithm is safer and more efficient than that by the normal algorithm.