Label algorithm for delay-constrained dynamic multicast routing

Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Many new multimedia applications involve multiple dynamically changing participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows `two coming paths,' where nodes in a multicast tree transmit several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of `two coming paths,' and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes were added to or removed from the multicast group during a steady-state simulation.

Original languageEnglish
Pages (from-to)55-62
Number of pages8
JournalIEICE Transactions on Communications
VolumeE84-B
Issue number1
Publication statusPublished - 2001 Jan
Externally publishedYes

Fingerprint

Labels
Routing algorithms
Quality of service
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Label algorithm for delay-constrained dynamic multicast routing. / Asaka, Takuya; Miyoshi, Takumi; Tanaka, Yoshiaki.

In: IEICE Transactions on Communications, Vol. E84-B, No. 1, 01.2001, p. 55-62.

Research output: Contribution to journalArticle

Asaka, Takuya ; Miyoshi, Takumi ; Tanaka, Yoshiaki. / Label algorithm for delay-constrained dynamic multicast routing. In: IEICE Transactions on Communications. 2001 ; Vol. E84-B, No. 1. pp. 55-62.
@article{8d66965fb1884410a0792dbae16eff13,
title = "Label algorithm for delay-constrained dynamic multicast routing",
abstract = "Many new multimedia applications involve multiple dynamically changing participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows `two coming paths,' where nodes in a multicast tree transmit several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of `two coming paths,' and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes were added to or removed from the multicast group during a steady-state simulation.",
author = "Takuya Asaka and Takumi Miyoshi and Yoshiaki Tanaka",
year = "2001",
month = "1",
language = "English",
volume = "E84-B",
pages = "55--62",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - Label algorithm for delay-constrained dynamic multicast routing

AU - Asaka, Takuya

AU - Miyoshi, Takumi

AU - Tanaka, Yoshiaki

PY - 2001/1

Y1 - 2001/1

N2 - Many new multimedia applications involve multiple dynamically changing participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows `two coming paths,' where nodes in a multicast tree transmit several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of `two coming paths,' and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes were added to or removed from the multicast group during a steady-state simulation.

AB - Many new multimedia applications involve multiple dynamically changing participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows `two coming paths,' where nodes in a multicast tree transmit several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of `two coming paths,' and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes were added to or removed from the multicast group during a steady-state simulation.

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

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

M3 - Article

VL - E84-B

SP - 55

EP - 62

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 1

ER -