Lightpath Scheduling and Routing for Traffic Adaptation in WDM Networks
We study the benefits and trade-offs of using scheduled lightpaths for traffic adaptation. We propose a network planning model that allows lightpaths to slide within their desired timing windows with no penalty on the optimization objective and to slide beyond their desired timing windows with a decreasing tolerance level. Our model quantitatively measures the timing satisfactions or violations. We apply the Lagrangian relaxation and subgradient methods to the formulated optimization problem, with which great computational efficiency is demonstrated when compared with other existing algorithms. Our simulation results show how timing flexibility improves network resource utilization and reduces rejections.
networks assignment and routing algorithms combinatorial network design network optimization