核心网光岛设计:从路由到频谱分配

D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada, H. Simonis
{"title":"核心网光岛设计:从路由到频谱分配","authors":"D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada, H. Simonis","doi":"10.1109/ICTAI.2014.90","DOIUrl":null,"url":null,"abstract":"We consider a network design problem arising in the development of an all-optical future generation Internet network called a flex-grid. An optical island is a set of core nodes that can be fully interconnected by transparent wavelength routes. We present a mathematical model for finding an optimal optical island, show that it is an NP-hard problem, and present a decomposition for solving it. In a first phase, we choose network links and route the traffic over the resulting network. In the second phase, we allocate the light-paths associated with the traffic requests to individual fibres and spectrum segments on the fibres. This so-called routing and spectrum assignment (RSA) problem is a generalisation of the well-known routing and wavelength assignment problem (RWA) of conventional optical networks. Flex-grid optical networks allow us to bundle higher capacity connection requests by allocating channels in a number of contiguous frequency slots, providing increased throughput, as long as the connection length is below technological limits. We solve the first part of the decomposition with a large neighborhood search, and the second with a CP model using a single GEOST global constraint. Results for Ireland and Italy show that solutions of high quality can be found by this decomposition.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation\",\"authors\":\"D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada, H. Simonis\",\"doi\":\"10.1109/ICTAI.2014.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a network design problem arising in the development of an all-optical future generation Internet network called a flex-grid. An optical island is a set of core nodes that can be fully interconnected by transparent wavelength routes. We present a mathematical model for finding an optimal optical island, show that it is an NP-hard problem, and present a decomposition for solving it. In a first phase, we choose network links and route the traffic over the resulting network. In the second phase, we allocate the light-paths associated with the traffic requests to individual fibres and spectrum segments on the fibres. This so-called routing and spectrum assignment (RSA) problem is a generalisation of the well-known routing and wavelength assignment problem (RWA) of conventional optical networks. Flex-grid optical networks allow us to bundle higher capacity connection requests by allocating channels in a number of contiguous frequency slots, providing increased throughput, as long as the connection length is below technological limits. We solve the first part of the decomposition with a large neighborhood search, and the second with a CP model using a single GEOST global constraint. Results for Ireland and Italy show that solutions of high quality can be found by this decomposition.\",\"PeriodicalId\":142794,\"journal\":{\"name\":\"2014 IEEE 26th International Conference on Tools with Artificial Intelligence\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 26th International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2014.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2014.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们考虑了在发展下一代全光因特网网络时出现的一个网络设计问题,即弹性网格。光岛是一组核心节点,可以通过透明波长路由完全互连。我们提出了一个寻找最优光岛的数学模型,表明这是一个np困难问题,并给出了求解该问题的分解。在第一阶段,我们选择网络链路,并在生成的网络上路由流量。在第二阶段,我们将与流量请求相关的光路分配给单个光纤和光纤上的频谱段。这个所谓的路由和频谱分配(RSA)问题是传统光网络中众所周知的路由和波长分配(RWA)问题的推广。弹性网格光网络允许我们通过在许多连续的频率槽中分配信道来捆绑更高容量的连接请求,只要连接长度低于技术限制,就可以提供更高的吞吐量。我们使用大邻域搜索解决了分解的第一部分,使用单个GEOST全局约束解决了CP模型的第二部分。爱尔兰和意大利的结果表明,通过这种分解可以找到高质量的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation
We consider a network design problem arising in the development of an all-optical future generation Internet network called a flex-grid. An optical island is a set of core nodes that can be fully interconnected by transparent wavelength routes. We present a mathematical model for finding an optimal optical island, show that it is an NP-hard problem, and present a decomposition for solving it. In a first phase, we choose network links and route the traffic over the resulting network. In the second phase, we allocate the light-paths associated with the traffic requests to individual fibres and spectrum segments on the fibres. This so-called routing and spectrum assignment (RSA) problem is a generalisation of the well-known routing and wavelength assignment problem (RWA) of conventional optical networks. Flex-grid optical networks allow us to bundle higher capacity connection requests by allocating channels in a number of contiguous frequency slots, providing increased throughput, as long as the connection length is below technological limits. We solve the first part of the decomposition with a large neighborhood search, and the second with a CP model using a single GEOST global constraint. Results for Ireland and Italy show that solutions of high quality can be found by this decomposition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信