A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks

Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

    Original languageEnglish
    Pages (from-to)1493-1501
    Number of pages9
    JournalIEICE Transactions on Communications
    VolumeE80-B
    Issue number10
    Publication statusPublished - 1997

    Fingerprint

    HIgh speed networks
    Routing algorithms
    Quality of service
    Communication
    Jitter
    Telecommunication networks
    Computational complexity
    Bandwidth
    Costs

    Keywords

    • Distributed multimedia applications
    • Distributed routing algorithm
    • Guaranteed QoS service
    • High-speed networks
    • Real-time communication
    • Resource reservation

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications

    Cite this

    A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks. / Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    In: IEICE Transactions on Communications, Vol. E80-B, No. 10, 1997, p. 1493-1501.

    Research output: Contribution to journalArticle

    Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks. In: IEICE Transactions on Communications. 1997 ; Vol. E80-B, No. 10. pp. 1493-1501.
    @article{31bce7e0b6df4fbebadc003f35abd891,
    title = "A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks",
    abstract = "Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called {"}DQoSR,{"} for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4{\%}).",
    keywords = "Distributed multimedia applications, Distributed routing algorithm, Guaranteed QoS service, High-speed networks, Real-time communication, Resource reservation",
    author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1997",
    language = "English",
    volume = "E80-B",
    pages = "1493--1501",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "10",

    }

    TY - JOUR

    T1 - A new distributed QoS routing algorithm for supporting real-time communication in high-speed networks

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1997

    Y1 - 1997

    N2 - Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

    AB - Distributed multimedia applications are often sensitive to the Quality of Service (QoS) provided by the communication network. They usually require guaranteed QoS service, so that real-time communication is possible. However, searching a route with multiple QoS constraints is known to be a NP-complete problem. In this paper, we propose a new simple and efficient distributed QoS routing algorithm, called "DQoSR," for supporting real-time communication in high-speed networks. It searches a route that could guarantee bandwidth, delay, and delay jitter requirements. Routing decision is based only on the modified cost, hop and delay vectors stored in the routing table at each node and its directly connected neighbors. Moreover, DQoSR is proved to construct loop-free routes. Its worst case message complexity is O(|V|2), where |V| is the number of nodes in the network. Thus DQoSR is fast and scales well to large networks. Finally, extensive simulations show that average rate of establishing successful connection of DQoSR is very near to optimum (the difference is less than 0.4%).

    KW - Distributed multimedia applications

    KW - Distributed routing algorithm

    KW - Guaranteed QoS service

    KW - High-speed networks

    KW - Real-time communication

    KW - Resource reservation

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

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

    M3 - Article

    AN - SCOPUS:0031249455

    VL - E80-B

    SP - 1493

    EP - 1501

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 10

    ER -