Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

Takumi MIYOSHI; Takuya ASAKA; Yoshiaki TANAKA

Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

Takumi MIYOSHI, Takuya ASAKA, Yoshiaki TANAKA

Full Text Views

0

Share
Cite this

Summary :

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 routing control messages.

Publication: IEICE TRANSACTIONS on Communications Vol.E86-B No.6 pp.1829-1838

Publication Date: 2003/06/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Content Delivery Networks)

Category: Traffic Control in CDNs

Cite this

Copy

Takumi MIYOSHI, Takuya ASAKA, Yoshiaki TANAKA, "Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams" in IEICE TRANSACTIONS on Communications, vol. E86-B, no. 6, pp. 1829-1838, June 2003, doi: .
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 routing control messages.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e86-b_6_1829/_p

Copy

@ARTICLE{e86-b_6_1829,
author={Takumi MIYOSHI, Takuya ASAKA, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams},
year={2003},
volume={E86-B},
number={6},
pages={1829-1838},
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 routing control messages.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams
T2 - IEICE TRANSACTIONS on Communications
SP - 1829
EP - 1838
AU - Takumi MIYOSHI
AU - Takuya ASAKA
AU - Yoshiaki TANAKA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2003
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 routing control messages.
ER -