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
Les technologies multimédias émergentes introduisent la transmission multidiffusion prédominante, et l'arbre de multidiffusion est déterminé à l'aide des paramètres de réseau invariants dans le temps. Cet article aborde le problème de l'arbre de multidiffusion variable dans le temps et présente des heuristiques de sélection de chemin pour le routage de multidiffusion afin de déterminer un chemin alternatif pour les applications en temps réel. Un réseau est divisé en région optimale, région disjointe et ensemble de coupes de périphérie si une branche de l'arborescence de multidiffusion répond à la condition de QoS non garantie. L'heuristique de sélection de chemin fonctionne pendant la phase de session de multidiffusion pour sélectionner efficacement un chemin de routage alternatif contenant une arête dans l'ensemble de coupes d'arête pour connecter à nouveau l'arbre de multidiffusion. L'heuristique basée sur la source PS-SPT trouve le chemin pour un délai source-à-destination minimal et l'heuristique basée sur le partage PS-DDMC pour un coût total minimal. Ces heuristiques de sélection de chemin peuvent fournir efficacement des solutions pour maintenir la fiabilité de la transmission multidiffusion. Les résultats de simulation montrent également que les heuristiques proposées peuvent fournir de bonnes solutions efficaces pour la transmission multidiffusion en temps réel. Le PS-SPT peut sélectionner un chemin avec un délai source-destination optimal et le PS-DDMC peut sélectionner un chemin avec un coût total optimal.
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
Wen-Yu TSENG, Sy-Yen KUO, "Real-Time Multicast Routing with Efficient Path Selection for Multimedia Applications" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 7, pp. 889-898, July 2001, doi: .
Abstract: Emerging multimedia technologies introduce the prevalent multicast transmission, and the multicast tree is determined using the time-invariant network parameters. This paper addresses the time-varying multicast tree problem and presents path selection heuristics for multicast routing to determine an alternative path for real-time applications. A network is partitioned into the optimal region, the disjoint region, and the edge cutset if a branch of the multicast tree meets the un-guaranteed QoS condition. The path selection heuristics operate during the multicast session phase to efficiently select an alternative routing path containing an edge in the edge cutset to connect the multicast tree again. The source-based heuristics PS-SPT finds the path for minimal source-to-destination delay and the sharing-based heuristics PS-DDMC for minimal total cost. These path selection heuristics can efficiently provide solutions to keep the multicast transmission reliable. Simulation results also show that the proposed heuristics can provide effective good solutions for real-time multicast transmission. PS-SPT can select a path with optimal source-to-destination delay and PS-DDMC can select a path with optimal total cost.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_7_889/_p
Copier
@ARTICLE{e84-d_7_889,
author={Wen-Yu TSENG, Sy-Yen KUO, },
journal={IEICE TRANSACTIONS on Information},
title={Real-Time Multicast Routing with Efficient Path Selection for Multimedia Applications},
year={2001},
volume={E84-D},
number={7},
pages={889-898},
abstract={Emerging multimedia technologies introduce the prevalent multicast transmission, and the multicast tree is determined using the time-invariant network parameters. This paper addresses the time-varying multicast tree problem and presents path selection heuristics for multicast routing to determine an alternative path for real-time applications. A network is partitioned into the optimal region, the disjoint region, and the edge cutset if a branch of the multicast tree meets the un-guaranteed QoS condition. The path selection heuristics operate during the multicast session phase to efficiently select an alternative routing path containing an edge in the edge cutset to connect the multicast tree again. The source-based heuristics PS-SPT finds the path for minimal source-to-destination delay and the sharing-based heuristics PS-DDMC for minimal total cost. These path selection heuristics can efficiently provide solutions to keep the multicast transmission reliable. Simulation results also show that the proposed heuristics can provide effective good solutions for real-time multicast transmission. PS-SPT can select a path with optimal source-to-destination delay and PS-DDMC can select a path with optimal total cost.},
keywords={},
doi={},
ISSN={},
month={July},}
Copier
TY - JOUR
TI - Real-Time Multicast Routing with Efficient Path Selection for Multimedia Applications
T2 - IEICE TRANSACTIONS on Information
SP - 889
EP - 898
AU - Wen-Yu TSENG
AU - Sy-Yen KUO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2001
AB - Emerging multimedia technologies introduce the prevalent multicast transmission, and the multicast tree is determined using the time-invariant network parameters. This paper addresses the time-varying multicast tree problem and presents path selection heuristics for multicast routing to determine an alternative path for real-time applications. A network is partitioned into the optimal region, the disjoint region, and the edge cutset if a branch of the multicast tree meets the un-guaranteed QoS condition. The path selection heuristics operate during the multicast session phase to efficiently select an alternative routing path containing an edge in the edge cutset to connect the multicast tree again. The source-based heuristics PS-SPT finds the path for minimal source-to-destination delay and the sharing-based heuristics PS-DDMC for minimal total cost. These path selection heuristics can efficiently provide solutions to keep the multicast transmission reliable. Simulation results also show that the proposed heuristics can provide effective good solutions for real-time multicast transmission. PS-SPT can select a path with optimal source-to-destination delay and PS-DDMC can select a path with optimal total cost.
ER -