A binary partition-based matching algorithm for data distribution management

Data Distribution Management (DDM) is one of the High Level Architecture (HLA) services that reduce message traffic over the network. The major purpose of the DDM is to filter the exchange of data between federates during a federation. However, this traffic reduction usually suffers from higher computational overhead when calculating the intersection between update regions and subscription regions in a matching process. In order to reduce the computational overhead for the matching process, this paper proposes a binary partition-based matching algorithm for DDM in the HLA-based distributed simulation. The new matching algorithm is fundamentally based on a divide-and-conquer approach. The proposed algorithm recursively performs binary partitioning which divides the regions into two partitions that entirely cover those regions. This approach promises low computational overhead, since it does not require unnecessary comparisons within regions in different partitions. The experimental results show that the proposed algorithm performs better than the existing DDM matching algorithms and improves the scalability of the DDM.