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 issue...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 9; no. 3; pp. 267 - 269
Main Authors:	Kuipers, F.A., Van Mieghem, P.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01-03-2005 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Added delay Applied sciences Bandwidth Computer science Data structures Dominance Exact sciences and technology Loss measurement Mathematics Operation, maintenance, reliability Quality of service Routing Shortest path problem Sorting Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) NP complete problem Routing Service quality Implementation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2005.03015