Multi-Constrained QoS Routing Issues in High- Speed Multimedia Networks

Abstract — High- Speed Multimedia Networks (HSMN) have diverse Quality of Service (QoS) requirements. Designing QoS routing protocols that optimizes multiple QoS requirements is one of the major issues in these networks. Traditional routing algorithms are not adequate to handle QoS requirements of real-time multimedia applications. QoS Routing is defined as finding paths satisfying multiple QoS constraints. It is a Multi-Constrained Path (MCP) Problem which is a NP-complete problem that cannot be solved in polynomial time. Various heuristics and approximation algorithms have been proposed to solve multi-constrained QoS routing problems. 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