Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Asian Journal of Research in Social Sciences and Humanities
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
