The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
De nombreuses nouvelles applications multimédias impliquent plusieurs participants changeant dynamiquement, ont des exigences strictes en matière de délais de la source à la fin et consomment de grandes quantités de ressources réseau. Un algorithme classique autorisant « deux chemins venant », dans lesquels les nœuds d'un arbre de multidiffusion transmettent plusieurs flux de données identiques, n'est donc pas pratique. Nous avons développé un algorithme de routage dynamique contraint par le délai. Cet algorithme utilise une étiquette QoS pour empêcher l'apparition de « deux chemins entrants » et peut construire une arborescence de multidiffusion efficace pour n'importe quel volume de trafic. L'algorithme proposé était supérieur aux algorithmes de routage conventionnels en termes de coût lorsque des nœuds étaient ajoutés ou supprimés du groupe de multidiffusion lors d'une simulation en régime permanent.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA, "Label Algorithm for Delay-Constrained Dynamic Multicast Routing" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 1, pp. 55-62, January 2001, doi: .
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_1_55/_p
Copier
@ARTICLE{e84-b_1_55,
author={Takuya ASAKA, Takumi MIYOSHI, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Label Algorithm for Delay-Constrained Dynamic Multicast Routing},
year={2001},
volume={E84-B},
number={1},
pages={55-62},
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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copier
TY - JOUR
TI - Label Algorithm for Delay-Constrained Dynamic Multicast Routing
T2 - IEICE TRANSACTIONS on Communications
SP - 55
EP - 62
AU - Takuya ASAKA
AU - Takumi MIYOSHI
AU - Yoshiaki TANAKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2001
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.
ER -