Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks

• Published in: Networks Vol. 66; no. 4; pp. 253 - 266
• Main Authors: Kucharzak, Michal, Walkowiak, Krzysztof, Kopec, Pawel, Bulira, Damian, Kasprzak, Andrzej
• Format: Journal Article
• Language: English
• Published: New York Blackwell Publishing Ltd 01.12.2015; Wiley Subscription Services, Inc
• Subjects: Algorithms; constraint programming; elastic optical network; Heuristic methods; integer modeling; Mathematical models; Modelling; Networks; Optical communication; Optimization; Programming
• ISSN: 0028-3045; 1097-0037
• DOI: 10.1002/net.21635

Elastic optical network (EON) is a novel optical technology introduced recently to provide flexible and multibitrate data transmission in the optical layer. Since many new network services including cloud computing and content delivery networks are provisioned with the use of specialized data centers located in different network nodes, in place of one‐to‐one unicast transmission, the anycast transmission defined as one‐to‐one‐of‐many gains much popularity as a quite simple way to improve network performance. Therefore, this article focuses on modeling and static optimization of anycast flows in EONs. In particular, a N P ‐hard Routing and Spectrum Allocation for Restoration of Anycast Flows (RSA/RAF) problem is formulated. Next, various optimization approaches are proposed to solve this problem, namely, integer linear programming (ILP) using branch and bound algorithm, constraint programming (CP), and various heuristic approaches. Extensive numerical experiments are run to evaluate and compare all proposed methods. The main conclusion is that in some cases the CP approach is more efficient than the ILP modeling. Moreover, the results show that the SA algorithm significantly outperforms other heuristic methods. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 66(4), 253–266 2015