QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture.
We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity
of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to QoS routing in general.
The second part of this paper discusses how routing with multiple independent constraints affects the hopcount distribution.
Both the complexity as the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features
similar to single-parameter routing.