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

    ASJC Scopus subject areas

    • Software

    Fingerprint Dive into the research topics of 'A dynamic multicast routing satisfying multiple QoS constraints'. Together they form a unique fingerprint.

  • Cite this