Moving-intersecting-information-based matching algorithm for dynamic DDM

Authors:
Yiping Yao;Yingxing Zhang;Lili Chen;Laibin Yan
Affiliations:
National University of Defense Technology, Changsha, P. R. China;National University of Defense Technology, Changsha, P. R. China;National University of Defense Technology, Changsha, P. R. China;National University of Defense Technology, Changsha, P. R. China
Venue:
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Year:
2009

Citing 6
Cited 0

Optimizing cell-size in grid-based DDM

PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Evaluation of a sort-based matching algorithm for DDM

Proceedings of the sixteenth workshop on Parallel and distributed simulation
Grid-Based Data Management in Distributed Simulation

SS '00 Proceedings of the 33rd Annual Simulation Symposium
A Hybrid Approach to Data Distribution Management

DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A sort-based DDM matching algorithm for HLA

ACM Transactions on Modeling and Computer Simulation (TOMACS)
An Efficient Sort-Based DDM Matching Algorithm for HLA Applications with a Large Spatial Environment

Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The HLA Data Distribution Management (DDM) service provides value-based data filtering capability to reduce the transmission and reception of irrelevant data. The performance of DDM relies strongly on the computation of the intersection between update and subscription regions. Currently, there are several typical DDM matching algorithms. Since these algorithms are still not good enough to deal with the scenarios that the regions need to be modified along with the simulation advancement dynamically, this paper proposes a more effective matching algorithm, which is called Moving-Intersecting-Information-Based Matching Algorithm (MIIBM). MIIBM uses range intersecting information during a range moving, and limits the matching computing only in the moving area. Our experiment result shows that MIIBM has the best computational performance and is suitable for the requirements of large-scale distributed simulation that has a large number of dynamic regions.