Integer programming models for the routing and spectrum allocation problem
Integer programming models for the routing and spectrum allocation problem
复制标题
路由和频谱分配问题的整数规划模型
DOI：
10.1007/s11750-018-0483-6
复制
发表时间：
2018
期刊：
影响因子：
1.7
通讯作者：
J. Marenco
中科院分区：
文献类型：
--
作者：
Federico Bertero;Marcelo Bianchetti;J. Marenco
在大型通信网络中处理巨大数据业务需求的最有前途的解决方案之一是通过灵活的光网络，特别是ITU-T标准G.694.1中规定的灵活网格（flexgrid）技术给出的。在本说明书中，光纤链路的频谱被划分为窄的频率槽。连续时隙的任何序列都可以用作简单信道，并且这样的信道可以在网络节点中切换以创建光路。在这种网络中，为一组竞争频谱资源的端到端需求建立光路的问题被称为路由和频谱分配问题（RSA）。由于其相关性，这一问题在过去几年中得到了深入研究。它已被证明是NP难的（Christodoulopoulos等人，IEEE J Lightw Technol 29（9）：1354-1366，2011; Wang等人，IEEE J Opt Commun Netw 4（11）：906-917，2012），并且已提出了若干模型和公式，导致不同的解决方案。在这项工作中，我们探讨RSA的整数规划模型，分析其有效性在已知的情况下。我们诉诸几种建模技术，找到这个问题的自然配方。由于整数规划技术是已知的，提供成功的实用方法的几个组合优化问题，这项工作的目的是探索一个类似的方法RSA。
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ITU-T standard G.694.1. In this specification, the frequency spectrum of an optical fiber link is divided into narrow frequency slots. Any sequence of consecutive slots can be used as a simple channel, and such a channel can be switched in the network nodes to create a lightpath. In this kind of networks, the problem of establishing lightpaths for a set of end-to-end demands that compete for spectrum resources is called the routing and spectrum allocation problem (RSA). Due to its relevance, this problem has been intensively studied in the last couple of years. It has been shown to be NP-hard (Christodoulopoulos et al. in IEEE J Lightw Technol 29(9):1354–1366, 2011; Wang et al. in IEEE J Opt Commun Netw 4(11):906–917, 2012) and several models and formulations have been proposed, leading to different solution approaches. In this work, we explore integer programming models for RSA, analyzing their effectiveness over known instances. We resort to several modeling techniques, to find natural formulations of this problem. Since integer programming techniques are known to provide successful practical approaches for several combinatorial optimization problems, the aim of this work is to explore a similar approach for RSA.