An Adaptive Routing Algorithm With QoS Guarantees For Real-time Network

With the development of the real-time applications in Internet, the QoS (Quality of Service) routing algorithms in IP network have become an important issue. As one of the QoS routing algorithms, ant colony algorithm has gained increasing attention recently for its excellent properties and easy implementation. This thesis reviewed the existing adaptive routing algorithms and proposed a multiple QoS constrained routing algorithm based on delay information in order to avoid network congestion and to utilize network resources effectively.The main contents of this thesis are as follows:1. This thesis reviews the principles, development and the present state of routing protocol, adaptive routing and multiple QoS routing algorithms, and briefly discusses the future trend in QoS routing algorithms.2. After analyzing a common used ant colony routing algorithm, this thesis proposed a new fast adaptive routing algorithm to overcome the drawbacks of the ant-based algorithm. The new algorithm uses network delay information directly to choose path by probability. Its application will minimize the delay for an end-to-end data transmission and optimize the distribution of network resources to avoid network congestion.3. The multiple QoS adaptive routing algorithm has been proposed. It can refresh the router table by the previous delay information to find a suitable path with the constraints of the bandwidth and the delay-jitter. Simulation results show that the algorithm improves the utilization of the network resource and avoids the network congestion obviously.4. To construct our experimental network, this thesis discusses the techniques to build a network and gives a practical example.