The Research Of Routing Algorithm Based On QoS In Computer Networks

With the fast development of real-time and multimedia applications in high-speed Internet, the high-efficient quality-of-service support is required in the communication network. But the traditional "best-effort" network mechanism can not guarantee the QoS communication. Recent research shows that the algorithm of network routing plays an important part in providing quality-of-service guarantees, so the QoS-based routing algorithm becomes one of the nuclear network problems.First, this dissertation introduces the background of the QoS-routing technology and it's present research condition; the methods that can be used to solve the problems of QoS-routing algorithm are analysed and concluded in detail; then the theory foundation is established for the network routing algorithms with QoS constraints, the traditional Dijkstra's shortest path algorithm is realized from two different aspects; and three improved methods are proposed for the Dijkstra algorithm; at last, the model and Synthetical evaluation system of QoS-Routing are established, and the improved methods of Dijkstra's shortest path algorithm for meeting the requirements are given and validated. The main works are listed as follow:(1) Analyzing the current development actuality and requirement of QoS-Routing; Discussing its network model and QoS-Routing algorithm mechanism; Respecting their ideas, detailed steps,demonstrations and relative merits, the existing QoS-Routing research methods are classified and summarized ;(2) The Dijkstra's shortest path algorithm are realized from two aspects;According to the data structure, search directions and data storage of routing information, three improved Dijkstra algorithms are given;(3) Put forward a QoS routing algorithm model and the synthetical evaluation system DQT; based on the model and the system, the improved Dijkstra algorithm is proposed regarding to bandwidth, time, ratio of loss-packet,cost, time dithering and load distributing.