<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-05-04T08:43:48Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:meral.edu.mm:recid/6340" verb="GetRecord">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/6340</identifier>
        <datestamp>2021-12-13T00:25:30Z</datestamp>
        <setSpec>1582963342780:1605779935331</setSpec>
        <setSpec>user-uit</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Performance Analysis of Layer Partition-based Matching Algorithm in Data Distribution Management</dc:title>
          <dc:creator>Nwe Nwe Myint Thein</dc:creator>
          <dc:description>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. The evolution of the DDM service in HLA provides solutions to problems by using filtering mechanism that is suitable for large-scale simulation. 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. The paper analyzes the performance of layer partition-based algorithms (LPM) for the matching process based on the different overlapping rate. The LPM algorithm provides the more definite matching area between update region and subscription region. The LPM algorithm guarantees low computational overheads for matching process of higher overlapping rate between the regions and reduce the irrelevant message among federates.</dc:description>
          <dc:date>2018-11-02</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000006340</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/6340</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
