An efficient algorithm for group multicast routing with bandwidth reservation

Authors:
C.P Low;N Wang
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore 639798
Venue:
Computer Communications
Year:
2000

Citing 4
Cited 1

On finding Steiner vertices

Networks
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem

IEEE Transactions on Computers

Quantified Score

Hi-index	0.25

Visualization

Abstract

Multicasting refers to the transmission of data from a source node to multiple destination nodes in a network. Group multicasting is a generalisation of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. In this paper, we propose a new heuristic algorithm to generate a set of low cost multicast trees with bandwidth requirements. Simulation results show that our proposed algorithm performed better in terms of cost and in terms of utilisation of bandwidth as compared to an existing algorithm that was proposed by Jia and Wang [3].