On Finding Feasible Solutions for the Group Multicast Routing Problem

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2002-01-01

著者

• Low C

  Nanyang Technological Univ. Singapore Sgp

• LOW Chor

  the School of Electrical and Electronic Engineering, Nanyang Technological University

• WANG Ning

  the School of Electrical and Electronic Engineering, Nanyang Technological University

• Wang N

  Nanyang Technological Univ. Singapore Sgp

• Wang Ning

  The School Of Electrical And Electronic Engineering Nanyang Technological University

関連論文

• On Finding Feasible Solutions for the Group Multicast Routing Problem

スポンサーリンク