Routing, Modulation Level, and Spectrum Assignment in Elastic Optical Networks—A Serial Stage Approach with Multiple Sub-Sets of Requests Based on Integer Linear Programming
IF 1.9 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Luis Víctor Maidana Benítez, Melisa María Rosa Villamayor Paredes, José Colbes, César F. Bogado-Martínez, B. Barán, D. Pinto-Roa
{"title":"Routing, Modulation Level, and Spectrum Assignment in Elastic Optical Networks—A Serial Stage Approach with Multiple Sub-Sets of Requests Based on Integer Linear Programming","authors":"Luis Víctor Maidana Benítez, Melisa María Rosa Villamayor Paredes, José Colbes, César F. Bogado-Martínez, B. Barán, D. Pinto-Roa","doi":"10.3390/mca28030067","DOIUrl":null,"url":null,"abstract":"This paper addresses serialized approaches of the routing, modulation level, and spectrum assignment (RMLSA) problem in elastic optical networks, using multiple sequential sub-sets of requests, under Integer Linear Programming (ILP). The literature has reported two-stage serial optimization methods referred to as RML+SA, which retain computational efficiency when the problem grows, compared to the classical one-stage RMLSA optimization approach. However, there still remain numerous issues in terms of the spectrum used that can be improved when compared to the RMLSA solution. Consequently, this paper proposes RML+SA solutions considering multiple sequential sub-sets of requests, split traffic flow, as well as path-oriented and link-oriented routing models. Simulation results on different test scenarios determine that: (a) the multiple sequential sub-sets of request-based models improve computation time without worsening the spectrum usage when compared to just one set of requests optimization approaches, (b) divisible traffic flow approaches show promise in cases where the number of request sub-sets is low compared to the non-divisible counterpart, and (c) path-oriented routing succeeds in improving the used spectrum by increasing the number of candidate routes compared to link-oriented routing.","PeriodicalId":53224,"journal":{"name":"Mathematical & Computational Applications","volume":" ","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical & Computational Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/mca28030067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper addresses serialized approaches of the routing, modulation level, and spectrum assignment (RMLSA) problem in elastic optical networks, using multiple sequential sub-sets of requests, under Integer Linear Programming (ILP). The literature has reported two-stage serial optimization methods referred to as RML+SA, which retain computational efficiency when the problem grows, compared to the classical one-stage RMLSA optimization approach. However, there still remain numerous issues in terms of the spectrum used that can be improved when compared to the RMLSA solution. Consequently, this paper proposes RML+SA solutions considering multiple sequential sub-sets of requests, split traffic flow, as well as path-oriented and link-oriented routing models. Simulation results on different test scenarios determine that: (a) the multiple sequential sub-sets of request-based models improve computation time without worsening the spectrum usage when compared to just one set of requests optimization approaches, (b) divisible traffic flow approaches show promise in cases where the number of request sub-sets is low compared to the non-divisible counterpart, and (c) path-oriented routing succeeds in improving the used spectrum by increasing the number of candidate routes compared to link-oriented routing.
期刊介绍:
Mathematical and Computational Applications (MCA) is devoted to original research in the field of engineering, natural sciences or social sciences where mathematical and/or computational techniques are necessary for solving specific problems. The aim of the journal is to provide a medium by which a wide range of experience can be exchanged among researchers from diverse fields such as engineering (electrical, mechanical, civil, industrial, aeronautical, nuclear etc.), natural sciences (physics, mathematics, chemistry, biology etc.) or social sciences (administrative sciences, economics, political sciences etc.). The papers may be theoretical where mathematics is used in a nontrivial way or computational or combination of both. Each paper submitted will be reviewed and only papers of highest quality that contain original ideas and research will be published. Papers containing only experimental techniques and abstract mathematics without any sign of application are discouraged.