Date Added: Sep 2010
The authors study the benefits and trade-offs of using scheduled lightpaths for traffic adaptation. They 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. Their model quantitatively measures the timing satisfactions or violations. They apply the Lagrangian relaxation and sub-gradient methods to the formulated optimization problem, with which great computational efficiency is demonstrated when compared with other existing algorithms.