Approximation algorithms for multiconstrained quality-of-service routing

We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become /spl epsi/-approximation algorithms when their parameters are appropriately set. The performance of our new heuristics is compared exper...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 55; no. 5; pp. 603 - 617
Main Authors Meongchul Song, Sahni, S.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Additives
Algorithms
Approximation
approximation algorithm
Communication system routing
Graph theory
Heuristic
interval partitioning
Mathematical analysis
Quality of service routing
Online AccessGet full text
ISSN0018-9340
1557-9956
DOI10.1109/TC.2006.67

Cover

More Information
Summary:We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become /spl epsi/-approximation algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2006.67