A Multi Constrained Path Quality of Service Routing Algorithm

Providing Quality-of-Service (QoS) in packet switched networks has many challenging problems. One of the m is how to determine a feasible path that satisfies additive multiple constraints. A difficulty of multi constrained path problem is that it is intractable. In this context Multi Constraint path Problem version 3 (MCPv3) is presented where all constraints are approximated and return a feasible path in much quicker time. This problem is modeled by using a graph with K additive QoS constraints associated with each edge for any constant K≥2.MCpv3 is an approximation algorithm that finds a path between a given source and destination pair such that the path weight is not more than (1+α)W where α is approximation factor and W is constraint bound. By properly selecting α and constraint bounds MCPv3 performs well in terms of better quality of paths, less running time and improved scalability irrespective of nature of constraints. A variety of experimental validations are carried out on different scenario to analyze the performance of the proposed schemes.