Localized Quality based QoS routing

Localized quality of service (QoS) routing is a viable alternative to the QoS routing algorithms that use global network state information to make routing decisions. In localized QoS routing algorithms each source maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of global the network state by using locally collected flow statistics and flow blocking probabilities. In this paper a Quality Based Routing algorithm (QBR) is proposed using average path quality to select a path from the set of candidate paths by routing traffic among them. We use different network topologies to compare the performance of our algorithm against the Credit Based Routing (CBR) algorithm under a wide range of traffic loads. Simulation results show that our algorithm outperforms CBR with the same time complexity.