使用蚁群优化的碎片感知路由,空间和频谱分配

L. A. D. Lima, G. S. Pavani
{"title":"使用蚁群优化的碎片感知路由,空间和频谱分配","authors":"L. A. D. Lima, G. S. Pavani","doi":"10.1109/LATINCOM56090.2022.10000429","DOIUrl":null,"url":null,"abstract":"Space division multiplexing (SDM) allows for capacity expansion in the Elastic Optical Network (EON) by providing different spatial paths in the same link for the lightpaths. Thus, in addition to the Routing and Spectrum Assignment (RSA) problem, the Space sub-problem must be tackled during the allocation of resources in an SDM-EON environment. In this work, we propose a fully distributed provisioning algorithm based on the Ant Colony optimization (ACO) metaheuristics with a crankback mechanism to solve the Routing, Space, and Spectrum Assignment (RSSA) problem. The proposed algorithm can mitigate the blocking by taking into consideration the fragmentation caused by the dynamic establishment and release of lightpaths. The obtained simulation results demonstrate the effectiveness of the proposed approach when compared to fragmentation-aware algorithms that rely on the OSPF-TE protocol to gather the network state information while maintaining much lower levels of control overhead.","PeriodicalId":221354,"journal":{"name":"2022 IEEE Latin-American Conference on Communications (LATINCOM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fragmentation-aware Routing, Space, and Spectrum Assignment using Ant Colony Optimization\",\"authors\":\"L. A. D. Lima, G. S. Pavani\",\"doi\":\"10.1109/LATINCOM56090.2022.10000429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Space division multiplexing (SDM) allows for capacity expansion in the Elastic Optical Network (EON) by providing different spatial paths in the same link for the lightpaths. Thus, in addition to the Routing and Spectrum Assignment (RSA) problem, the Space sub-problem must be tackled during the allocation of resources in an SDM-EON environment. In this work, we propose a fully distributed provisioning algorithm based on the Ant Colony optimization (ACO) metaheuristics with a crankback mechanism to solve the Routing, Space, and Spectrum Assignment (RSSA) problem. The proposed algorithm can mitigate the blocking by taking into consideration the fragmentation caused by the dynamic establishment and release of lightpaths. The obtained simulation results demonstrate the effectiveness of the proposed approach when compared to fragmentation-aware algorithms that rely on the OSPF-TE protocol to gather the network state information while maintaining much lower levels of control overhead.\",\"PeriodicalId\":221354,\"journal\":{\"name\":\"2022 IEEE Latin-American Conference on Communications (LATINCOM)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Latin-American Conference on Communications (LATINCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LATINCOM56090.2022.10000429\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Latin-American Conference on Communications (LATINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM56090.2022.10000429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

空分复用(SDM)通过在同一链路上为光路提供不同的空间路径,从而允许弹性光网络(EON)的容量扩展。因此,在SDM-EON环境中,除了路由和频谱分配(RSA)问题之外,还必须解决空间子问题。在这项工作中,我们提出了一种基于蚁群优化(ACO)元启发式的全分布式供应算法,并采用曲back机制来解决路由、空间和频谱分配(RSSA)问题。该算法考虑了光路动态建立和释放所引起的碎片化,减轻了阻塞。仿真结果表明,与依赖OSPF-TE协议收集网络状态信息的碎片感知算法相比,该方法的有效性大大降低了控制开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fragmentation-aware Routing, Space, and Spectrum Assignment using Ant Colony Optimization
Space division multiplexing (SDM) allows for capacity expansion in the Elastic Optical Network (EON) by providing different spatial paths in the same link for the lightpaths. Thus, in addition to the Routing and Spectrum Assignment (RSA) problem, the Space sub-problem must be tackled during the allocation of resources in an SDM-EON environment. In this work, we propose a fully distributed provisioning algorithm based on the Ant Colony optimization (ACO) metaheuristics with a crankback mechanism to solve the Routing, Space, and Spectrum Assignment (RSSA) problem. The proposed algorithm can mitigate the blocking by taking into consideration the fragmentation caused by the dynamic establishment and release of lightpaths. The obtained simulation results demonstrate the effectiveness of the proposed approach when compared to fragmentation-aware algorithms that rely on the OSPF-TE protocol to gather the network state information while maintaining much lower levels of control overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信