An Optimization-Heuristic Approach to Dynamic Optical Bypassing

Abstract:
Due to the growing traffic volume, energy consumption is becoming a major concern in transport networks. Dynamic optical bypassing is one mechanism to reduce both energy consumption and resource requirements. In this paper, we propose a dynamic optical bypassing algorithm based on simulated annealing. This algorithm is execution-time optimized in view of periodic network reconfiguration e. g. every 15 minutes. An adjustable reconfiguration penalty assures stable network operation by limiting circuit set-ups and tear-downs. Evaluating the algorithm in a 15-node reference network, we obtain good bypass configurations in less than one minute. Moderate reconfiguration penalties efficiently reduce circuit modifications without affecting energy efficiency.