ADAPTIVE MULTICAST ROUTING SCHEME FOR REAL-TIME TRAFFIC

Abstract

Multicasting is the simultaneous transmission of data to the multiple destinations and its applications typically have stringent Quality. of Service (QoS) requirements. The ' network is : characterized by the multiple metrics such as bandwidth, delay, loss probability etc. One of the important.step in multicasting. is finding the - optimum path from source to destinations, i.e.: construction of .the multicast tree._ Selected route may be responsible for high delay and network cost. In the real-time applications, there is usually no need to minimize the average delay to all the destinations. It is often required that the delay to any destination should be within bound. This dissertation presents . some delay bound routing algorithms for the real time multicast connection in which all the destinations will receive data in the pre-specified time and proposes an algorithm which is helpful in reducing the cost and optimize the network bandwidth utilization. Simulation Results show the cost of the routing tree generated and congestion in the network by this method is better than other existing algorithms.