A SORT-BASED INTEREST MATCHING ALGORITHM WITH TWO EXCLUSIVE JUDGING CONDITIONS FOR REGION OVERLAP

As the IEEE standard for distributed simulation, High-Level Architecture (HLA) defines the data distribution management (DDM) service to filter unnecessary communication among federates. In DDM, interest matching algorithm is essential for the message filtering. Among existing interest matching algorithms, sort-based algorithms have been proven to be the most efficient method in most scenarios. However, existing sort-based algorithms still have some drawbacks, the overhead of sorting the bounds can be further reduced and a portion of unnecessary bit or matching operations can be eliminated. In this paper, we propose a binary search enhanced sort-based interest matching algorithm (BSSIM). Based on two exclusive judging conditions for region overlap, sorting overhead can be remarkably reduced. Moreover, unnecessary bit or matching operations can be eliminated by binary searches. Experimental results show that BSSIM algorithm outperforms existing sort-based algorithms, and considerable performance improvement can be achieved.