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 bandw...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.展开更多
In order to improve the efficiency of data distributed management service in distributed interactive simulation based on high level architecture (HLA) and to reduce the network traffic and save the system resource, th...In order to improve the efficiency of data distributed management service in distributed interactive simulation based on high level architecture (HLA) and to reduce the network traffic and save the system resource, the approaches of multicast grouping in HLA-based distributed interactive simulation are discussed. Then a new dynamic multicast grouping approach is proposed. This approach is based on the current publication and subscription region in the process of simulation. The results of simulation experiment show that this approach can significantly reduce the message overhead and use fewer multicast groups.展开更多
基金Supported by China Postdoctoral Science Foundation (No.20030056007).
文摘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.
文摘In order to improve the efficiency of data distributed management service in distributed interactive simulation based on high level architecture (HLA) and to reduce the network traffic and save the system resource, the approaches of multicast grouping in HLA-based distributed interactive simulation are discussed. Then a new dynamic multicast grouping approach is proposed. This approach is based on the current publication and subscription region in the process of simulation. The results of simulation experiment show that this approach can significantly reduce the message overhead and use fewer multicast groups.
