Abstract
The HLA Data Distribution Management (DDM) service provides an abstract,application-driven data filtering capability. It can reduce the transmission and reception of irrelevant data. The key problem of its implementation is region matching algorithm. The current algorithms such as directly matching,grid-based,and sort-based approach are all not so perfect. They are either time consuming or inaccuracy in filtering,and are difficult to support large-scale simulation. Aiming at the characteristic of frequently region changing in large-scale simulation systems,a more effective matching algorithm based on intersecting information of region moving is proposed. It represents the upper bound and lower bound of a range with two nodes,and uses two indexed ordered tables to store the publication and subscription nodes of a dimension respectively. It uses range intersecting information during a range moving,and limits the matching computing only in the area of moving. Thereby it can greatly decrease the candidate ranges that need to do matching computing,thus can decrease the matching complexity greatly,and reach precise matching with high performance. This algorithm is extremely fit for the need of large-scale distributed simulation that has a large number of regions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
