An efficient algorithm for group multicast routing with bandwidth reservation

✍ Scribed by C.P Low; N Wang

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 318 KB
• Volume: 23
• Category: Article
• ISSN: 0140-3664
• DOI: 10.1016/s0140-3664(00)00222-x

✦ Synopsis

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