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
Dalam kertas ini, kaedah penghalaan multicast baharu untuk aliran berlapis dicadangkan. Kaedah ini adalah lanjutan daripada algoritma tamak berwajaran (WGA) dan menggunakan dua jenis nilai berat untuk memperhalusi jarak pautan. Ia boleh mengatasi perubahan dinamik dalam ahli kumpulan tanpa pembinaan semula pokok multicast. Kaedah ini serasi dengan RSVP dan boleh digunakan dalam protokol penghalaan jenis pokok kongsi sedia ada seperti mod jarang CBT dan PIM. Sumber rangkaian boleh digunakan dengan cekap; tambahan pula, kadar kehilangan permintaan ahli untuk menerima lebih banyak lapisan boleh dikurangkan dengan kaedah penghalaan ini apabila bilangan nod yang mencukupi mempunyai fungsi penapisan paket dan bilangan hop yang mencukupi dibenarkan.
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
Nagao OGINO, "A Multicast Routing Method for Layered Streams" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 5, pp. 695-703, May 1999, doi: .
Abstract: In this paper, a new multicast routing method for layered streams is proposed. This method is an extension of the weighted greedy algorithm (WGA) and uses two kinds of weight values to refine the link distance. It can cope with dynamic change in the group members without multicast tree re-construction. The method is compatible with the RSVP and can be utilized in existing shared tree type routing protocols such as CBT and PIM sparse mode. The network resources can be utilized efficiently; furthermore, the loss rate of member's requests to receive more layers can be reduced by this routing method when a sufficient number of nodes have the packet filtering function and a sufficient number of hops is permitted.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_5_695/_p
Salinan
@ARTICLE{e82-b_5_695,
author={Nagao OGINO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Multicast Routing Method for Layered Streams},
year={1999},
volume={E82-B},
number={5},
pages={695-703},
abstract={In this paper, a new multicast routing method for layered streams is proposed. This method is an extension of the weighted greedy algorithm (WGA) and uses two kinds of weight values to refine the link distance. It can cope with dynamic change in the group members without multicast tree re-construction. The method is compatible with the RSVP and can be utilized in existing shared tree type routing protocols such as CBT and PIM sparse mode. The network resources can be utilized efficiently; furthermore, the loss rate of member's requests to receive more layers can be reduced by this routing method when a sufficient number of nodes have the packet filtering function and a sufficient number of hops is permitted.},
keywords={},
doi={},
ISSN={},
month={May},}
Salinan
TY - JOUR
TI - A Multicast Routing Method for Layered Streams
T2 - IEICE TRANSACTIONS on Communications
SP - 695
EP - 703
AU - Nagao OGINO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1999
AB - In this paper, a new multicast routing method for layered streams is proposed. This method is an extension of the weighted greedy algorithm (WGA) and uses two kinds of weight values to refine the link distance. It can cope with dynamic change in the group members without multicast tree re-construction. The method is compatible with the RSVP and can be utilized in existing shared tree type routing protocols such as CBT and PIM sparse mode. The network resources can be utilized efficiently; furthermore, the loss rate of member's requests to receive more layers can be reduced by this routing method when a sufficient number of nodes have the packet filtering function and a sufficient number of hops is permitted.
ER -