Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Virtual-topology adaptation for WDM mesh networks under dynamic traffic
IEEE/ACM Transactions on Networking (TON)
Computing Minimum Feedback Vertex Sets by Contraction Operations and its Applications on CAD
ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
| Hi-index | 0.00 |
Lightpath Reconfiguration is a common task that is often performed in order to improve resources utilization. The WDM reconfiguration problem becomes non-trivial when the new set of lightpaths requires the release of resources previously seized by the old ones, but, in order to assure continuous traffic flow, the old ones cannot be torn down before the new ones are set up. Under these conditions the reconfiguration is in a deadlock state. This can only be solved by temporary disruption of some connections. Depending on the network operator's policy, it could be desirable to either: a) minimize the total number of disrupted connections or, b) minimize the number of concurrent disrupted connections (at any time during the reconfiguration process). Considering either of the objectives in the lightpath reconfiguration problem bring NP-hard problems on. In this paper, we, firstly, show that both objectives are conflictive. We propose two algorithms for solving the problem considering the second objectives in two steps. We perform simulations that shows the trade-off between these two objectives.