Non-dominance in QoS routing: an implementational perspective

In QoS routing, the problem of finding paths subject to multiple constraints, is NP-complete. Therefore, efficient search-space reducing techniques are needed. The concept of dominance is such a technique. Contrary to the popularity of using dominance verification, the dominance implementation issues are hardly studied. This letter provides such a study.