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
As tecnologias multimídia emergentes introduzem a transmissão multicast predominante, e a árvore multicast é determinada usando parâmetros de rede invariantes no tempo. Este artigo aborda o problema da árvore multicast variável no tempo e apresenta heurísticas de seleção de caminho para roteamento multicast para determinar um caminho alternativo para aplicações em tempo real. Uma rede é particionada na região ideal, na região disjunta e no edge cutset se um ramo da árvore multicast atender à condição de QoS não garantida. A heurística de seleção de caminho opera durante a fase da sessão multicast para selecionar eficientemente um caminho de roteamento alternativo contendo uma aresta no conjunto de arestas para conectar a árvore multicast novamente. A heurística baseada na origem PS-SPT encontra o caminho para um atraso mínimo da origem até o destino e a heurística baseada em compartilhamento PS-DDMC para um custo total mínimo. Essas heurísticas de seleção de caminho podem fornecer soluções eficientes para manter a transmissão multicast confiável. Os resultados da simulação também mostram que as heurísticas propostas podem fornecer boas soluções eficazes para transmissão multicast em tempo real. O PS-SPT pode selecionar um caminho com atraso ideal da origem ao destino e o PS-DDMC pode selecionar um caminho com custo total ideal.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -