Multi-constraint QoS routing using a new single mixed metrics

Authors:
P. Khadivi;S. Samavi;T. D. Todd
Affiliations:
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran;Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada L8S 4K1
Venue:
Journal of Network and Computer Applications
Year:
2008

Citing 4
Cited 3

Internet QoS: Architectures and Mechanisms for Quality of Service

Internet QoS: Architectures and Mechanisms for Quality of Service
A Multi-Constrained Distributed QoS Routing Algorithm

ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Search Space Reduction in QoS Routing

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Delay coerced multi constrained quality of service routing algorithm

WSEAS Transactions on Information Science and Applications
A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

The Journal of Supercomputing
A new high performance approach: merging optimal multicast sessions for supporting multisource routing

The Journal of Supercomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multi-constraint quality-of-service (QoS) routing has become increasingly important as the Internet evolves to support real-time services. It is well known, however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the most popular. Although mixed metric routing discards potentially useful information, this is compensated for by significant complexity reduction. Exploiting this tradeoff is becoming increasingly important where low complexity designs are desired, such as in battery operated wireless applications. In this paper, novel single mixed metrics for multi-constraint routing are introduced. The proposed techniques have similar complexity compared with existing low complexity methods. Simulation and analytical results are presented which show that it can obtain better performance than comparable techniques in terms of generating feasible routes.