Solving large instances of the RSA problem in flexgrid elastic optical networks
Visualitza/Obre
Cita com:
hdl:2117/104366
Tipus de documentArticle
Data publicació2016-05-01
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
We present an optimization procedure that mixes advanced large-scale optimization methods and heuristics to solve large instances (with over 1.7 million integer variables) of the routing and spectrum allocation (RSA) problem-a basic optimization problem in flexgrid elastic optical networks. We formulate the problem as a mixed-integer program for which we develop a branch-and-price algorithm enhanced with such techniques as problem relaxations and cuts for improving lower bounds (LBs) for the optimal objective value, and an RSA heuristic for improving the upper bounds. All these elements are combined into an effective optimization procedure. The results of numerical experiments run on network topologies of different dimensions and with large demand sets show that the algorithm performs well and can be applied to the problem instances that are difficult to solve using commercial solvers such as CPLEX.
CitacióWalkowiak, K., Zotkiewicz, M., Klinkowski, M., Pioro, M., Ruiz, M., Velasco, L. Solving large instances of the RSA problem in flexgrid elastic optical networks. "Journal of optical communications and networking", 1 Maig 2016, vol. 8, núm. 5, p. 320-330.
ISSN1943-0620
Versió de l'editorhttps://www.osapublishing.org/jocn/abstract.cfm?uri=jocn-8-5-320
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
JOCN_R1_DRAC.pdf | 2,636Mb | Visualitza/Obre |