Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Channel allocation in elastic optical networks using traveling salesman problem algorithms

Not Accessible

Your library or personal account may give you access

Abstract

Elastic optical networks have been proposed to support high data rates in metro and core networks. However, frequency allocation of the channels (i.e., channel ordering) in such networks is a challenging problem. This requires arranging the optical channels within the frequency grid with the objective of ensuring a minimum signal-to-noise ratio (SNR). An optimal arrangement results in the highest SNR margin for the entire network. However, determining the optimal arrangement requires an exhaustive search through all possible arrangements (permutations) of the channels. The search space increases exponentially with the number of channels. This discourages an algorithm employing an exhaustive search for the optimal frequency allocation. We utilize the Gaussian noise (GN) model to formulate the frequency allocation (channel ordering) problem as a variant of the traveling salesman problem (TSP) using graph theory. Thereafter, we utilize graph-theoretic tools for the TSP from the existing literature to solve the channel ordering problem. Performance figures obtained for the proposed scheme show that it is marginally inferior to the optimal search (through all possible permutations) and outperforms any random allocation scheme. Moreover, the proposed scheme is implementable for a scenario with a large number of channels. In comparison, an exhaustive search with the GN model and split-step Fourier method simulations are shown to be feasible for a small number of channels only. It is also illustrated that the SNR decreases with an increase in bandwidth when the frequency separation is high.

© 2019 Optical Society of America

Full Article  |  PDF Article
More Like This
Load-Aware Nonlinearity Estimation for Elastic Optical Network Resource Optimization and Management

Rui Wang, Sarvesh Bidkar, Fanchao Meng, Reza Nejabati, and Dimitra Simeonidou
J. Opt. Commun. Netw. 11(5) 164-178 (2019)

Resource Allocation for Flexible-Grid Optical Networks With Nonlinear Channel Model [Invited]

Li Yan, Erik Agrell, Henk Wymeersch, and Maïté Brandt-Pearce
J. Opt. Commun. Netw. 7(11) B101-B108 (2015)

Resource Allocation for Elastic Optical Networks Using Geometric Optimization

Mohammad Hadi and Mohammad Reza Pakravan
J. Opt. Commun. Netw. 9(10) 889-899 (2017)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (8)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (1)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (11)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved