Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
High Speed Networks and Internets: Performance and Quality of Service
High Speed Networks and Internets: Performance and Quality of Service
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Research challenges in QoS routing
Computer Communications
Quality-of-service routing in IP networks
IEEE Transactions on Multimedia
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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.