ROUTING WITH MULTIPLE QOS REQUIREMENTS FOR SUPPORTING MULTIMEDIA APPLICATIONS

Distributed multimedia applications usually require multiple QoS perfo rmance guarantees. However, in general, searching such a route in the network, to support multimedia applications, is known to be NP-complet e. in this paper, we propose a new heuristic QoS routing algorithm, ca lled ''QoSR(DKS)'', for supporting multimedia applications in high-spe ed networks. QoSR(DKS) is a modification of rule-based Fallback routin g and Dijkstra algorithms. It can search a unicast route that would ha ve enough network resources so that multiple QoS requirements (bandwid th, delay, and delay jitter) of the requested flow could be guaranteed . Its worst case computation time complexity is the same as that of th e Dijkstra algorithm, i.e., O(\V\(2)), where \V\ is the number of node s in the network. Extensive simulations were done with various network sizes, upto 500 nodes networks, where each node uses Weighted Fair Qu eueing (WFQ) service discipline. Results show that QoSR(DKS) is very e fficient. It could always find the QoS satisfying route, whenever ther e exists one (success rate is optimal), and its average computation ti me is near to simple shortest path Dijkstra algorithm.