COMPARING A NOVEL QOS ROUTING ALGORITHM TO STANDARD
Date
2010-11-19T16:42:41Z
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The problem of finding QoS paths involving several
combinations of network metrics is NP-complete. This
motivates the use of heuristic approaches for finding
feasible QoS paths. Many constraint based routing
algorithms find QoSpaths by first pruning resources that
do not satish the requirements of the trafic flow and
then running a shortest path algorithm on the residual
graph. This approach results in a QoS path that biases
thefirst metric used in the search process. In addition, it
can be shown that this approach may not alwaysfind the
optimal path. Our research introduces a QoS routing
algorithm that is based on a decision support system that
is used to compute QoS paths. We demonstrate the
feasibility of this approach by comparing it to standard
pruning techniques.
Description
Table of Contents
Keywords
Pruning techniques, Qos routing, Decision support systems