{"created":"2020-12-09T16:04:50.843107+00:00","id":6709,"links":{},"metadata":{"_buckets":{"deposit":"8e56deae-fe0b-46f0-91ec-ae59a3264f47"},"_deposit":{"created_by":45,"id":"6709","owner":"45","owners":[45],"owners_ext":{"displayname":"","email":"dimennyaung@uit.edu.mm","username":""},"pid":{"revision_id":0,"type":"depid","value":"6709"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/00006709","sets":["1582963342780:1596102355557"]},"communities":["uit"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Layer Partition-based Matching Algorithm of DDM","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"High Level Architecture (HLA) is architecture for\nreuse and interoperation of simulations. In HLA paradigm, the\nRuntime Infrastructure (RTI) provides a set of services. Data\nDistribution Management (DDM) service reduces message traffic\nover the network. DDM aims to control and limit the data exchanged\nbetween federates during federation. Each federate may inform the\nRTI about its intention to publish some data or it may subscribe to\nreceive a subset of the published data. DDM services are used to\nreduce the transmission and receiving of irrelevant data and aimed at\nreducing the communication over the network. These services rely on\nthe computation of the intersection between “update” and\n“subscription” regions. When calculating the intersection between\nupdate regions and subscription regions, the higher computation\noverhead can occur. Currently, there are several main DDM filtering\nalgorithms. This paper proposes the layer partition-based matching\nalgorithm for DDM in the HLA-based large-scale distributed\nsimulations. The new algorithm chooses the dynamic pivot based on\nregions distribution in the routing space. The binary partition-based\nalgorithm is fundamentally based on a divide and conquers approach.\nThis algorithm always chooses the midpoint as the pivot point of\nrouting space. This approach promises low computational overhead,\nsince it does not require unnecessary comparisons within regions in\ndifferent partitions. The proposed algorithm firstly calculates the\nregions distribution. Then, the partitioning among regions performs\nbased on the result of choosing pivot based on region detection and\ndefines the matching area that entirely covers all regions which need\nto match with regions at pivot point. The proposed algorithm\nprovides the more definite matching area between update region and\nsubscription region during matching process. This algorithm\nguarantees low computational overheads for matching process based\non the overlapping degree between the regions and reduce the\nirrelevant message among federates."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value_mlt":[{"interim":"HLA"},{"interim":"DDM"},{"interim":"Region-based Algorithm"},{"interim":"Grid-based Algorithm"},{"interim":"Sort-based Algorithm"},{"interim":"Binary Partition-based Algorithm"},{"interim":"Layer Partition-based Algorithm"}]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2020-12-09"}],"displaytype":"preview","filename":"Layer Partition based Matching Algorithm of DDM.pdf","filesize":[{"value":"901 Kb"}],"format":"application/pdf","url":{"url":"https://meral.edu.mm/api/files/8e56deae-fe0b-46f0-91ec-ae59a3264f47/Layer%20Partition%20based%20Matching%20Algorithm%20of%20DDM.pdf"},"version_id":"5a582b0e-852b-4612-9f64-c7017e5f56d9"}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"ICCTAI'2014","subitem_c_date":"11-12 February, 2014","subitem_conference_title":"3rd International Conference on Computational Techniques and Artificial Intelligence","subitem_place":"Singapore"}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Nwe Nwe Myint Thein"},{"subitem_authors_fullname":"Nay Min Tun"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Conference paper"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2014-02-12"},"item_title":"Layer Partition-based Matching Algorithm of DDM","item_type_id":"21","owner":"45","path":["1596102355557"],"publish_date":"2020-12-09","publish_status":"0","recid":"6709","relation_version_is_last":true,"title":["Layer Partition-based Matching Algorithm of DDM"],"weko_creator_id":"45","weko_shared_id":-1},"updated":"2022-03-24T23:16:01.324457+00:00"}