Traffic driven multiple constraint-optimisation for QoS routing

Authors:
Wayne S. Goodridge;William Robertson;William J. Phillips;Shyamala Sivakumar
Affiliations:
Faculty of Engineering, Department of Engineering Mathematics, Dalhousie University, Halifax, NS B3J 1Y9, Canada.;Faculty of Engineering, Department of Engineering Mathematics, Dalhousie University, Halifax, NS B3J 1Y9, Canada.;Faculty of Engineering, Department of Engineering Mathematics, Dalhousie University, Halifax, NS B3J 1Y9, Canada.;Faculty of Engineering, Department of Engineering Mathematics, Dalhousie University, Halifax, NS B3J 1Y9, Canada
Venue:
International Journal of Internet Protocol Technology
Year:
2005

Citing 11
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A randomized algorithm for finding a path subject to multiple QoS requirements

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks

Computer Networks
Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the complexity of QoS routing

Computer Communications
An overview of constraint-based path selection algorithms for QoS routing

IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm

Computer Communications
On the decomposition of value functions11Research supported in part by NSERC.

Operations Research Letters
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Performance evaluation of constraint-based path selection algorithms

IEEE Network: The Magazine of Global Internetworking

Disseminating data with time constraint based on multichannel over ubiquitous computing environments

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

The core of any QoS routing algorithm designed to solve the multi-constrained optimal path problem, is a length function that is used to find the optimal route across the network. User applications require diverse optimisation requirements but typical QoS-based algorithms have fixed length functions and do not offer a flexible optimisation framework. In this paper, we present a multiple-constraint-optimisation algorithm that adapts to user traffic optimisation needs without requiring a change to core logic or the length function. This routing paradigm searches for feasible paths satisfying multiple QoS requirements and implements a routing decision support system (RDSS) that separates the constraint path finding mechanism from the optimisation mechanism. Thereby the algorithm can optimise for any type or combination of metrics. Simulations compare the performance of the RDSS algorithm with other QoS algorithms and demonstrate the feasibility of the proposed approach in finding pareto optimal paths especially under strict constraints.