On Group Multicast Routing with Bandwidth Constraint : A Lower Bound and Performance Evaluation(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• Group multicasting is a generalization of multicasting whereby every member of a group is allowed to multicast messages to other members that belongs to the same group. The group multicast routing problem (GMRP) is that of finding a set of multicast trees with bandwidth requirements, each rooted at a member of the group, for multicasting messages to other members of the group. An optimal solution to GMRP is a set of trees, one for each member of the group, that incurs the least overall cost. This problem is known to be NP-complete and hence heuristic algorithms are likely to be the only viable approach for computing near optimal solutions in practice. In this paper, we derive a lower bound on the cost of an optimal solution to GMRP by using Lagrangean Relaxation and Snbgradient Optimization. This lower bound is used to evaluate the two existing heuristic algorithms in terms of their ability to find close-to-optimal solutions.

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

著者

• Low Chor

  School Of Electrical & Electronic Communication Nanyang Technological University

• WANG Ning

  School of Electrical & Electronic Communication, Nanyang Technological University

• Wang Ning

  School Of Electrical & Electronic Communication Nanyang Technological University

• WANG Ning

  School of Electrical & Electronic Communication, Nanyang Technological University

• WANG Ning

  School of Computer Science and Technology, Harbin Institute of Technology

関連論文

• A Computationally Efficient Energy-Aware Multicast Tree Recovery Algorithm for Ad Hoc Network(Network)
• On Group Multicast Routing with Bandwidth Constraint : A Lower Bound and Performance Evaluation(Network)
• On Group Multicast Routing with Bandwidth Constraint : A Lower Bound and Performance Evaluation
• Finger Vein Recognition with Gabor Wavelets and Local Binary Patterns

スポンサーリンク