Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic

Goścień, Róża; Walkowiak, Krzysztof; Klinkowski, Mirosław

doi:10.1016/j.comnet.2014.12.004

Cited by 57 publications

(33 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The optimization criteria in their problem are related to spectrum usage (maximum and average). To the best of our knowledge, Aibin and Walkowiak (2014), Goścień et al (2015), Walkowiak, Goscien, et al (2013) and Walkowiak et al (2014) are the only papers that propose metaheuristic method to solve RSA problem with joint anycast and unicast demands.…”

Section: Related Workmentioning

confidence: 98%

“…In Aibin and Walkowiak (2014) and Patel et al (2012), simulated annealing method is applied for the RSA-based network planning problem as a method for ordering of demands. The authors of Goścień et al (2015), Walkowiak, Goscien, and Klinkowski (2013) and Walkowiak et al (2014) propose a Tabu Search Algorithm to solve RSA-based problems with joint anycast and unicast traffic demands. The optimization criteria in their problem are related to spectrum usage (maximum and average).…”

Section: Related Workmentioning

confidence: 99%

“…The above characteristics lead to a conclusion that to find effective tools for solving such problems evolutionary algorithms (EA) should be considered. Therefore, in this paper we propose a novel evolutionary algorithm for joint optimization of unicast and anycast traffic in EONs, more effective than already proposed methods (Aibin & Walkowiak, 2014;Goścień , Walkowiak, & Klinkowski, 2015;Walkowiak, Klinkowski, Rabiega, & Goscien, 2014). To outperform Tabu Search and Simulated Annealing methods designed for the RSA problems, the Multi Population Pattern Searching Algorithm (MuPPetS) was chosen as the research start point.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm – An elastic optical network optimization case study

Przewoźniczek

Goścień

Walkowiak

et al. 2015

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm – An elastic optical network optimization case study

Przewoźniczek

Goścień

Walkowiak

et al. 2015

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

“…Anycasting is used, among others, in content-deliver networks, in which certain content is replicated in a number of data centers (DCs). Similarly as in [12], we consider that lightpath connections deliver the requested (aggregated) content from DC to client nodes. The flexibility of anycasting in selecting a most convenient DC to which a lightpath is established, involves a large set of allowable routes/lightpaths, which may increase the RSA problem complexity.…”

Section: Anycast Traffic Demandsmentioning

confidence: 99%

“…In the literature, mixed-integer programming (MIP) formulations (e.g., [7], [8], [10]), metaheuristics (e.g., [3], [11], [12]), and heuristics (e.g., [8], [13]), have been proposed to solve RSA. (Meta)heuristics can produce locally optimal solutions, however, without guarantees for global optimality.…”

Section: Introductionmentioning

confidence: 99%

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

Klinkowski

Żotkiewicz

Walkowiak

et al. 2016

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

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 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.Index Terms-branch and price, cuts, elastic optical networks, large-scale optimization, mixed-integer programming, relaxations, routing and spectrum allocation.

show abstract

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

et al. 2015

Self Cite

View full text Add to dashboard Cite

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-toone-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.

show abstract

Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic

Cited by 57 publications

References 34 publications

Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm – An elastic optical network optimization case study

Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm – An elastic optical network optimization case study

Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks

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

Contact Info

Product

Resources

About