Christian D. Pérez-López, Luis M. Soto-Bovó, José Colbes, D. Pinto
{"title":"弹性光网络中可变带宽的半动态路由与频谱分配。蜜蜂启发算法方法","authors":"Christian D. Pérez-López, Luis M. Soto-Bovó, José Colbes, D. Pinto","doi":"10.1109/CLEI53233.2021.9639900","DOIUrl":null,"url":null,"abstract":"Elastic Optical Networks (EON) are a considerably new technology and have a promising future due to their fast speed, flexibility, and spectrum efficiency. The main point to consider in EON networks is the routing and spectrum assignment (RSA), an NP-complete problem. This work focuses on cases where there is semi-dynamic traffic with variable bandwidth. Initially, we broadly study techniques already proposed to face this problem, focusing on the best use of the spectrum and thus avoid spectrum reassignment, which will be the main objective of this work. This work proposes two promissory algorithms based on Artificial Bee Colony (ABC) and Bee Colony Optimization (BCO) with the encoding of bee based on routing and permutation. For both encodings, we use Fixed Alternative Routing and Mid-Fit and First-Fit spectrum assignment. Various and extensive simulations were conducted with different traffic loads and network topologies considering blocking probability and entropy measures. The efficiency of the algorithms varies according to the topologies. In general terms, routing-based ABC had better results in larger topologies, while permutation-based BCO having outstanding results in smaller topologies. Still, it does not have good results in the same way for larger topologies.","PeriodicalId":6803,"journal":{"name":"2021 XLVII Latin American Computing Conference (CLEI)","volume":"56 1","pages":"1-10"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Semi-dynamic Routing and Spectrum Assignment with variable bandwidth in Elastic Optical Networks. Bee-inspired Algorithms approach\",\"authors\":\"Christian D. Pérez-López, Luis M. Soto-Bovó, José Colbes, D. Pinto\",\"doi\":\"10.1109/CLEI53233.2021.9639900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Elastic Optical Networks (EON) are a considerably new technology and have a promising future due to their fast speed, flexibility, and spectrum efficiency. The main point to consider in EON networks is the routing and spectrum assignment (RSA), an NP-complete problem. This work focuses on cases where there is semi-dynamic traffic with variable bandwidth. Initially, we broadly study techniques already proposed to face this problem, focusing on the best use of the spectrum and thus avoid spectrum reassignment, which will be the main objective of this work. This work proposes two promissory algorithms based on Artificial Bee Colony (ABC) and Bee Colony Optimization (BCO) with the encoding of bee based on routing and permutation. For both encodings, we use Fixed Alternative Routing and Mid-Fit and First-Fit spectrum assignment. Various and extensive simulations were conducted with different traffic loads and network topologies considering blocking probability and entropy measures. The efficiency of the algorithms varies according to the topologies. In general terms, routing-based ABC had better results in larger topologies, while permutation-based BCO having outstanding results in smaller topologies. Still, it does not have good results in the same way for larger topologies.\",\"PeriodicalId\":6803,\"journal\":{\"name\":\"2021 XLVII Latin American Computing Conference (CLEI)\",\"volume\":\"56 1\",\"pages\":\"1-10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 XLVII Latin American Computing Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI53233.2021.9639900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 XLVII Latin American Computing Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI53233.2021.9639900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semi-dynamic Routing and Spectrum Assignment with variable bandwidth in Elastic Optical Networks. Bee-inspired Algorithms approach
Elastic Optical Networks (EON) are a considerably new technology and have a promising future due to their fast speed, flexibility, and spectrum efficiency. The main point to consider in EON networks is the routing and spectrum assignment (RSA), an NP-complete problem. This work focuses on cases where there is semi-dynamic traffic with variable bandwidth. Initially, we broadly study techniques already proposed to face this problem, focusing on the best use of the spectrum and thus avoid spectrum reassignment, which will be the main objective of this work. This work proposes two promissory algorithms based on Artificial Bee Colony (ABC) and Bee Colony Optimization (BCO) with the encoding of bee based on routing and permutation. For both encodings, we use Fixed Alternative Routing and Mid-Fit and First-Fit spectrum assignment. Various and extensive simulations were conducted with different traffic loads and network topologies considering blocking probability and entropy measures. The efficiency of the algorithms varies according to the topologies. In general terms, routing-based ABC had better results in larger topologies, while permutation-based BCO having outstanding results in smaller topologies. Still, it does not have good results in the same way for larger topologies.