Optimal routing for dynamic multipoint connection

Debasish Chakraborty*, Norio Shiratori, Goutam Chakraborty, Chotipat Pornavalai


    研究成果: Article査読

    6 被引用数 (Scopus)


    Multimedia applications are becoming increasingly important as networks arc now capable to carry continuous media traffic, such as voice and video, to the end user. Most of the multimedia applications need multicast support too. In dynamic multicasting, destination nodes can join and leave the group during the communication period. Total or partial rerouting can optimize the tree cost to some extent. But rerouting for optimization is complex as cell-ordering at ATM switches has to be preserved. Optimum Steiner tree is NP-complete and therefore the present problem too. We propose a heuristic centralized routing algorithm, which optimize the total cost of the Steiner tree over the whole session period, where information about the joining and leaving of participants are available, at the time s/he actually joins. With this algorithm, the average hop-length from source to destination has also reduced considerably. The efficiency of our algorithm and comparison with other proposed algorithms is shown by various simulation results.

    ジャーナルEuropean Transactions on Telecommunications
    出版ステータスPublished - 1999 3月

    ASJC Scopus subject areas

    • 電子工学および電気工学


    「Optimal routing for dynamic multipoint connection」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。