Routing with multiple QoS requirements for supporting multimedia applications

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    研究成果: Article

    14 引用 (Scopus)

    抄録

    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 NP-complete. In this paper, we propose a new heuristic QoS routing algorithm, called "QoSRDKS", for supporting multimedia applications in high-speed networks. QoSRDKS is a modification of rule-based 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(|V|2), 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.

    元の言語English
    ページ(範囲)357-373
    ページ数17
    ジャーナルTelecommunication Systems
    9
    発行部数3-4
    出版物ステータスPublished - 1998

    Fingerprint

    Quality of service
    HIgh speed networks
    Routing algorithms
    Jitter
    Bandwidth

    ASJC Scopus subject areas

    • Computer Networks and Communications

    これを引用

    Pornavalai, C., Chakraborty, G., & Shiratori, N. (1998). Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems, 9(3-4), 357-373.

    Routing with multiple QoS requirements for supporting multimedia applications. / Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    :: Telecommunication Systems, 巻 9, 番号 3-4, 1998, p. 357-373.

    研究成果: Article

    Pornavalai, C, Chakraborty, G & Shiratori, N 1998, 'Routing with multiple QoS requirements for supporting multimedia applications', Telecommunication Systems, 巻. 9, 番号 3-4, pp. 357-373.
    Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / Routing with multiple QoS requirements for supporting multimedia applications. :: Telecommunication Systems. 1998 ; 巻 9, 番号 3-4. pp. 357-373.
    @article{1270aab039af45ee8a865c5ad7c960a4,
    title = "Routing with multiple QoS requirements for supporting multimedia applications",
    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 NP-complete. In this paper, we propose a new heuristic QoS routing algorithm, called {"}QoSRDKS{"}, for supporting multimedia applications in high-speed networks. QoSRDKS is a modification of rule-based 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(|V|2), 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.",
    author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1998",
    language = "English",
    volume = "9",
    pages = "357--373",
    journal = "Telecommunication Systems",
    issn = "1018-4864",
    publisher = "Springer Netherlands",
    number = "3-4",

    }

    TY - JOUR

    T1 - Routing with multiple QoS requirements for supporting multimedia applications

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1998

    Y1 - 1998

    N2 - 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 NP-complete. In this paper, we propose a new heuristic QoS routing algorithm, called "QoSRDKS", for supporting multimedia applications in high-speed networks. QoSRDKS is a modification of rule-based 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(|V|2), 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.

    AB - 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 NP-complete. In this paper, we propose a new heuristic QoS routing algorithm, called "QoSRDKS", for supporting multimedia applications in high-speed networks. QoSRDKS is a modification of rule-based 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(|V|2), 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.

    UR - http://www.scopus.com/inward/record.url?scp=22444456096&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=22444456096&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:22444456096

    VL - 9

    SP - 357

    EP - 373

    JO - Telecommunication Systems

    JF - Telecommunication Systems

    SN - 1018-4864

    IS - 3-4

    ER -