A PRIORITIZED SCHEME FOR CONCURRENT GROUP MULTICAST

Abstract

This dissertation presents a prioritized scheme for concurrent group multicast that coexist in a network. To do multicasting, group management is required. Thus some way is needed to create and destroy groups and for process to join and leaves groups. This work describes how these tasks are accomplished. Y. Ofek and B. Yener have given a method of formulation of multicast groups that coexist in the network and simple ring routing is used for sending the data to destinations. To make multicast groups in a network first shortest path is setup. Equal bandwidth is given to all groups that coexist in network for transmitting the data. In this dissertation we have introduce the concept of priority for concurrent group multicast. The priority is give on the basis of size of a multicast group, smallest group has the highest priority. It is shown that delay is reduced by using priority. The two types of multicast protocol used in this work are - (i) Dynamic routing (ii) Simple ring routing Both routing techniques are reliable that is data is received correctly by all the active members of the multicast group. Time complexity and message complexity is measured for both routing. Time complexity is less in dynamic routing than simple ring routing because in dynamic routing packet does not travel to all destinations as in simple ring.