A Dynamic Multicast Routing Algorithm with Inaccurate Information Satisfying Multiple QoS Constraints

A dynamic multicast routing algorithm with inaccurate information satisfying multiple QoS constraints named DMIQ has been proposed.DMIQ uses modified BF algorithm as path search algorithm,WFQ as scheduling mechanism,and it can build a multicast tree with the least hops and costs after satisfying bandwidth,delay,delay jitter and loss constraints while link delays are inaccurate and uniformly distributed.The simulation results show that DMIQ has better performances than the multicast routing algorithms that does not satisfy any QoS.