Multi population pattern searching algorithm for solving routing spectrum allocation with joint unicast and anycast problem in elastic optical networks

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

Abstract

Exponentially growing network traffic is triggered by different services including cloud computing, Content Delivery Networks and other. To satisfy these needs, new network technologies like Elastic Optical Networks (EON) are proposed. The EONs bring new, hard optimization problems, like Routing and Spectrum Allocation problem considered in this paper. The well-known and common tools to solve the NP-hard problems are Evolutionary Algorithms (EA). A number of EA-based methods were proposed to solve the RSA problem. However, the papers concerning the RSA problem omit the relatively new propositions of linkage learning methods. Therefore this paper proposes a new effective method that includes linkage learning, local optimization and is based on a novel, effective work schema to fill this gap.

Cite

CITATION STYLE

APA

Przewozniczek, M. (2015). Multi population pattern searching algorithm for solving routing spectrum allocation with joint unicast and anycast problem in elastic optical networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9375 LNCS, pp. 328–339). Springer Verlag. https://doi.org/10.1007/978-3-319-24834-9_39

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