A fast path-based ILP formulation for offline RWA in mesh optical networks
A fast path-based ILP formulation for offline RWA in mesh optical networks
复制标题
网状光网络中离线 RWA 的基于快速路径的 ILP 公式
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
G. Rouskas
中科院分区：
文献类型：
--
作者：
Zeyu Liu;G. Rouskas
RWA是光网络设计和控制中的一个基本问题。我们引入了对称RWA解决方案的概念，并提出了一个新的ILP制定最佳构造这样的解决方案。制定规模的骨干和区域网络的网状拓扑结构的代表。数值结果表明，新的配方实现了减少高达两个数量级的运行时间相比，现有的配方。特别是，使用商用CPU可以在几分钟内获得多达20个节点的拓扑结构的最佳解决方案，并且可以在合理的时间内解决更大的网络。我们的方法大大降低了进入的门槛，充分探索光网络设计的解决方案空间，并通过广泛的“假设”分析预测需求的设计决策的敏感性调查。如果不对计算资源和时间进行大量投资，目前就无法进行这种分析。
RWA is a fundamental problem in the design and control of optical networks. We introduce the concept of symmetric RWA solutions and present a new ILP formulation to construct optimally such solutions. The formulation scales to mesh topologies representative of backbone and regional networks. Numerical results demonstrate that the new formulation achieves a decrease of up to two orders of magnitude in running time compared to existing formulations. In particular, optimal solutions for topologies up to 20 nodes can be obtained within minutes using commodity CPUs, and larger networks can be solved in reasonable time. Our approach significantly lowers the barrier to entry in fully exploring the solution space of optical network design and in investigating the sensitivity of design decisions to forecast demands via extensive “what-if” analysis. Such analysis cannot be carried out currently without large investments in computational resources and time.