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
본 논문에서는 그룹 멀티캐스트 라우팅 문제(GMRP)에 대한 실행 가능한 솔루션을 찾는 문제를 다룹니다. 이 문제는 그룹의 모든 구성원이 동일한 그룹의 다른 구성원에게 메시지를 멀티캐스트할 수 있도록 허용하는 멀티캐스트 라우팅 문제를 일반화한 것입니다. 라우팅 문제에는 네트워크의 모든 그룹 구성원에 대한 대역폭 요구 사항을 갖춘 저렴한 멀티캐스트 트리 집합의 구성이 포함됩니다. 우리는 먼저 GMRP에 대한 실행 가능한 솔루션을 찾는 문제가 NP-완전하다는 것을 증명합니다. 이어서 우리는 GMRP에 대한 실행 가능한 솔루션을 구축하기 위한 새로운 경험적 알고리즘을 제안합니다. 시뮬레이션 결과는 우리가 제안한 알고리즘이 존재할 때마다 실행 가능한 솔루션을 찾는 능력 측면에서 좋은 성능을 달성할 수 있음을 보여줍니다.
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.
부
Chor Ping LOW, Ning WANG, "On Finding Feasible Solutions for the Group Multicast Routing Problem" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 1, pp. 268-277, January 2002, doi: .
Abstract: In this paper we addresses the problem of finding feasible solutions for the Group Multicast Routing Problem (GMRP). This problem is a generalization of the multicast routing problem whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. We first prove that the problem of finding feasible solutions to GMRP is NP-complete. Following that we propose a new heuristic algorithm for constructing feasible solutions for GMRP. Simulation results show that our proposed algorithm is able to achieve good performance in terms of its ability of finding feasible solutions whenever one exist.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_1_268/_p
부
@ARTICLE{e85-b_1_268,
author={Chor Ping LOW, Ning WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={On Finding Feasible Solutions for the Group Multicast Routing Problem},
year={2002},
volume={E85-B},
number={1},
pages={268-277},
abstract={In this paper we addresses the problem of finding feasible solutions for the Group Multicast Routing Problem (GMRP). This problem is a generalization of the multicast routing problem whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. We first prove that the problem of finding feasible solutions to GMRP is NP-complete. Following that we propose a new heuristic algorithm for constructing feasible solutions for GMRP. Simulation results show that our proposed algorithm is able to achieve good performance in terms of its ability of finding feasible solutions whenever one exist.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - On Finding Feasible Solutions for the Group Multicast Routing Problem
T2 - IEICE TRANSACTIONS on Communications
SP - 268
EP - 277
AU - Chor Ping LOW
AU - Ning WANG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2002
AB - In this paper we addresses the problem of finding feasible solutions for the Group Multicast Routing Problem (GMRP). This problem is a generalization of the multicast routing problem whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. We first prove that the problem of finding feasible solutions to GMRP is NP-complete. Following that we propose a new heuristic algorithm for constructing feasible solutions for GMRP. Simulation results show that our proposed algorithm is able to achieve good performance in terms of its ability of finding feasible solutions whenever one exist.
ER -