(2010-11-19T16:42:41Z) Sivakumar, Shyamala; Phillips, Bill; Robertson, William; Goodridge S., Wayne
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.
(2010-11-03T15:11:32Z) Sahai, Ashok; Nikov, Alexander; Goodridge, Wayne
Multi criteria decision making (MCDM) methods like
analytic hierarchy process, ELECTRE and multi-attribute utility
theory are critically studied. They have irregularities in terms of the
reliability of ranking of the best alternatives. The Routing Decision
Support (RDS) algorithm is trying to improve some of their
deficiencies. This paper gives a mathematical verification that the
RDS algorithm conforms to the test criteria for an effective MCDM
method when a linear preference function is considered
