Heuristic algorithms for multiconstrained quality-of-service routing

Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristics, the limited granularity heuristic and the limited path heuristic, are investigated. Both heuristics extend the Bellman

• Type: Journal
• Year: 2002
• Where: TON
• Authors: Xin Yuan
• Keywords: Heuristic, Independent Qos Constraints, QoS Constraints, TON 2002