复杂业务需求下的光网络规划问题的研究

Study of optical network planning under complex traffic requirements

研究了复杂业务需求下的光网络规划问题,建立了支持多种业务需求和保护需求的ILP数学模型;针对大型光网络相应的整数线性模型规模过大、难以求解的困难,引入了Bender数学分解方法。计算结果表明,利用Bender分解可以有效地求解复杂业务需求和保护需求下的光网络规划问题,同时降低时间和内存的消耗。

This paper studied optical network planning under complex traffic requirements. Formulated the planning problem into an integer linear programming （ILP） , where supported connections or applications with different bandwidth requirements and protection requirements. Due to the very high computation complexity induced in solving the ILP for large networks ,intro- duced Bender decomposition. Results show that using Bender decomposition can find the solution for large optical networks effectively, with much less time and memory consumptions.