COMPARING A NOVEL QOS ROUTING ALGORITHM TO STANDARD

Show simple item record

dc.contributor.author Sivakumar, Shyamala
dc.contributor.author Phillips, Bill
dc.contributor.author Robertson, William
dc.contributor.author Goodridge S., Wayne
dc.date.accessioned 2010-11-19T16:42:41Z
dc.date.available 2010-11-19T16:42:41Z
dc.date.issued 2010-11-19T16:42:41Z
dc.identifier.uri http://hdl.handle.net/2139/8506
dc.description.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. en
dc.language.iso en en
dc.subject Pruning techniques en
dc.subject Qos routing en
dc.subject Decision support systems en
dc.title COMPARING A NOVEL QOS ROUTING ALGORITHM TO STANDARD en
dc.type Other en


Files in this item

Files Size Format View
Icon Qos_routing_alg.pdf 228.3Kb PDF Thumbnail

This item appears in the following Collection(s)

Show simple item record

Search UWISpace


Advanced Search

Browse

My Account