An efficient routing algorithm for improving the QoS in Internet

Abstract

QoS Routing Algorithm is a routing algorithm for finding the shortest path that satisfies the QoS requirements of the end users. While finding the shortest path this uses some of improved ideas for effectively finding the shortest path with required QoS measures. Exactly the QoS routing algorithm is a kind of multi constrained routing algorithm where more than one link components are taken into considerations. The path, which is considered as shortest path in this situation, is the one that has minimal value in all case of the components. As a multi constrained algorithm it may suffer to NP complete problem in which the solution space increases exponentially when the problem parameter increases. To make an ideal solution for these kinds of problems this algorithm has some improvements. The first preventive measure is defining a non — linear path length for the shortest path. Then for reducing the polynomial time of the solution driving procedure the problem space is reduced by the introduction of k — shortest path where the queue size is varied at different nodes based on the resource availability and the node requirements. We can also reduce the queue capacity by deleting the non — dominated paths. To increase the speed of algorithm look ahead concept is also bound so that instead of finding the next path to next node a wider range of prior decision is taking place about the path to destination. In this paper, we have concerns only on the state space reduction or also called as multi constrained relaxation in which the queue size is reduced by eliminating the dominated paths from the queue where they are not capable of being the sub path for the shortest path. After that some sorts of modules, where the dominated paths are identified and removed from the queue, analyze the queue. At the last the modified queue is returned to the caller for further usage of the queue. While modifying the queue modules takes one parameter that is a threshold value. When the link components are compared this value is used as reference where if the difference between the link components exceeds then it is considered that it is not further required and marked for removal. The difference is calculated by comparing the link components.