Layer Partition-based Matching Algorithm of DDM based on Dimension
Keywords:
HLA, DDM, Region-based Algorithm, Grid-based Algorithm, Sort-based Algorithm, Binary Partition-based Algorithm, Layer Partition-based AlgorithmAbstract
High Level Architecture (HLA) is architecture for reuse and interoperation of simulations. In HLA paradigm, the Runtime Infrastructure (RTI) provides a set of services. Data Distribution Management (DDM) service reduces message traffic over the network. DDM aims to control and limit the data exchanged between federates during federation. Each federate may inform the RTI about its intention to publish some data or it may subscribe to receive a subset of th e published data. DDM services are used to reduce the transmission and receiving of irrelevant data and aimed at reducing the communication over the network. These services rely on the computation of the intersection between “update” and “subscription” reg ions. When calculating the intersection between update regions and subscription regions, the higher computation overhead can occur. Currently, there are several main DDM filtering algorithms. This paper compares the performance of the layer partition -based matching algorithm based on the result of previous calculated dimension. The algorithm chooses the dynamic pivot based on regions distribution in the routing space. The proposed algorithm firstly calculates the regions distribution. Then, the partitioning among regions performs based on the result of choosing pivot based on region detection and defines the matching area that entirely covers all regions which need to match with regions at pivot point. The proposed algorithm provides the mo re definite matching area between update region and subscription region during matching process. This algorithm firstly calculates the X-dimension for matching result. Then modify the input region of Y-dimension based on the matching result of the previous dimension. The proposed algorithm is more efficient most of overlapping degree but sometime the proposed algorithm has more execution time than the original layer partition-based algorithm.
References
C. Raczy, G. Tan, J. Yu. “A Sort-Based DDM Matching Algorithm for HLA”, ACM Transactions on Modeling and Computer Simulation (TOMACS), Vol. 15 Issue 1, 2005.
M. T. Nwe Nwe, T. Nay Min, “Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management”, International Journal of Engineering Research & Technology (IJERT) Vol.2 Issue 2, Feb. 2013
J. S. Steinman, K. Morse. “Data Distribution Management in HLA: Multidimensional Regions and Physically Correct Filtering”. Proc.
Spring Simulation Interoperability Workshop, 1997.
J. S. Damann, R. M. Fujimoto and R. M. Weatherly. "The DoD High Level Architecutre: An Update", Proc. Simulation Conference, Dec.
I. Tacic, R. T. Fujimoto. “Synchronized Data Distribution Management in Distributed Simulations”, Proc. 12th Workshop on Parallel and Distributed Simulation, 1998.
K. L. Morse, K. Tsai, L. Bic, "Multicast Grouping for Dynamic Data Distribution Management", Proc. Summer Computer Simulation
Conference, cs.bham.ac.uk, 1999.
A. Boukerche and A. Roy. “In Search of Data Distribution Management in Large Scale Distributed Simulations", Proc. Summer Simulation Conference, 2000.
A. Boukerche, A. Roy, and N. Thomas. “Dynamic Grid-Based Multicast Group Assignment in Data Distribution Management”. Proc. 4th International Workshop on Distributed Simulation and Real-Time Applications, 2000, p 47–54.
G. T an, R. Ayani, and Y. Zhang. “A Hybrid Approach to Data Distribution Management”. Proc. 4th International Workshop on Distributed Simulation and Real-Time Applications, 2000, p. 55–61.
R. Ayani, F. Moradi and G. T an. "Optimizing cell-size in grid-based DDM", Proc. 14th Workshop on Parallel and Distributed Simulation, Bologna Italy, May, 2000, p. 93–100.
Y. Jun, C. Raczy and G. Tan. "Evaluation of sort -based matching algorithm for the DDM", Proc. 16th Workshop on Parallel and Distributed Simulation, Washington DC, May. 2002, p. 68–75.
C. Sung, J. Ahn, T. G. Kim. "A Binary Partition-Based Matching Algorithm for Data Distribution Management", Proc. Winter Simulation Conference, 2011.
M. T. Nwe Nwe, T. Nay Min, “Dynamic Pivot for Layer Partitionbased Matching Algorithm of DDM based on Regions Distribution”, Proc. Fourth International Conference on Science and Engineering (ICSE 2013), Yangon, Myanmar, December, 2013.
M. T. Nwe Nwe, T. Nay Min, “Layer Partition-based Matching Algorithm of DDM”, Proc. 3rd International Conference on Computational Techniques and Artificial Intelligence (ICCTAI'2014), Singapore, February, 2014.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 COMPUSOFT: An International Journal of Advanced Computer Technology
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.
©2023. COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY by COMPUSOFT PUBLICATION is licensed under a Creative Commons Attribution 4.0 International License. Based on a work at COMPUSOFT: AN INTERNATIONAL OF ADVANCED COMPUTER TECHNOLOGY. Permissions beyond the scope of this license may be available at Creative Commons Attribution 4.0 International Public License.