Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)1829-1838
Number of pages10
JournalIEICE Transactions on Communications
VolumeE86-B
Issue number6
Publication statusPublished - 2003 Jun

Fingerprint

Dynamic routing algorithms
Costs

Keywords

  • Dynamic routing
  • Heterogeneous network
  • Layered stream
  • Multicast

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

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

In: IEICE Transactions on Communications, Vol. E86-B, No. 6, 06.2003, p. 1829-1838.

Research output: Contribution to journalArticle

Miyoshi, Takumi ; Asaka, Takuya ; Tanaka, Yoshiaki. / Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams. In: IEICE Transactions on Communications. 2003 ; Vol. E86-B, No. 6. pp. 1829-1838.
@article{0588d17dfe1e46929efa58394ca9f992,
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

VL - E86-B

SP - 1829

EP - 1838

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 6

ER -