弹性光网络中可变带宽的半动态路由与频谱分配。蜜蜂启发算法方法

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}
引用次数: 0

摘要

弹性光网络(EON)是一项相当新的技术,由于其快速、灵活和频谱效率,具有广阔的前景。在EON网络中需要考虑的主要问题是路由和频谱分配(RSA),这是一个np完全问题。这项工作着重于具有可变带宽的半动态流量的情况。首先,我们广泛研究已经提出的技术来面对这个问题,重点是频谱的最佳利用,从而避免频谱重新分配,这将是本工作的主要目标。本文提出了基于人工蜂群(Artificial Bee Colony, ABC)和蜂群优化(Bee Colony Optimization, BCO)两种基于路由和排列的蜜蜂编码约定算法。对于这两种编码,我们使用固定替代路由和中拟合和第一拟合频谱分配。考虑阻塞概率和熵度量,在不同的流量负载和网络拓扑下进行了各种广泛的仿真。算法的效率随拓扑结构的不同而不同。一般来说,基于路由的ABC在较大的拓扑中有更好的结果,而基于排列的BCO在较小的拓扑中有出色的结果。但是,对于更大的拓扑,它并没有同样好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信