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
Teknologi multimedia yang baru muncul memperkenalkan penghantaran multicast lazim, dan pokok multicast ditentukan menggunakan parameter rangkaian invarian masa. Kertas kerja ini menangani masalah pokok multicast yang berubah-ubah masa dan membentangkan heuristik pemilihan laluan untuk penghalaan multicast untuk menentukan laluan alternatif untuk aplikasi masa nyata. Rangkaian dibahagikan kepada rantau optimum, rantau bercabang dan set potongan tepi jika cawangan pokok multicast memenuhi keadaan QoS yang tidak dijamin. Heuristik pemilihan laluan beroperasi semasa fasa sesi multicast untuk memilih laluan penghalaan alternatif dengan cekap yang mengandungi tepi dalam cutset tepi untuk menyambung semula pokok multicast. Heuristik berasaskan sumber PS-SPT mencari laluan untuk kelewatan sumber ke destinasi yang minimum dan heuristik berasaskan perkongsian PS-DDMC untuk jumlah kos minimum. Heuristik pemilihan laluan ini boleh memberikan penyelesaian dengan cekap untuk memastikan penghantaran multicast boleh dipercayai. Keputusan simulasi juga menunjukkan bahawa heuristik yang dicadangkan boleh memberikan penyelesaian yang baik yang berkesan untuk penghantaran multicast masa nyata. PS-SPT boleh memilih laluan dengan kelewatan sumber ke destinasi yang optimum dan PS-DDMC boleh memilih laluan dengan jumlah kos optimum.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -