Title :
Non-dominance in QoS routing: an implementational perspective
Author :
Kuipers, F.A. ; Mieghem, P. Van
Author_Institution :
Fac. of Electr. Eng., Math. & Comput. Sci., Delft Univ. of Technol., Netherlands
fDate :
3/1/2005 12:00:00 AM
Abstract :
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.
Keywords :
communication complexity; quality of service; telecommunication network routing; telecommunication traffic; NP-complete problem; QoS routing; dominance implementation; dominance verification; multiple path constraints; nondominance concept; quality of service; search-space reducing techniques; Added delay; Bandwidth; Computer science; Data structures; Loss measurement; Mathematics; Quality of service; Routing; Shortest path problem; Sorting;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2005.03015
