Abstract
Flexible optical network (FON) architectures are considered a very promising solution where spectrum resources are allocated within flexible frequency grids. Routing and spectrum allocation (RSA) in FON is known to be an NP-complete problem. So far, this problem has been optimally solved for small instances by the application of integer linear programming and has been sub-optimally solved for more realistic instances by heuristic strategies. In this paper, we introduce the application of differential evolution (DE) to the RSA problem in flexible optical networks. Comparative studies show that in many cases DE outperforms many other well-known evolutionary computational approaches. Furthermore, the method typically requires few control parameters. An illustrative example is presented showing the effectiveness and efficiency of the proposed algorithm. Different heuristics and the DE-RSA algorithm are compared. To the best of our knowledge, our work is the first application of a DE algorithm to the RSA problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
