Efficient routing to minimize the cost for dynamic multicasting

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

*この研究の対応する著者

    研究成果: Chapter

    抄録

    Multicast has become increasingly important as networks are used to carry continuous media traffic such as voice and video to the end user. In dynamic multicasting, destination nodes are joining and leaving the group during the communication period. A re-routing may produce an optimal route, but it is impractical for various reasons. A better routing could be possible, without re-routing, if the users behavior can be predicted. With the increasing popularity of advance resource reservation, it is possible to estimate the users' duration of staying time. And thus a better routing that can efficiently minimize the total cost of whole session is feasible. We propose a centralized heuristic routing algorithm, which optimize the total cost of the Steiner tree over the whole session period. The efficiency of our proposed algorithm over Greedy and Naive algorithm is shown by simulation results.

    本文言語English
    ホスト出版物のタイトルIEEE Asia-Pacific Conference on Circuits and Systems - Proceedings
    Place of PublicationPiscataway, NJ, United States
    出版社IEEE
    ページ463-466
    ページ数4
    ISBN(印刷版)0780351460
    出版ステータスPublished - 1998
    イベントProceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) - Chiangmai, Thailand
    継続期間: 1998 11月 241998 11月 27

    Other

    OtherProceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98)
    CityChiangmai, Thailand
    Period98/11/2498/11/27

    ASJC Scopus subject areas

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

    フィンガープリント

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

    引用スタイル