Abstract

Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the important problems studied in the field of QoS routing. Various solutions have been proposed for RSP and other problems related to the QoS routing, in practical situations. Restricted shortest path problem with concave route costs are studied in this paper. This is a special version of the traditional RSP problem and is widely applicable in wireless and mobile ad hoc networks. In this paper, we propose new algorithms for this kind of routing. The effectiveness of our proposed solutions is shown through analytical reasoning and simulations.

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 call

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.