{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:18:32Z","timestamp":1753888712434,"version":"3.41.2"},"reference-count":21,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":174,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>In this paper, we analyze the problem of managing users from different slices connecting to a software\u2010defined network (SDN). We seek to minimize the propagation latency between switches and controllers as well as between controllers themselves. We also minimize the connection latency between users and their network access nodes. Thus, the main highlights of the paper are to formally represent the problem utilizing two equivalent mixed\u2010integer quadratic programming models. The first one represents the user requirements of each slice by using a membership matrix. The second one consists of subsets of users separated within each slice requirement. Subsequently, the above models are analyzed in a standard linearized version. Finally, they are compared with a proposed local search math\u2010heuristic algorithm. The proposed models and algorithm are solved with the CPLEX solver with default options. To the best of our knowledge, this journal paper constitutes a first attempt to incorporate network slicing in SDN allowing flexibility, resource efficiency, security, and effective management of the network facilitating the deployment of customized and adaptive services. Besides, our models allow us to deal with the management of connecting users to either controller or switch\u2010type nodes depending on the slice to which each user belongs. For security reasons, a certain slice could only have access to the network controllers, while the rest of the users that belong to the other slices can connect to the switch\u2010type nodes of the network. From the numerical experiments, we observe that the linear models show a better performance in terms of CPU times and the best solutions obtained. Similarly, our proposed approximation algorithm achieves near\u2010optimal solutions in significantly shorter CPU times, for all the input graph networks, when compared to the proposed exact models which allows for finding the optimal solutions.<\/jats:p>","DOI":"10.1155\/2024\/4849198","type":"journal-article","created":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T05:35:10Z","timestamp":1719207310000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Topology Management for Software\u2010Defined Networks Minimizing Latency and Using Network Slicing"],"prefix":"10.1155","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4917-6798","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Viveros","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2500-3294","authenticated-orcid":false,"given":"Pablo","family":"Adasme","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6391-6863","authenticated-orcid":false,"given":"Ali","family":"Dehghan Firoozabadi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2024,6,23]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"crossref","unstructured":"ViverosA. AdasmeP. JuanE. S. SotoI. andFiroozabadiA. D. Optimal user slicing with minimum latency for software defined networking 2023 South American Conference On Visible Light Communications (SACVLC) Proceedings of the 2023 South American Conference On Visible Light Communications (SACVLC) December 2023 Santiago Chile https:\/\/doi.org\/10.1109\/SACVLC59022.2023.10347845.","DOI":"10.1109\/SACVLC59022.2023.10347845"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-022-00510-8"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIA.2018.2803728"},{"key":"e_1_2_11_4_2","doi-asserted-by":"crossref","unstructured":"ChenH. X.andLauH. C. A math-heuristic approach for integrated resource scheduling in a maritime logistics facility 2011 IEEE International Conference on Industrial Engineering and Engineering Management Proceedings of the 2011 IEEE International Conference on Industrial Engineering and Engineering Management December 2011 Singapore 195\u2013199 https:\/\/doi.org\/10.1109\/IEEM.2011.6117906 2-s2.0-84863077385.","DOI":"10.1109\/IEEM.2011.6117906"},{"key":"e_1_2_11_5_2","unstructured":"Ibm Ilog IBM ILOG CPLEX optimization Studio 22.1.1 2022 https:\/\/www.ibm.com\/support\/pages\/downloading-ibm-ilog-cplex-optimization-studio-2211."},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2020.08.002"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2022.12.033"},{"key":"e_1_2_11_8_2","doi-asserted-by":"crossref","unstructured":"AbdellatifA. A. MohamedA. ErbadA. andGuizaniM. Dynamic network slicing and resource allocation for 5G-and-Beyond networks 2022 IEEE Wireless Communications and Networking Conference (WCNC) Proceedings of the 2022 IEEE Wireless Communications and Networking Conference (WCNC) April 2022 Austin TX USA 262\u2013267 https:\/\/doi.org\/10.1109\/WCNC51071.2022.9771877.","DOI":"10.1109\/WCNC51071.2022.9771877"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3228804"},{"key":"e_1_2_11_10_2","doi-asserted-by":"crossref","unstructured":"PrabhaC. GoelA. andSinghJ. A survey on SDN controller evolution: a brief review 2022 7th International Conference on Communication and Electronics Systems (ICCES) Proceedings of the 2022 7th International Conference on Communication and Electronics Systems (ICCES) June 2022 Coimbatore India 569\u2013575 https:\/\/doi.org\/10.1109\/ICCES54183.2022.9835810.","DOI":"10.1109\/ICCES54183.2022.9835810"},{"key":"e_1_2_11_11_2","doi-asserted-by":"crossref","unstructured":"Rasol RasolK. A.andDomingo-PascualJ. Joint placement latency optimization of the control plane 2020 International Symposium on Networks Computers and Communications (ISNCC) Proceedings of the 2020 International Symposium on Networks Computers and Communications (ISNCC) October 2020 Montreal QC Canada 1\u20136 https:\/\/doi.org\/10.1109\/ISNCC49221.2020.9297271.","DOI":"10.1109\/ISNCC49221.2020.9297271"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2021.3124280"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3149795"},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"MohantyS. ShekhawatA. S. SahooB. ApatH. K. andKhareP. Minimizing latency for controller placement problem in SDN 2021 19th OITS International Conference on Information Technology (OCIT) Proceedings of the 2021 19th OITS International Conference on Information Technology (OCIT) December 2021 Bhubaneswar India 393\u2013398 https:\/\/doi.org\/10.1109\/OCIT53463.2021.00083.","DOI":"10.1109\/OCIT53463.2021.00083"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3143948"},{"key":"e_1_2_11_16_2","doi-asserted-by":"crossref","unstructured":"WangT.andChenH. Optimal model for link failure foresight controller placement in SDN 2021 IEEE 4th International Conference on Electronics Technology (ICET) Proceedings of the 2021 IEEE 4th International Conference on Electronics Technology (ICET) May 2021 Chengdu China 727\u2013730 https:\/\/doi.org\/10.1109\/ICET51757.2021.9450905.","DOI":"10.1109\/ICET51757.2021.9450905"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"ZhaoZ. FanL. andHanZ. Hybrid quantum Benders\u2019 decomposition for mixed-integer linear programming 2022 IEEE Wireless Communications and Networking Conference (WCNC) Proceedings of the 2022 IEEE Wireless Communications and Networking Conference (WCNC) April 2022 Austin TX USA 2536\u20132540 https:\/\/doi.org\/10.1109\/WCNC51071.2022.9771632.","DOI":"10.1109\/WCNC51071.2022.9771632"},{"key":"e_1_2_11_18_2","doi-asserted-by":"crossref","unstructured":"ViverosA. AdasmeP. andUrrutiaE. S. J. Minimizing latency and number of controllers in software defined networking 2022 IEEE International Conference on Automation\/XXV Congress of the Chilean Association of Automatic Control (ICA-ACCA) Proceedings of the 2022 IEEE International Conference on Automation\/XXV Congress of the Chilean Association of Automatic Control (ICA-ACCA) October 2022 Curic\u00f3 Chile 1\u20136 https:\/\/doi.org\/10.1109\/ICA-ACCA56767.2022.10006004.","DOI":"10.1109\/ICA-ACCA56767.2022.10006004"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14391-5_10"},{"key":"e_1_2_11_20_2","first-page":"595","article-title":"Section 24.3: Dijkstra\u2019s algorithm","author":"Cormen T. H.","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"e_1_2_11_21_2","first-page":"17","article-title":"Applications de l\u2019algebre de boole en recherche operationelle","volume":"4","author":"Fortet R.","year":"1960","journal-title":"Revue Francaise d\u2019Automatique, d\u2019Informatique et de Recherche Op\u00e9rationnelle"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2024\/4849198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T05:35:26Z","timestamp":1719207326000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2024\/4849198"}},"subtitle":[],"editor":[{"given":"Roberto","family":"Natella","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1155\/2024\/4849198"],"URL":"https:\/\/doi.org\/10.1155\/2024\/4849198","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2023-12-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4849198"}}