{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:34:42Z","timestamp":1760232882881,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"24","license":[{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSFC","award":["62102304","62272367"],"award-info":[{"award-number":["62102304","62272367"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The elastic optical network (EON) adopting virtual network function (VNF) is a new type of network, in which the routing, spectrum, and data center allocation are key and challenging problems, and solving these three problems simultaneously can not only improve the network efficiency for network providers, but also let users obtain better service. However, few existing works handle these three problems simultaneously. To tackle the three problems simultaneously, given a set of network function chains (i.e., a set of tasks), we set up a new multi-objective optimization model in which the total length of paths for all tasks is minimized, the totally occupied spectrums are minimized, and the loads on all data centers are most balanced, simultaneously. To solve the model, we design two new evolutionary algorithms. The experiments are conducted on 16 cases of 4 widely used types of networks, and the results indicate that the proposed model and algorithms are effective.<\/jats:p>","DOI":"10.3390\/s22249579","type":"journal-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T05:50:52Z","timestamp":1670392252000},"page":"9579","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Resource and Task Scheduling Based Multi-Objective Optimization Model and Algorithms in Elastic Optical Networks"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6868-0004","authenticated-orcid":false,"given":"Yuping","family":"Wang","sequence":"first","affiliation":[{"name":"School of Science, Xi\u2019an Technological University, Xi\u2019an 710021, China"}]},{"given":"Qingdong","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi\u2019an 710071, China"}]},{"given":"Xiaofang","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Science, Xi\u2019an Technological University, Xi\u2019an 710021, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.osn.2016.08.003","article-title":"Study and analysis of routing and spectrum allocation (RSA) and routing, modulation and spectrum allocation (RMSA) algorithms in elastic optical networks (EONs)","volume":"23","author":"Abkenar","year":"2017","journal-title":"Opt. Switch. Netw."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Alyatama, A. (2020, January 14\u201316). Multi-path routing based on relative cost in elastic optical networks. Proceedings of the 2020 7th International Conference on Electrical and Electronics Engineering (ICEEE), Virtual Conference.","DOI":"10.1109\/ICEEE49618.2020.9102529"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"45071","DOI":"10.1109\/ACCESS.2020.2977612","article-title":"Link state aware dynamic routing and spectrum allocation strategy in elastic optical networks","volume":"8","author":"Zhou","year":"2020","journal-title":"IEEE Access"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1364\/JOCN.10.000832","article-title":"Tidal-traffic-aware routing and spectrum allocation in elastic optical networks","volume":"10","author":"Yan","year":"2018","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1364\/JOCN.379585","article-title":"Relative cost routing and spectrum allocation in elastic optical networks","volume":"12","year":"2020","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.swevo.2018.04.013","article-title":"Two metaheuristics for routing and spectrum allocation in cloud-ready survivable elastic optical networks","volume":"44","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1109\/TNET.2017.2668470","article-title":"An approach for service function chain routing and virtual function network instance migration in network function virtualization architectures","volume":"25","author":"Eramo","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TNSM.2016.2598068","article-title":"A scalable algorithm for the placement of service function chains","volume":"13","author":"Mechtri","year":"2016","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TNSM.2016.2598420","article-title":"Resource allocation in NFV: A comprehensive survey","volume":"13","author":"Herrera","year":"2016","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1364\/JOCN.398749","article-title":"Virtualization of elastic optical networks and regenerators with traffic grooming","volume":"12","author":"Assis","year":"2020","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1109\/JSAC.2021.3064664","article-title":"Highly-efficient switch migration for controller load balancing in elastic optical inter-datacenter networks","volume":"39","author":"Liu","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"153615","DOI":"10.1016\/j.aeue.2021.153615","article-title":"Resource planning on elastic optical networks using traffic matrix prediction","volume":"134","author":"Mesquita","year":"2021","journal-title":"Int. J. Electron. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1109\/JLT.2020.3045600","article-title":"Prediction-based end-to-end dynamic network slicing in hybrid elastic fiber-wireless networks","volume":"39","author":"Yin","year":"2021","journal-title":"J. Light. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/LCOMM.2021.3053612","article-title":"Constrained reinforcement learning for resource allocation in network slicing","volume":"25","author":"Xu","year":"2021","journal-title":"IEEE Commun. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/TNET.2022.3156178","article-title":"Joint wireless and edge computing resource management with dynamic network slice selection","volume":"30","author":"Josilo","year":"2022","journal-title":"IEEE-ACM Trans. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1364\/AO.385140","article-title":"Static resource allocation of advanced reservation requests in elastic optical networks","volume":"59","author":"Zhao","year":"2020","journal-title":"Appl. Opt."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"100629","DOI":"10.1016\/j.osn.2021.100629","article-title":"Improving Efficiency of Network Resources in Elastic Optical Transport Network by Using In-Network Cache Functions","volume":"42","author":"Miyamura","year":"2021","journal-title":"Opt. Switch. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"102661","DOI":"10.1016\/j.yofte.2021.102661","article-title":"Cost-adaptive multi-class multicast service aggregation based on distributed sub-trees in elastic optical data center networks","volume":"66","author":"Tang","year":"2021","journal-title":"Opt. Fiber Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"100583","DOI":"10.1016\/j.osn.2020.100583","article-title":"Elastic optical network with spectrum slicing for fragmented bandwidth allocation","volume":"38","author":"Kitsuwan","year":"2020","journal-title":"Opt. Switch. Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"108717","DOI":"10.1016\/j.comnet.2021.108717","article-title":"Balanced resource allocation for VNF service chain provisioning in inter-datacenter elastic optical networks","volume":"203","author":"Khatiri","year":"2022","journal-title":"Comput. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3341","DOI":"10.1109\/TNSM.2022.3172344","article-title":"Deep Reinforcement Learning for Provisioning Virtualized Network Function in Inter-Datacenter Elastic Optical Networks","volume":"19","author":"Zhu","year":"2022","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Kalyanmoy","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1186810.1186815","article-title":"Finding the k shortest simple paths: A new algorithm and its implementation","volume":"3","author":"Hershberger","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1364\/JOCN.5.000836","article-title":"Efficient resource allocation for all-optical multicasting over spectrum-sliced elastic optical networks","volume":"5","author":"Gong","year":"2013","journal-title":"IEEE\/OSA J. Opt. Commun. Netw."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/s11082-017-1022-7","article-title":"New bi-level programming model for routing and spectrum assignmentin elastic optical network","volume":"49","author":"Xuan","year":"2017","journal-title":"Opt. Quantum Electron."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TSMCA.2003.817059","article-title":"U-measure: A quality measure for multiobjective programming","volume":"33","author":"Leung","year":"2003","journal-title":"IEEE Trans. Syst. Man Cybern"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of multiobjective evolutionary algorithms: Empirical results","volume":"8","author":"Zitzler","year":"2000","journal-title":"Evol. Comput."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/24\/9579\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:35:34Z","timestamp":1760146534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/24\/9579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,7]]},"references-count":27,"journal-issue":{"issue":"24","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["s22249579"],"URL":"https:\/\/doi.org\/10.3390\/s22249579","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2022,12,7]]}}}