Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    研究成果: Article

    1 引用 (Scopus)

    抄録

    This paper proposes a new dynamic multicast routing algorithm for layered streams. Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost, and that it works well on large-scale networks and those with traffic heterogeneity and a small number of routine control messages.

    元の言語English
    ページ(範囲)1829-1838
    ページ数10
    ジャーナルIEICE Transactions on Communications
    E86-B
    発行部数6
    出版物ステータスPublished - 2003 6

    Fingerprint

    Dynamic routing algorithms
    Costs

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications

    これを引用

    Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams. / Miyoshi, Takumi; Asaka, Takuya; Tanaka, Yoshiaki.

    :: IEICE Transactions on Communications, 巻 E86-B, 番号 6, 06.2003, p. 1829-1838.

    研究成果: Article

    @article{f28f0b5f986f4264a538241ab456f927,
    title = "Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams",
    abstract = "This paper proposes a new dynamic multicast routing algorithm for layered streams. Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost, and that it works well on large-scale networks and those with traffic heterogeneity and a small number of routine control messages.",
    keywords = "Dynamic routing, Heterogeneous network, Layered stream, Multicast",
    author = "Takumi Miyoshi and Takuya Asaka and Yoshiaki Tanaka",
    year = "2003",
    month = "6",
    language = "English",
    volume = "E86-B",
    pages = "1829--1838",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "6",

    }

    TY - JOUR

    T1 - Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

    AU - Miyoshi, Takumi

    AU - Asaka, Takuya

    AU - Tanaka, Yoshiaki

    PY - 2003/6

    Y1 - 2003/6

    N2 - This paper proposes a new dynamic multicast routing algorithm for layered streams. Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost, and that it works well on large-scale networks and those with traffic heterogeneity and a small number of routine control messages.

    AB - This paper proposes a new dynamic multicast routing algorithm for layered streams. Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost, and that it works well on large-scale networks and those with traffic heterogeneity and a small number of routine control messages.

    KW - Dynamic routing

    KW - Heterogeneous network

    KW - Layered stream

    KW - Multicast

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

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

    M3 - Article

    AN - SCOPUS:0141938421

    VL - E86-B

    SP - 1829

    EP - 1838

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 6

    ER -