摘要
Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.
Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link, And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member＇s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature. Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.
基金
Supported by China Postdoctoral Science Foundation (No.20030056007).
