Routing with multiple QoS requirements for supporting multimedia applications |
| |
Authors: | Pornavalai Chotipat Chakraborty Goutam Shiratori Norio |
| |
Affiliation: | (1) Research Institute of Electrical Communication, Tohoku University, 211 Katahira, Aobaku, Sendai, 98077, Japan E-mail:;(2) Faculty of Software and Information Science, Iwate Prefectural University, Takizawamura, Azasugo 15252, 0200173, Japan E-mail: |
| |
Abstract: | Distributed multimedia applications usually require multiple QoS performance guarantees. However, in general, searching such a route in the network, to support multimedia applications, is known to be NPcomplete. In this paper, we propose a new heuristic QoS routing algorithm, called QoSRDKS, for supporting multimedia applications in highspeed networks. QoSRDKS is a modification of rulebased Fallback routing and Dijkstra algorithms. It can search a unicast route that would have enough network resources so that multiple QoS requirements (bandwidth, delay, and delay jitter) of the requested flow could be guaranteed. Its worst case computation time complexity is the same as that of the Dijkstra algorithm, i.e., O(V2), where V is the number of nodes in the network. Extensive simulations were done with various network sizes, upto 500 nodes networks, where each node uses Weighted Fair Queueing (WFQ) service discipline. Results show that QoSRDKS is very efficient. It could always find the QoS satisfying route, whenever there exists one (success rate is optimal), and its average computation time is near to simple shortest path Dijkstra algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|