Abstract

Real time multimedia applications have diverse Quality of Service (QoS) requirements. Traditional routing algorithms are not adequate to handle the QoS requirements of these applications. Therefore, designing routing algorithms that optimizes multiple QoS requirements is one of the major issues in High-Speed Networks (HSN). QoS Routing is defined as finding paths satisfying multiple QoS constraints. It is a Multi-Constrained Path (MCP) Problem which is NP-complete and cannot be solved in polynomial time. Various heuristics and approximation algorithms have been proposed to solve multi-constrained QoS routing problem. In this paper we will discuss various QoS routing issues followed by review of some important heuristic algorithms developed to solve multi-constrained QoS routing problems.

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.