Efficient multicast routing algorithms on mesh networks

摘要

Multicast can provide efficient information dissemination for a subscribed user group on networks. This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on mesh networks using optimal shared free routing. The algorithms can select an optimal root for constructing the shared tree so as to minimize the average delay for multicast messages. Tree generation is able to best utilize network resources with fewer links and nodes compared to other approaches. Simulation results indicate that our algorithms are efficient compared with the existing multicast algorithms for balancing the objectives of short average delay and reduced resource utilization.