Abstract
A fundamental problem in QoS (quality-of-service) routing is the multi-constrained path (MCP) problem. The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP. For solving MCP problem was offered a lot of methods. One of these methods is based on Lagrangian Relaxation. These algorithms allow finding the shortest paths from the source to the receiving based on metrics with the minimum cost among all possible paths. This new algorithm is a complex mathematical realization, but has the most accurate calculations.
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 callDisclaimer: 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.
