{"id":"https://openalex.org/W3152450057","doi":"https://doi.org/10.1109/wsc.2011.6147978","title":"A binary partition-based matching algorithm for Data Distribution Management","display_name":"A binary partition-based matching algorithm for Data Distribution Management","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W3152450057","doi":"https://doi.org/10.1109/wsc.2011.6147978","mag":"3152450057"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2011.6147978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2011.6147978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109008235","display_name":"Junghyun Ahn","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Junghyun Ahn","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108502368","display_name":"Changho Sung","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Changho Sung","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053501953","display_name":"Tag Gon Kim","orcid":"https://orcid.org/0000-0001-7943-6509"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Tag Gon Kim","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109008235"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69291017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2723","last_page":"2734"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7726372480392456},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6288086175918579},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6005985736846924},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5331980586051941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5296069383621216},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5092536211013794},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4602583348751068},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45982077717781067},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45700159668922424},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4302457571029663},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41385188698768616},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34528374671936035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11736240983009338}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7726372480392456},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6288086175918579},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6005985736846924},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5331980586051941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5296069383621216},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5092536211013794},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4602583348751068},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45982077717781067},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45700159668922424},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4302457571029663},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41385188698768616},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34528374671936035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11736240983009338},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc.2011.6147978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2011.6147978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2023578692","https://openalex.org/W2054316261","https://openalex.org/W2069188114","https://openalex.org/W2125833921","https://openalex.org/W2149573515","https://openalex.org/W2155962907","https://openalex.org/W2165916626","https://openalex.org/W6682972157"],"related_works":["https://openalex.org/W2352794675","https://openalex.org/W1539994214","https://openalex.org/W2051228988","https://openalex.org/W4247094814","https://openalex.org/W108531593","https://openalex.org/W2111712077","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2162911572","https://openalex.org/W2375526705"],"abstract_inverted_index":{"Data":[0],"Distribution":[1],"Management":[2],"(DDM)":[3],"is":[4,26,92],"one":[5],"of":[6,23,31,156],"the":[7,18,24,29,50,66,70,84,108,141,147,154,157],"High":[8],"Level":[9],"Architecture":[10],"(HLA)":[11],"services":[12],"that":[13,113,140],"reduce":[14,65],"message":[15],"traffic":[16,40],"over":[17],"network.":[19],"The":[20,88,99,136],"major":[21],"purpose":[22],"DDM":[25,82,149],"to":[27,64],"filter":[28],"exchange":[30],"data":[32],"between":[33,52],"federates":[34],"during":[35],"a":[36,59,76,96],"federation.":[37],"However,":[38],"this":[39,73],"reduction":[41],"usually":[42],"suffers":[43],"from":[44],"higher":[45],"computational":[46,67,122],"overhead":[47,68],"when":[48],"calculating":[49],"intersection":[51],"update":[53],"regions":[54,57,109,132],"and":[55,152],"subscription":[56],"in":[58,83,133],"matching":[60,71,79,90,150],"process.":[61],"In":[62],"order":[63],"for":[69,81],"process,":[72],"paper":[74],"proposes":[75],"binary":[77,104],"partition-based":[78],"algorithm":[80,91,101,143],"HLA-based":[85],"distributed":[86],"simulation.":[87],"new":[89],"fundamentally":[93],"based":[94],"on":[95],"divide-and-conquer":[97],"approach.":[98],"proposed":[100,142],"recursively":[102],"performs":[103,144],"partitioning":[105],"which":[106],"divides":[107],"into":[110],"two":[111],"partitions":[112],"entirely":[114],"cover":[115],"those":[116],"regions.":[117],"This":[118],"approach":[119],"promises":[120],"low":[121],"overhead,":[123],"since":[124],"it":[125],"does":[126],"not":[127],"require":[128],"unnecessary":[129],"comparisons":[130],"within":[131],"different":[134],"partitions.":[135],"experimental":[137],"results":[138],"show":[139],"better":[145],"than":[146],"existing":[148],"algorithms":[151],"improves":[153],"scalability":[155],"DDM.":[158]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}