An Improved QoS Routing Algorithm in Internet

摘要

An efficient routing algorithm for Improving the QoS in Internet has been proposed and presented in this paper. The algorithm is a kind of multi constrained path algorithm. The routing takesplace based on more than one link weight components. To avoid the NP complete problem and to increase the computational efficiency some advancements are added. These include the definition of nonlinear path length, where the subpaths may not be the shortest path, having 'k' number of shortest paths in a node instead of having only the shortest path, and then removing the path dominancy for state space reduction. Finally, the concept of look ahead is also included through which a predicted path to destination is mapped. This work only implements the removal of path dominancy where the queue is updated by removing the dominated paths from the queue. The simulation also shows the better performance of the system.