Fast Exact ILP Decompositions for Ring RWA

An efficient algorithm for solving traffic grooming problems in optical networks

“…The threshold parameters of the algorithm may be tuned to achieve a desired tradeoff between running time and quality of the final solution for VTTR. By combining this algorithm with scalable RWA algorithms [10], [15], this decomposition approach scales well to both ring and mesh network topologies and enables operators to carry out extensive "what-if"analysis in optimizing their network.…”

“…We have shown in [13] that, whenever 978-1-4673-3122-7/13/$31.00 ©2013 IEEE IEEE ICC 2013 -Optical Networks and Systems the network is not wavelength (bandwidth) limited, this sequential solution yields an optimal solution to the original traffic grooming problem. We have also developed scalable optimal RWA algorithms for ring and mesh topologies in [15] and [10], respectively. Therefore, our focus here is on the VTTR subproblem.…”

Scalable Traffic Grooming in Optical Networks

“…It is a fundamental problem in optical network design, and has been studied extensively. In [5] we developed an exact ILP formulation based on maximal independent sets (MIS) that solves the RWA problem in rings of size up to N = 16 nodes (the maximum size supported by SONET technology and hence de facto maximum size of deployed ring networks) in just 2-3 seconds, several orders of magnitude faster than earlier known solutions. We have also developed a path-based formulations that solve the RWA problem in mesh networks up to two orders of magnitude faster than existing techniques [6].…”

“…We have also developed a path-based formulations that solve the RWA problem in mesh networks up to two orders of magnitude faster than existing techniques [6]. Therefore, we solve the RWA subproblem using the techniques in [5,6] rather than using the corresponding part of the formulation of the TG problem.…”

A fast path-based ILP formulation for offline RWA in mesh optical networks

“…This problem is NP-hard, and several integer linear program (ILP) formulations have been proposed to solve it. Recently, we developed an exact decomposition approach for an ILP formulation based on maximal independent sets that makes it possible to obtain optimal solutions to the RWA problem for maximum size (i.e., 16-node) SONET rings in only a few seconds using commodity CPUs [9]. This new, fast technique achieves several orders of magnitude decrease in running time.…”