GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies the traffic grooming and routing problem with simple path constraint (denoted as GR) in WDM mesh networks. To the best of our knowledge, the simple path constraint has not been studied in previous literature. However, this non-trivial constraint is essential in practice and it makes the traffic grooming and routing problem become much more challenging due to the introduction of quadratic constraints. By giving the mathematical formulation of the GR problem, we propose a greedy randomized adaptive search procedure (GRASP) for solving the GR problem, and introduce a mechanism to tackle the interaction between the grooming problem and the routing problem. To test the performance of the proposed GRASP algorithm, we apply it to tackle three sets of totally 38 instances generated according to real-world scenarios. Computational results show the efficacy of the GRASP algorithm in terms of both solution quality and search efficiency by comparison with public software LocalSolver and the lower bounds obtained by CPLEX.

Cite

CITATION STYLE

APA

Wu, X., Ye, T., Guo, Q., & Lü, Z. (2015). GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks. Computer Networks, 86, 27–39. https://doi.org/10.1016/j.comnet.2015.04.013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free