MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "a90998bf-1287-433c-8538-11d29d424b86"}, "_deposit": {"created_by": 45, "id": "6705", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "6705"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006705", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "High Level Architecture (HLA) is an architecture\nfor reuse and interoperation of simulations. In HLA\nparadigm, the Runtime Infrastructure (RTI)\nprovides a set of services. Data Distribution\nManagement (DDM) service reduces message\ntraffic over the network. DDM aims to control and\nlimit the data exchanged between federates during\nfederation. Each federate may inform the RTI\nabout its intention to publish some data or it may\nsubscribe to receive a subset of the published data\nThese services rely on the computation of the\nintersection between “update” and “subscription”\nregions. When calculating the intersection between\nupdate regions and subscription regions, the higher\ncomputation overhead can occur. Currently, there\nare several main DDM filtering algorithms. This\npaper proposes a region distribution detection\nalgorithm to use in the binary partition-based\nmatching algorithm for DDM in the HLA-based\nlarge-scale distributed simulations. The new region\ndetection algorithm calculates the distribution of\nregions in the routing space after performing the\npartitioning of regions that contains in the\nprojected routing space. The partitioning among\nregions performs based on the result of optimal\npivot. Then, the proposed algorithm calculates the\nregions distribution and define the matching area\nof the selected partitions in routing space. The\nproposed algorithm provides the more definite\nmatching area between update region and\nsubscription region during matching process. This\nalgorithm guarantees low computational overheads\nfor matching process and reduces the irrelevant\nmessage among federates."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "High Level Architecture (HLA), Data Distribution Management (DDM)"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-09"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management.pdf", "filesize": [{"value": "472 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 472000.0, "url": {"url": "https://meral.edu.mm/api/files/a90998bf-1287-433c-8538-11d29d424b86/Optimization%20of%20Region%20Distribution%20Using%20Binary%20Partition-based%20Matching%20Algorithm%20for%20Data%20Distribution%20Management.pdf"}, "version_id": "4cd909c8-39e5-40b4-80dd-d79ed0ad3314"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "Issue 2", "subitem_journal_title": "International Journal of Engineering Research and Technology (IJERT)", "subitem_pages": "1-6", "subitem_volume": "Vol. 2"}]}, "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": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2013-02-04"}, "item_title": "Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management", "item_type_id": "21", "owner": "45", "path": ["1596102355557"], "permalink_uri": "https://meral.edu.mm/records/6705", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-09"}, "publish_date": "2020-12-09", "publish_status": "0", "recid": "6705", "relation": {}, "relation_version_is_last": true, "title": ["Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management"], "weko_shared_id": -1}
Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management
https://meral.edu.mm/records/6705
https://meral.edu.mm/records/6705349042d5-3999-4fef-89f6-9d880b472276
a90998bf-1287-433c-8538-11d29d424b86
Name / File | License | Actions |
---|---|---|
Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management.pdf (472 Kb)
|
|
Publication type | ||||||
---|---|---|---|---|---|---|
Journal article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Optimization of Region Distribution Using Binary Partition-based Matching Algorithm for Data Distribution Management | |||||
Language | en | |||||
Publication date | 2013-02-04 | |||||
Authors | ||||||
Nwe Nwe Myint Thein | ||||||
Nay Min Tun | ||||||
Description | ||||||
High Level Architecture (HLA) is an 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 the published data These services rely on the computation of the intersection between “update” and “subscription” regions. 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 proposes a region distribution detection algorithm to use in the binary partition-based matching algorithm for DDM in the HLA-based large-scale distributed simulations. The new region detection algorithm calculates the distribution of regions in the routing space after performing the partitioning of regions that contains in the projected routing space. The partitioning among regions performs based on the result of optimal pivot. Then, the proposed algorithm calculates the regions distribution and define the matching area of the selected partitions in routing space. The proposed algorithm provides the more definite matching area between update region and subscription region during matching process. This algorithm guarantees low computational overheads for matching process and reduces the irrelevant message among federates. |
||||||
Keywords | ||||||
High Level Architecture (HLA), Data Distribution Management (DDM) | ||||||
Journal articles | ||||||
Issue 2 | ||||||
International Journal of Engineering Research and Technology (IJERT) | ||||||
1-6 | ||||||
Vol. 2 |