A dynamic multicast routing satisfying multiple QoS constraints

Debasish Chakraborty, Goutam Chakraborty, Norio Shiratori

    Research output: Contribution to journalArticle

    20 Citations (Scopus)

    Abstract

    In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.

    Original languageEnglish
    Pages (from-to)321-335
    Number of pages15
    JournalInternational Journal of Network Management
    Volume13
    Issue number5
    DOIs
    Publication statusPublished - 2003 Sep

    Fingerprint

    Quality of service
    Multicasting
    Routing algorithms
    Costs

    ASJC Scopus subject areas

    • Software

    Cite this

    A dynamic multicast routing satisfying multiple QoS constraints. / Chakraborty, Debasish; Chakraborty, Goutam; Shiratori, Norio.

    In: International Journal of Network Management, Vol. 13, No. 5, 09.2003, p. 321-335.

    Research output: Contribution to journalArticle

    Chakraborty, Debasish ; Chakraborty, Goutam ; Shiratori, Norio. / A dynamic multicast routing satisfying multiple QoS constraints. In: International Journal of Network Management. 2003 ; Vol. 13, No. 5. pp. 321-335.
    @article{14e24eb845cf4ec784dd24d5f167a887,
    title = "A dynamic multicast routing satisfying multiple QoS constraints",
    abstract = "In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.",
    author = "Debasish Chakraborty and Goutam Chakraborty and Norio Shiratori",
    year = "2003",
    month = "9",
    doi = "10.1002/nem.485",
    language = "English",
    volume = "13",
    pages = "321--335",
    journal = "International Journal of Network Management",
    issn = "1055-7148",
    publisher = "John Wiley and Sons Ltd",
    number = "5",

    }

    TY - JOUR

    T1 - A dynamic multicast routing satisfying multiple QoS constraints

    AU - Chakraborty, Debasish

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 2003/9

    Y1 - 2003/9

    N2 - In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.

    AB - In this paper we propose a QoS-based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman-Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re-routing and satisfying QoS constraints. With user defined life-time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS.

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

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

    U2 - 10.1002/nem.485

    DO - 10.1002/nem.485

    M3 - Article

    AN - SCOPUS:0141993543

    VL - 13

    SP - 321

    EP - 335

    JO - International Journal of Network Management

    JF - International Journal of Network Management

    SN - 1055-7148

    IS - 5

    ER -