Exploring routing with multiple Quality of Service parameters in High-Speed Networks
Monika Jena, Ajay Rana · 2012
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.