Algorithm for the Shortest Route on Multi-Constrained QoS Routing

QoSR (quality-of-service routing) is used to find a feasible route to satisfy multi-constrained problem, which is a NP complexity of QoSR. The multiple weights are converted to a single metric with linear and non-linear weight functions, a hierarchical approximate algorithm for shortest route on multi-constrained problem is given.