Approximation algorithm for QoS routing with multiple additive constraints

Authors:
Ronghui Hou;King-Shan Lui;Ka-Cheong Leung;Fred Baker
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Cisco Research Center, San Jose, CA
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 3

Heuristic algorithms for multiconstrained quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Precomputation schemes for QoS routing

IEEE/ACM Transactions on Networking (TON)
Scalable BGP QoS Extension with Multiple Metrics

ICNS '06 Proceedings of the International conference on Networking and Services
Polynomial time approximation algorithms for multi-constrained QoS routing

IEEE/ACM Transactions on Networking (TON)
Precomputation for intra-domain QoS routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Pareto optimal based partition framework for two additive constrained path selection

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On the complexity of QoS routing

Computer Communications

A survey on multi-constrained optimal path computation: Exact and approximate algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay coerced multi constrained quality of service routing algorithm

WSEAS Transactions on Information Science and Applications
Solving the fuzzy shortest path problem using multi-criteria decision method based on vague similarity measure

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complete and many approximation algorithms have been developed. We propose a new approximation algorithm called multi-dimensional relaxation algorithm. We formally prove that our algorithm produces smaller approximation error than the existing algorithms. We further verify the performance by extensive simulations.