Abstract
In WDM backbone networks, the traffic pattern evolves constantly, and a simple policy leads to a poor usage of resources and so to a higher blocking probability. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources.
In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted.
Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists.
We prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals.