On the performance of heuristic H/spl I.bar/MCOP for multi-constrained optimal-path QoS routing

Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multipath-constrained (MCP) or multiconstrained optimal-path (MCOP) quality of service (QoS) routing problems, which are NP-complete. Heuristic algorithm H/spl I.bar/MCOP proposed by Korkmaz et al. has been widely recognized for its low time complexity and high probability of finding feasible solutions. The performance of this heuristic is reinvestigated under several special cases. Simulation results indicate that in some cases its probability of finding feasible solutions is unexpectedly low. Such observation, which is further used to explain the performance of a heuristic based on H-MCOP, is of extreme importance when designing any higher-level QoS routing algorithms that need to use H/spl I.bar/MCOP to find feasible solutions.