{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:44:00Z","timestamp":1777902240083,"version":"3.51.4"},"reference-count":40,"publisher":"SAGE Publications","issue":"11","license":[{"start":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T00:00:00Z","timestamp":1344470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>Data Distribution Management (DDM) is one of the High-level Architecture (HLA) services that reduce message traffic over the network. The major purpose of DDM is to filter and route the exchange of data between federates during a federation. However, this traffic reduction usually results in a significant computational overhead, which is caused by calculating the intersection between update regions and subscription regions in a matching process. To reduce the computational overhead for the matching process, this paper proposes a binary partition-based matching algorithm for DDM in a HLA-based distributed simulation. The new matching algorithm is fundamentally based on a divide-and-conquer approach. The proposed algorithm recursively performs binary partitioning that divides the regions into two partitions that entirely cover those regions. This approach promises low computational overhead, since it does not require unnecessary comparisons within regions in different partitions. The experimental results show that the proposed algorithm performs the existing DDM-matching algorithms better and improves the scalability of the DDM.<\/jats:p>","DOI":"10.1177\/0037549712450628","type":"journal-article","created":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T20:37:15Z","timestamp":1344544635000},"page":"1350-1367","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A binary partition-based matching algorithm for Data Distribution Management in a High-level Architecture-based distributed simulation"],"prefix":"10.1177","volume":"88","author":[{"given":"Junghyun","family":"Ahn","sequence":"first","affiliation":[{"name":"Department of EE, KAIST, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changho","family":"Sung","sequence":"additional","affiliation":[{"name":"Department of EE, KAIST, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tag Gon","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of EE, KAIST, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2012,8,9]]},"reference":[{"key":"bibr1-0037549712450628","first-page":"97S-SIW-053","volume-title":"proceedings of the spring simulation interoperability workshop","author":"Morse K","year":"1997"},{"key":"bibr2-0037549712450628","first-page":"98F-SIW-206","volume-title":"proceedings of the fall simulation interoperability workshop","author":"Hook DJV","year":"1998"},{"key":"bibr3-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.875"},{"key":"bibr4-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2003.10.004"},{"key":"bibr5-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2000.876561"},{"key":"bibr6-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/DISRTA.2000.874063"},{"key":"bibr7-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1145\/1044322.1044324"},{"key":"bibr8-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70715"},{"key":"bibr9-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/DISRTA.1998.694563"},{"key":"bibr10-0037549712450628","unstructured":"IEEE Std 1516-2000. IEEE standard for modeling and simulation (M&S) High Level Architecture (HLA) - framework and rules, 2000."},{"key":"bibr11-0037549712450628","volume-title":"Parallel and distributed simulation systems","author":"Fujimoto RM","year":"2000"},{"key":"bibr12-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.1998.745066"},{"key":"bibr13-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1177\/003754979807100603"},{"key":"bibr14-0037549712450628","unstructured":"IEEE Std 1516-2010. IEEE standard for modeling and simulation (M&S) High Level Architecture (HLA) - framework and rules, 2010."},{"key":"bibr15-0037549712450628","unstructured":"IEEE Std 1516.1-2010. IEEE standard for modeling and simulation (M&S) High Level Architecture (HLA) - federate interface specification, 2010."},{"key":"bibr16-0037549712450628","unstructured":"IEEE Std 1516.2-2010. IEEE standard for modeling and simulation (M&S) High Level Architecture (HLA) - Object Model Template (OMT) specification, 2010."},{"key":"bibr17-0037549712450628","unstructured":"DMSO. RTI 1.3-next generation programmer\u2019s guide version 5, DoD, February 2002."},{"key":"bibr18-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107700103"},{"key":"bibr19-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1798"},{"key":"bibr20-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/3468.995531"},{"key":"bibr21-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1177\/0037549705054051"},{"key":"bibr22-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1177\/0037549708096690"},{"key":"bibr23-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.04.001"},{"key":"bibr24-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1145\/361026.361034"},{"key":"bibr25-0037549712450628","first-page":"71","volume-title":"proceedings of the 37thsummer computer simulation conference (SCSC 2005)","author":"Su-Youn Hong J-HK","year":"2005"},{"key":"bibr26-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1177\/0037549707085541"},{"key":"bibr27-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/DISRTA.2000.874064"},{"key":"bibr28-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.872"},{"key":"bibr29-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/DS-RT.2006.28"},{"key":"bibr30-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.54"},{"key":"bibr31-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/PADS.2000.847149"},{"key":"bibr32-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/ANSS.2005.23"},{"key":"bibr33-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/PADS.2007.14"},{"key":"bibr34-0037549712450628","doi-asserted-by":"publisher","DOI":"10.1109\/DS-RT.2009.34"},{"key":"bibr35-0037549712450628","volume-title":"2010 International Conference on Intelligent Systems, Modelling and Simulation","author":"Lo S-H","year":"2010"},{"key":"bibr36-0037549712450628","first-page":"20","volume-title":"7thinternational workshop on distributed simulation and real-time applications (DS-RT 2003)","author":"Wang L","year":"2003"},{"key":"bibr37-0037549712450628","first-page":"667","volume-title":"SpringSim","author":"Eroglu O","year":"2008"},{"key":"bibr38-0037549712450628","volume-title":"Introduction to algorithms","author":"Cormen TH","year":"1990"},{"key":"bibr39-0037549712450628","volume-title":"Data structures and algorithms","author":"Aho AV","year":"1983"},{"key":"bibr40-0037549712450628","first-page":"4","author":"Liu ES","year":"2006","journal-title":"Comput Entertain"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549712450628","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549712450628","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549712450628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:23:54Z","timestamp":1777634634000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549712450628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,9]]},"references-count":40,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1177\/0037549712450628"],"URL":"https:\/\/doi.org\/10.1177\/0037549712450628","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,9]]}}}