Network Based On Qos Constraints Routing Algorithm

With the fast development of real-time and multimedia applications in high-speed Internet, the high-efficient quality-of-service (QoS) support is required in the communication network. But the traditional "best-effect" network mechanism can not guarantee the QoS communication. The research on these years 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 conditions. Then the theory foundation is established for the network routing algorithms with QoS constraints. Two simple, effective and practical QoS unicast routing algorithms are proposed separately to solve two kind of classical unicast routing problems with NP-Complete difficulty. A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem. Minimum hop Multi-Constrained path algorithm (MHMCA) is proposed to solve multi-constraint path selection problem. A great deal of simulation results show the feasibility and validity of these two algorithms .Based on the design principle of routing 'simulator platform, a general, simple, and open QoS routing simulator (QRSIM) is developed which provides a real and exact simulator platform for evaluating performance of proposed QoS routing algorithms.