Efficient routing to minimize the cost for dynamic multicasting

Debasish Chakraborty, Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    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.

    Original languageEnglish
    Title of host publicationIEEE Asia-Pacific Conference on Circuits and Systems - Proceedings
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Pages463-466
    Number of pages4
    ISBN (Print)0780351460
    Publication statusPublished - 1998
    EventProceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) - Chiangmai, Thailand
    Duration: 1998 Nov 241998 Nov 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

    Fingerprint

    Multicasting
    Routing algorithms
    Heuristic algorithms
    Joining
    Costs
    Communication

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Chakraborty, D., Pornavalai, C., Chakraborty, G., & Shiratori, N. (1998). Efficient routing to minimize the cost for dynamic multicasting. In IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings (pp. 463-466). Piscataway, NJ, United States: IEEE.

    Efficient routing to minimize the cost for dynamic multicasting. / Chakraborty, Debasish; Pornavalai, Chotipat; Chakraborty, Goutam; Shiratori, Norio.

    IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States : IEEE, 1998. p. 463-466.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Chakraborty, D, Pornavalai, C, Chakraborty, G & Shiratori, N 1998, Efficient routing to minimize the cost for dynamic multicasting. in IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. IEEE, Piscataway, NJ, United States, pp. 463-466, Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98), Chiangmai, Thailand, 98/11/24.
    Chakraborty D, Pornavalai C, Chakraborty G, Shiratori N. Efficient routing to minimize the cost for dynamic multicasting. In IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States: IEEE. 1998. p. 463-466
    Chakraborty, Debasish ; Pornavalai, Chotipat ; Chakraborty, Goutam ; Shiratori, Norio. / Efficient routing to minimize the cost for dynamic multicasting. IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States : IEEE, 1998. pp. 463-466
    @inbook{72678114800e40f1b8f93b7a63b1abf9,
    title = "Efficient routing to minimize the cost for dynamic multicasting",
    abstract = "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.",
    author = "Debasish Chakraborty and Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",
    year = "1998",
    language = "English",
    isbn = "0780351460",
    pages = "463--466",
    booktitle = "IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings",
    publisher = "IEEE",

    }

    TY - CHAP

    T1 - Efficient routing to minimize the cost for dynamic multicasting

    AU - Chakraborty, Debasish

    AU - Pornavalai, Chotipat

    AU - Chakraborty, Goutam

    AU - Shiratori, Norio

    PY - 1998

    Y1 - 1998

    N2 - 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.

    AB - 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.

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

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

    M3 - Chapter

    SN - 0780351460

    SP - 463

    EP - 466

    BT - IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -