A hybrid multicast-unicast assignment approach for data distribution management in HLA

A hybrid multicast-unicast assignment approach for data distribution management in HLA
复制标题

DOI:
10.1016/j.simpat.2013.08.005
复制
发表时间:
2014-01-01
影响因子:
4.2
通讯作者:
Zheng, Ting
Zheng, Ting
中科院分区:
计算机科学2区
文献类型:
--
作者:
Wang, Jian;Zheng, Ting

文献摘要

被引文献

相似文献

HLA中的数据分发管理(DDM)的主要目的是减少大规模分布式仿真中联邦成员接收的数据量。有限多播资源的使用对DDM的性能起着关键作用。为了有效地利用通信协议来提高DDM的性能,提出了一种混合多播单播数据传输问题及其形式化定义,并在此基础上提出了一种混合多播单播分配方法。该方法采用了一种新的自适应通信协议选择(ACPS)策略,利用组播和单播的优点,避免他们的缺点,并考虑连接之间的相互关系。根据静态连接和动态连接的不同,分为ACPS静态分配算法和ACPS动态分配算法。在我们的方法中,距离的概念来衡量之间的相互关系,多播和单播的消息冗余,这是两个算法的核心,以收集连接到一个多播组或平衡使用单播和多播的最佳性能。因此,我们的算法可以更有效地决定是否一个新的连接应该使用单播或组播通信,以及是否调整以前的分配结果可以进一步提高性能。此外,还引入了一种控制机制来处理动态分配过程中的连接变化。实验结果表明,在真实的运行环境中,该算法能够有效地利用组播和单播通信资源,并取得比现有方法更好的性能。皇冠版权所有(C)2013由爱思唯尔B.V.出版保留所有权利。
The main focus of data distribution management (DDM) in HLA is to reduce the amount of data received by federates in large-scale distributed simulations. The use of limited multicast resources plays a key role in the performance of DDM. In order to improve the performance of DDM by using communication protocol effectively, a hybrid multicast unicast data transmission problem and its formal definition are presented, and then a hybrid multicast unicast assignment approach is proposed. The approach uses a new adaptive communication protocol selection (ACPS) strategy to utilize the advantages of multicast and unicast, avoid their disadvantages, and consider the inter-relationship between connections. It includes the ACPS static assignment algorithm and the ACPS dynamic assignment algorithm, according to the difference between the static connections and the dynamic connections. In our approach, a concept of distance is presented to measure the inter-relationship between connections for multicast and the message redundancy for unicast, which is the core of the two algorithms in order to gather the connections to a multicast group or to balance the use of unicast and multicast for best performance. As a result, our algorithms can more effectively decide whether a new connection should use unicast or multicast communication, and whether adjusting previous assignment result can further improve the performance. In addition, a control mechanism is introduced to deal with connection changes during the dynamic assignment. The experiment results indicate that our algorithms can utilize the multicast and unicast communication resources effectively, as well as can achieve better performance than existing methods in the real running environment. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.