WDM光网络上的路由和波长分配:moaco与经典方法的比较

A. Arteta, B. Barán, D. Pinto
{"title":"WDM光网络上的路由和波长分配:moaco与经典方法的比较","authors":"A. Arteta, B. Barán, D. Pinto","doi":"10.1145/1384117.1384126","DOIUrl":null,"url":null,"abstract":"The increasing demand of bandwidth has found an answer in Optical Transport Networks (OTN). To take advantage of the different resources that OTNs offer, several parameters need to be optimized to obtain good performance. Therefore, this work studies the Routing and Wavelength Assignment (RWA) problem in a multiobjective context. MultiObjective Ant Colony Optimization (MOACO) algorithms are implemented to simultaneously optimize the hop count and number of wavelength conversion for a set of unicast demands, considering wavelength conflicts. This way, a set of optimal solutions, known as Pareto Set, is calculated in one run of the proposed algorithm, without a priori restrictions on some objective. The proposed MOACO algorithms were compared to classical RWA heuristics using several performance metrics. Although, there is not a clear superiority, simulation results indicate that considering most of the performance metrics, MOACO algorithms obtain promising results when compared to the classical heuristics.","PeriodicalId":415618,"journal":{"name":"International Latin American Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches\",\"authors\":\"A. Arteta, B. Barán, D. Pinto\",\"doi\":\"10.1145/1384117.1384126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increasing demand of bandwidth has found an answer in Optical Transport Networks (OTN). To take advantage of the different resources that OTNs offer, several parameters need to be optimized to obtain good performance. Therefore, this work studies the Routing and Wavelength Assignment (RWA) problem in a multiobjective context. MultiObjective Ant Colony Optimization (MOACO) algorithms are implemented to simultaneously optimize the hop count and number of wavelength conversion for a set of unicast demands, considering wavelength conflicts. This way, a set of optimal solutions, known as Pareto Set, is calculated in one run of the proposed algorithm, without a priori restrictions on some objective. The proposed MOACO algorithms were compared to classical RWA heuristics using several performance metrics. Although, there is not a clear superiority, simulation results indicate that considering most of the performance metrics, MOACO algorithms obtain promising results when compared to the classical heuristics.\",\"PeriodicalId\":415618,\"journal\":{\"name\":\"International Latin American Networking Conference\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Latin American Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1384117.1384126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Latin American Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1384117.1384126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

带宽需求的不断增长在光传输网络(OTN)中得到了解决。为了利用otn提供的不同资源,需要优化几个参数以获得良好的性能。因此,本文研究了多目标环境下的路由和波长分配(RWA)问题。采用多目标蚁群优化(MOACO)算法,在考虑波长冲突的情况下,同时优化单播需求的跳数和波长转换次数。这样,一组最优解,被称为帕累托集,是在一次运行中计算出来的,没有对某些目标的先验限制。使用几个性能指标将提出的MOACO算法与经典的RWA启发式算法进行了比较。虽然没有明显的优势,但仿真结果表明,考虑到大多数性能指标,与经典启发式算法相比,MOACO算法获得了令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches
The increasing demand of bandwidth has found an answer in Optical Transport Networks (OTN). To take advantage of the different resources that OTNs offer, several parameters need to be optimized to obtain good performance. Therefore, this work studies the Routing and Wavelength Assignment (RWA) problem in a multiobjective context. MultiObjective Ant Colony Optimization (MOACO) algorithms are implemented to simultaneously optimize the hop count and number of wavelength conversion for a set of unicast demands, considering wavelength conflicts. This way, a set of optimal solutions, known as Pareto Set, is calculated in one run of the proposed algorithm, without a priori restrictions on some objective. The proposed MOACO algorithms were compared to classical RWA heuristics using several performance metrics. Although, there is not a clear superiority, simulation results indicate that considering most of the performance metrics, MOACO algorithms obtain promising results when compared to the classical heuristics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信