Examples involving 'WDM'

Solve the routing and wavelength assignment problem assuming no wavelength conversion capabilities

Keywords: Capacity assignment (CA), Flow assignment (FA), JOM, MILP formulation, WDM

Given a network topology of OADM optical nodes connected by WDM fiber links, and a traffic demand of lightpath requests, this algorithm optimally computes the RWA (Routing and Wavelength Assignment) that carries all the lightpaths minimizing the average propagation delay, solving an Integer Linear Program (ILP). Wavelength conversion is not allowed. Only those routes with a length below a user-defined threshold maxLightpathLengthInKm are accepted. All the channels are of the same binaryRatePerChannel_Gbps capacity. The offered traffic demand is supposed to be measured in Gbps, and is rounded up to a multiple of binaryRatePerChannel_Gbps.

Point-to-point WDM line engineering report

Keywords: WDM

This report checks the correctness of the line engineering design of the point-to-point WDM links in an optical network, following the guidelines described in ITU-T Manual 2009 "Optical fibres, cables and systems" (chapter 7, section 2 Worst case design for system with optical line amplifiers).

WDM Fast Reroute

Keywords: Regenerator placement, Restoration algorithm, WDM

This algorithm implements a local lightpath restoration mechanism. Since it assumes that the WDM network requires regenerators/wavelength converters, if the input design does not contain them, the algorithm computes the requirements of regeneration/conversion for each lightpath.

RWA-CAC algorithm based on k-shortest path routing

Keywords: WDM

This algorithm receives lightpath connection requests and releases. For each lightpath release, wavelength resources are liberated. For each lightpath request, it determines how many lightpaths are actually required. Then, it tries to allocate them over a set of precomputed k-shortest paths (maximum path length in km equal to maxLightpathLengthInKm) using first-fit wavelength assignment (wavelength continuity is enforced).

Adjust dynamically the number of lightpaths of end-to-end lightpath demands

Keywords: WDM

At each time interval, this algorithm adjusts dynamically the number of lightpaths for each demand with respect to the ones in the previous period.

In case that new lightpaths are required, it performs an RWA using first-fit (wavelength continuity is enforced) over a set of precomputed k-shortest paths (maximum path length in km equal to maxLightpathLengthInKm). These paths are evaluated in order. Once a feasible RWA is found, then the lightpath is allocated, and no other candidate solution is checked.