Browse Prior Art Database

SPECTRUM ASSIGNMENT DEFRAGMENTATION AND/OR OPTIMIZATION ALGORITHM AND HEURISTIC FOR FIXED AND FLEXIBLE GRID OPTICAL NETWORKS

IP.com Disclosure Number: IPCOM000248846D
Publication Date: 2017-Jan-17
Document File: 18 page(s) / 1M

Publishing Venue

The IP.com Prior Art Database

Abstract

The present disclosure provides an algorithm and heuristic solving the optimization and defragmentation problem of wavelength/spectrum assignment in fixed and flexible grid optical networks. The search and sorting are done using simple Boolean operations and number manipulations which minimize the running time and complexity leading to a simple, fast and efficient application programming. The running time is a few seconds as most of the operations are Boolean algebra which is quickly processed by any laptop or desktop computer.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 14% of the total text.

SPECTRUM ASSIGNMENT DEFRAGMENTATION AND/OR OPTIMIZATION ALGORITHM AND HEURISTIC FOR FIXED AND FLEXIBLE GRID OPTICAL NETWORKS

ABSTRACT

The present disclosure provides an algorithm and heuristic solving the optimization and defragmentation problem of wavelength/spectrum assignment in fixed and flexible grid optical networks.  The search and sorting are done using simple Boolean operations and number manipulations which minimize the running time and complexity leading to a simple, fast and efficient application programming.  The running time is a few seconds as most of the operations are Boolean algebra which is quickly processed by any laptop or desktop computer.

DETAILED DESCRIPTION

Routing and Wavelength Assignment (RWA) is a well-known problem for fixed grid optical networks while Routing and Spectrum Assignment (RSA) is its equivalent term to the same problem for flexible grid optical networks.  In fixed grid optical networks, wavelengths are spaced apart from each other according to a wavelength spectrum grid defined by International Telecommunication Union (ITU) in ITU-T G.694.1 (02/12), “Spectral grids for WDM applications: DWDM frequency grid,” the contents of which are incorporated by reference.  In flexible grid optical networks, which is also described in ITU Recommendation G.694.1 “Spectral grids for WDM applications: DWDM frequency grid” (02/12), each signal can be allocated to spectrum with different widths optimized for the bandwidth requirements of the particular bit rate and modulation scheme of the individual channels.  The ultimate objective of RWA or RSA is to find a wavelength or spectrum assignment on a route for a particular channel in the optical network, such assignment and routing being optimal in some manner.

Most conventional approaches to RWA deal with routing and wavelength assignment as two sub-problems.  The majority of routing solutions is constrained-shortest-path while wavelength assignment is done by simple random-fit or first-fit techniques.  There are various adequate solutions to RWA in the fixed grid domain; however, there is none or few complete solutions for RSA in the flexible grid domain.   At present, the research for RSA in the flexible grid domain is still focused on the problem description or special case solution without describing a complete algorithm or technique to solve ultimately RSA.  Without adequate RSA techniques, the transition from the fixed grid to the flexible grid is expected to be slow and difficult despite the benefits of the flexible grid. 

Recalling that the conventional approaches solve routing and wavelength assignment as two problems, namely routing first and then wavelength assignment secondly.  Disadvantageously, the resulting solution may not be globally optimal, since another route may need to be chosen as a result of the wavelength assignment analysis.  Traditional searching techniques for a paired solution of both the routing and wavelength assignme...