{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:24Z","timestamp":1740142764621,"version":"3.37.3"},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"CERNET Innovation Project","award":["NGLL20170412"],"award-info":[{"award-number":["NGLL20170412"]}]},{"DOI":"10.13039\/501100001844","name":"National Science and Technology Management Information System","doi-asserted-by":"publisher","award":["2018YFB0804703"],"award-info":[{"award-number":["2018YFB0804703"]}],"id":[{"id":"10.13039\/501100001844","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Due to the limitations of physical resources, if a large-scale emulation network environment composed of millions of vertices and edges is constructed by virtualization technology, the whole network topology should be partitioned into a set of subnets. The topology partition is a work of graph partition. The existing topology partition methods have shortcomings, such as low efficiency and poor practicability, especially for large-scale network topology. The emulation network is a kind of complex network and has the characteristics of community structure. Therefore, we proposed LENTP (large-scale emulation network topology partition) based on the community detection with the weight of the vertex similarity for large-scale topology partition. In the first stage, the tree-structured area compression reduces the topology scales significantly to improve partition efficiency. And then, the improved Louvain algorithm is used to topology partitioning and obtain an initial set of subnets with the minimum number of subnets and remote links. Finally, after repartitioning and merging for the initial subnets, the result of subnets is the final topology partition that reaches the optimization objectives with the conditions of the virtual resources. In the experiment, the method is tested in five groups of network topology with different scales. The results demonstrate that LENTP can partition the network topology over 1\u00a0000\u00a0000 nodes and significantly improve the running-time efficiency of the network topology partition.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac041","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T12:18:20Z","timestamp":1647346700000},"page":"1817-1828","source":"Crossref","is-referenced-by-count":2,"title":["Large-Scale Emulation Network Topology Partition Based on Community Detection With the Weight of Vertex Similarity"],"prefix":"10.1093","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1036-2040","authenticated-orcid":false,"given":"Jianen","family":"Yan","sequence":"first","affiliation":[{"name":"Computer science and technology , Faculty of Computing, Harbin Institute of Technology, Harbin 150001 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8925-9067","authenticated-orcid":false,"given":"Haiyan","family":"Xu","sequence":"additional","affiliation":[{"name":"Computer science and technology , Faculty of Computing, Harbin Institute of Technology, Harbin 150001 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8567-4025","authenticated-orcid":false,"given":"Ning","family":"Li","sequence":"additional","affiliation":[{"name":"Computer science and technology , Faculty of Computing, Harbin Institute of Technology, Harbin 150001 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2981-0790","authenticated-orcid":false,"given":"Zhaoxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Computer science and technology , Faculty of Computing, Harbin Institute of Technology, Harbin 150001 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,4,14]]},"reference":[{"key":"2023081805144950900_ref1","first-page":"1","volume-title":"Proc. ICMCIS 2016, Brussels, Belgium, May 23\u201324, 2016","author":"Suri","year":"2016"},{"key":"2023081805144950900_ref2","first-page":"585","volume-title":"Proc. ITNG 2020, Las Vegas, Nevada, April 5\u20138, 2020","author":"Barea","year":"2020"},{"key":"2023081805144950900_ref3","doi-asserted-by":"crossref","first-page":"107289","DOI":"10.1016\/j.comnet.2020.107289","article-title":"Errant: realistic emulation of radio access networks","volume":"176","author":"Trevisan","year":"2020","journal-title":"Comput. Netw."},{"key":"2023081805144950900_ref4","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/TCC.2018.2883063","article-title":"Threat-specific security risk evaluation in the cloud","volume":"9","author":"Nhlabatsi","year":"2021","journal-title":"IEEE Trans. Cloud Comput"},{"key":"2023081805144950900_ref5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00779-018-1111-z","article-title":"Discrete PSO-based workload optimization in virtual machine placement","volume":"22","author":"Yan","year":"2018","journal-title":"Pers. Ubiquit. Comput."},{"key":"2023081805144950900_ref6","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.comcom.2020.01.025","article-title":"Survivable services oriented protection level-aware virtual network embedding","volume":"152","author":"Li","year":"2020","journal-title":"Comput. Commun."},{"key":"2023081805144950900_ref7","doi-asserted-by":"crossref","first-page":"056131","DOI":"10.1103\/PhysRevE.70.056131","article-title":"Analysis of weighted networks","volume":"70","author":"Newman","year":"2004","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"2023081805144950900_ref8","first-page":"391","volume-title":"Proc. ICA3PP 2007, Hangzhou, China, June 11\u201314, 2007","author":"Wu","year":"2007"},{"key":"2023081805144950900_ref9","first-page":"2030","article-title":"Research on topology mapping method for multiscale integration network emulation","volume":"31","author":"Liu","year":"2019","journal-title":"J. Syst. Emulation"},{"volume-title":"The Research and Implementation of Dynamically Configurable Virtual Network Technology in Cyber Range","year":"2015","author":"An","key":"2023081805144950900_ref10"},{"key":"2023081805144950900_ref11","first-page":"122","article-title":"Evaluation model for topology partition base on emulation run time","volume":"34","author":"Ge","year":"2013","journal-title":"J. Commun."},{"key":"2023081805144950900_ref12","first-page":"1560","article-title":"Topology partition algorithm based on abstract subtraction and traffic estimation for parallel network emulation","volume":"49","author":"Zhang","year":"2012","journal-title":"J. Comp. Res. Develop"},{"key":"2023081805144950900_ref13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"2023081805144950900_ref14","first-page":"228","volume-title":"Proc. 39th Int. Conf. Distributed Computing Systems, Dallas, TX, USA, July 7\u201310, 2019","author":"Ji","year":"2019"},{"key":"2023081805144950900_ref15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.asoc.2016.01.013","article-title":"An ant colony optimization algorithm for partitioning graphs with supply and demand","volume":"41","author":"Jovanovic","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"2023081805144950900_ref16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-011-0503-x","article-title":"An exact algorithm for graph partitioning","volume":"137","author":"Hager","year":"2013","journal-title":"Math Program B"},{"key":"2023081805144950900_ref17","doi-asserted-by":"crossref","first-page":"184668","DOI":"10.1109\/ACCESS.2019.2960868","article-title":"Query-sensitive graph partitioner for pattern matching applications","volume":"7","author":"Lu","year":"2019","journal-title":"IEEE Access"},{"key":"2023081805144950900_ref18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.knosys.2017.08.001","article-title":"A feasible graph partition framework for parallel computing of big graph","volume":"134","author":"Liu","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"2023081805144950900_ref19","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1186\/s40537-020-00357-y","article-title":"DHPV: a distributed algorithm for large-scale graph partitioning","volume":"7","author":"Adoni","year":"2020","journal-title":"J. Big Data"},{"key":"2023081805144950900_ref20","first-page":"664","volume-title":"2019 IEEE Military Communications Conf. (MILCOM), Norfolk, VA, USA, November 12\u201314","author":"Macker","year":"2019"},{"key":"2023081805144950900_ref21","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ejor.2020.07.031","article-title":"A polynomial algorithm for balanced clustering via graph partitioning","volume":"289","author":"Caraballo","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"2023081805144950900_ref22","first-page":"1","article-title":"Personalized trajectory privacy preserving method based on graph partition","volume":"3","author":"Yang","year":"2015","journal-title":"J. Commun."},{"key":"2023081805144950900_ref23","first-page":"1","article-title":"An improved Louvain algorithm for community detection","volume":"2021","author":"Zhang","year":"2021","journal-title":"Math. Probl. Eng."},{"key":"2023081805144950900_ref24","doi-asserted-by":"crossref","first-page":"11447","DOI":"10.3390\/app112311447","article-title":"Deep learning-based community detection approach on multimedia social networks","volume":"11","author":"Ferraro","year":"2021","journal-title":"Appl. Sci."},{"key":"2023081805144950900_ref25","doi-asserted-by":"crossref","first-page":"126370","DOI":"10.1016\/j.physa.2021.126370","article-title":"Community detection in directed acyclic graphs of adversary interactions","volume":"584","author":"Wu","year":"2021","journal-title":"Physica A"},{"key":"2023081805144950900_ref26","doi-asserted-by":"crossref","first-page":"103192","DOI":"10.1016\/j.dsp.2021.103192","article-title":"A signal processing perspective to community detection in dynamic networks","volume":"119","author":"Aviyente","year":"2021","journal-title":"Digit. Signal Process"},{"key":"2023081805144950900_ref27","first-page":"155","article-title":"Fast unfolding of communities in large networks","volume":"10","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech."},{"key":"2023081805144950900_ref28","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the internet topology","volume":"29","author":"Faloutsos","year":"1999","journal-title":"ACM SIGCOMM Comp. Commun. Rev."},{"key":"2023081805144950900_ref29","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","article-title":"Hierarchical organization of modularity in metabolic networks","volume":"297","author":"Ravasz","year":"2002","journal-title":"Science"},{"key":"2023081805144950900_ref30","first-page":"364","volume-title":"Proc. 10th IEEE Int. Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, Fort Worth, TX, USA, October 16","author":"Magoni","year":"2002"},{"volume-title":"Metis Official Website","author":"Karypis","key":"2023081805144950900_ref31"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/8\/1817\/51107572\/bxac041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/8\/1817\/51107572\/bxac041.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T05:16:09Z","timestamp":1692335769000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/8\/1817\/6568471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,14]]},"references-count":31,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,4,14]]},"published-print":{"date-parts":[[2023,8,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac041","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,8]]},"published":{"date-parts":[[2022,4,14]]}}}