Multi-constraint QoS routing using a new single mixed metrics

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of network and computer applications 2008-11, Vol.31 (4), p.656-676
Main Authors: Khadivi, P., Samavi, S., Todd, T.D.
Format: Article
Language:English
Subjects:
Applied sciences
Computer networks
Exact sciences and technology
Interconnected networks
Multi-constraint routing
Networks and services in france and abroad
Operation, maintenance, reliability
QoS routing
Quality of service
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Transmission and modulation (techniques and equipments)
Valuation and optimization of characteristics. Simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1084-8045
1095-8592
DOI:10.1016/j.jnca.2007.11.004