Multicasting with minimum communication overhead
Danam Mahesh, S. V. Raghavan · 2002
Multicasting finds many applications on the Internet. User Datagram Protocol (UDP), used for multicasting does not ensure reliability in data transmission. We suggest that multicast routing protocols should consider reliability of the route as a routing parameter while calculating the optimal path. This minimizes the overall bandwidth consumed by a multicast session, as the data to be retransmitted is less. There exists a tradeoff between the trees constructed using reliability (RPT) and the trees constructed using path length (SPT). We introduce a few methods to find the intermediate trees or set of trees lying in the spectrum of trees with SPT and RPT as ends of the spectrum. The performance of this tree is evaluated using simulations on different networks topologies. The simulations are done using the event-driven Network Simulator (NS-2) on highly densed network topologies. It is observed that these intermediate trees shows 10%-15 % savings in the bandwidth consumption over SPTs and RPTs.