Multiconstrained QoS Routing: A Norm Approach

A fundamental problem in quality-of-service (QoS) routing is the multiconstrained path (MCP) problem, where one seeks a source-destination path satisfying K \ge 2 additive QoS constraints in a network with K additive QoS parameters. The MCP problem is known to be NP-complete. One popular approach is...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. 56; no. 6; pp. 859 - 863
Main Authors:	Xue, Guoliang, Kami Makki, S.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Additives Algorithms Approximation Approximation algorithms Computers Criteria Heuristic algorithms Mathematical analysis multiple additive QoS parameters Optimization QoS routing Quality of service Routing Routing (telecommunications) scaled p{\hbox{-}}\rm norm Shortest-path problems Studies Weighting functions
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!