A new routing algorithm for delay-constrained dynamic multicast

T. Asaka; T. Miyoshi; Y. Tanaka

doi:10.1109/ECUMN.2000.880746

A new routing algorithm for delay-constrained dynamic multicast

T. Asaka, T. Miyoshi, Y. Tanaka

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many new multimedia applications involve dynamic multiple 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 the 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 are added to or removed from the multicast group during a steady-state simulation.

Original language	English
Title of host publication	1st European Conference on Universal Multiservice Networks, ECUMN 2000
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	231-238
Number of pages	8
ISBN (Electronic)	0780364198, 9780780364196
DOIs	https://doi.org/10.1109/ECUMN.2000.880746
Publication status	Published - 2000
Externally published	Yes
Event	1st European Conference on Universal Multiservice Networks, ECUMN 2000 - Colmar, France Duration: 2000 Oct 2 → 2000 Oct 4

Publication series

Name	1st European Conference on Universal Multiservice Networks, ECUMN 2000

Other

Other	1st European Conference on Universal Multiservice Networks, ECUMN 2000
Country/Territory	France
City	Colmar
Period	00/10/2 → 00/10/4

Keywords

algorithm
delay-constraint
dynamic
multicast
routing

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1109/ECUMN.2000.880746

Cite this

Asaka, T., Miyoshi, T., & Tanaka, Y. (2000). A new routing algorithm for delay-constrained dynamic multicast. In 1st European Conference on Universal Multiservice Networks, ECUMN 2000 (pp. 231-238). Article 880746 (1st European Conference on Universal Multiservice Networks, ECUMN 2000). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ECUMN.2000.880746

A new routing algorithm for delay-constrained dynamic multicast. / Asaka, T.; Miyoshi, T.; Tanaka, Y.
1st European Conference on Universal Multiservice Networks, ECUMN 2000. Institute of Electrical and Electronics Engineers Inc., 2000. p. 231-238 880746 (1st European Conference on Universal Multiservice Networks, ECUMN 2000).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Asaka, T, Miyoshi, T & Tanaka, Y 2000, A new routing algorithm for delay-constrained dynamic multicast. in 1st European Conference on Universal Multiservice Networks, ECUMN 2000., 880746, 1st European Conference on Universal Multiservice Networks, ECUMN 2000, Institute of Electrical and Electronics Engineers Inc., pp. 231-238, 1st European Conference on Universal Multiservice Networks, ECUMN 2000, Colmar, France, 00/10/2. https://doi.org/10.1109/ECUMN.2000.880746

@inproceedings{08ba625b62be4b2a8d1c6ad40ac58906,

title = "A new routing algorithm for delay-constrained dynamic multicast",

abstract = "Many new multimedia applications involve dynamic multiple 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 the 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 are added to or removed from the multicast group during a steady-state simulation.",

keywords = "algorithm, delay-constraint, dynamic, multicast, routing",

author = "T. Asaka and T. Miyoshi and Y. Tanaka",

note = "Publisher Copyright: {\textcopyright} 2000 IEEE.; 1st European Conference on Universal Multiservice Networks, ECUMN 2000 ; Conference date: 02-10-2000 Through 04-10-2000",

year = "2000",

doi = "10.1109/ECUMN.2000.880746",

language = "English",

series = "1st European Conference on Universal Multiservice Networks, ECUMN 2000",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "231--238",

booktitle = "1st European Conference on Universal Multiservice Networks, ECUMN 2000",

}

TY - GEN

T1 - A new routing algorithm for delay-constrained dynamic multicast

AU - Asaka, T.

AU - Miyoshi, T.

AU - Tanaka, Y.

PY - 2000

Y1 - 2000

N2 - Many new multimedia applications involve dynamic multiple 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 the 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 are added to or removed from the multicast group during a steady-state simulation.

AB - Many new multimedia applications involve dynamic multiple 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 the 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 are added to or removed from the multicast group during a steady-state simulation.

KW - algorithm

KW - delay-constraint

KW - dynamic

KW - multicast

KW - routing

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

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

U2 - 10.1109/ECUMN.2000.880746

DO - 10.1109/ECUMN.2000.880746

M3 - Conference contribution

AN - SCOPUS:84961880793

T3 - 1st European Conference on Universal Multiservice Networks, ECUMN 2000

SP - 231

EP - 238

BT - 1st European Conference on Universal Multiservice Networks, ECUMN 2000

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1st European Conference on Universal Multiservice Networks, ECUMN 2000

Y2 - 2 October 2000 through 4 October 2000

ER -

A new routing algorithm for delay-constrained dynamic multicast

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this