On Finding Feasible Solutions to the Group Multicast Routing Problem

Authors:
Ning Wang;Chor Ping Low
Affiliations:
-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 7
Cited 0

On finding Steiner vertices

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Efficient Algorithm for Group Multicast Routing with Bandwidth Reservation

ICON '99 Proceedings of the 7th IEEE International Conference on Networks
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group multicast routing problem (GMRP) is a generalization of multicasting whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. The traditional solutions only care for the low cost of multicast trees and sometimes the algorithms will fail during the construction due to the inefficiency of the bandwidth allocation. In this paper we study the feasible solutions to GMRP by proposing a new algorithm to improve the success rate of constructing multicast trees. Simulation results show that our new algorithm performed better in terms of bandwidth utilization and success rate of building multicast trees compared with existing algorithms.